CN113162852B - Method and device for configuring SR (scheduling request) sticky nodes - Google Patents
Method and device for configuring SR (scheduling request) sticky nodes Download PDFInfo
- Publication number
- CN113162852B CN113162852B CN202110322166.5A CN202110322166A CN113162852B CN 113162852 B CN113162852 B CN 113162852B CN 202110322166 A CN202110322166 A CN 202110322166A CN 113162852 B CN113162852 B CN 113162852B
- Authority
- CN
- China
- Prior art keywords
- network element
- node
- sticky
- range
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/34—Source routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
Abstract
The present invention relates to the field of communications, and in particular, to a method and an apparatus for SR sticky node configuration. The method comprises the following steps: acquiring the label stack depth of each network element between an SR service source network element and a host network element, and dividing the network element range of each network element according to the label stack depth; taking an SR service source network element as a calculation starting network element, taking an intersection of network element ranges of all network elements in the network element range of the calculation starting network element, and taking a network element which is farthest away from the calculation starting network element in the intersection as an adhesion node; calculating the network element of the next adhesion node backwards in sequence by taking the previous adhesion node as a calculation starting network element; and finishing the configuration when the network element range of the initial network element contains the sink network element. The invention focuses the scattered adhesive nodes on some devices with strong device capability, so that the layout of the adhesive nodes is more reasonable, the network operator can reasonably layout the devices supporting the device label stack, and the deployment cost of the network operator is effectively reduced.
Description
[ technical field ] A method for producing a semiconductor device
The present invention relates to the field of communications, and in particular, to a method and an apparatus for SR sticky node configuration.
[ background of the invention ]
With the rapid development of telecommunication services, the size of a transmission network is continuously enlarged, and the size of a tunnel-level service is larger, wherein the use of Segment Routing (SR) service is more and more common. With the increasing network topology, the length of the routing table exceeds the range of the device label stack in the SR service routing, and at this time, SR service sticky nodes need to be configured.
In the current SR bonding node configuration method, because the source and the destination of each SR service are different, the bonding node positions directly calculated according to the support capability of the device label stack are relatively dispersed, resulting in a large number of dispersed bonding nodes in the whole network topology. Because the requirement on the label stack capacity of the equipment by configuring the sticky nodes is high, the equipment is required to have high performance, so that the equipment cost is also high, if the sticky nodes are configured unreasonably, a large amount of high-performance equipment is required in a network, and a network operator needs to complete deployment at a high cost.
In view of this, how to overcome the defects in the prior art and solve the problem of the existing adhesive node configuration method that the adhesive nodes are scattered is a problem to be solved in the technical field.
[ summary of the invention ]
Aiming at the defects or improvement requirements of the prior art, the invention solves the problem that the distribution of the bonded nodes in the network is more dispersed due to the current bonded node configuration algorithm.
The embodiment of the invention adopts the following technical scheme:
in a first aspect, the present invention provides a method for SR sticky node configuration, specifically: acquiring the label stack depth of each network element between an SR service source network element and a host network element, and dividing the network element range of each network element according to the label stack depth; taking an SR service source network element as a calculation starting network element, taking an intersection of network element ranges of all network elements in the network element range of the calculation starting network element, and taking a network element which is farthest away from the calculation starting network element in the intersection as an adhesion node; calculating the network element of the next adhesion node backwards in sequence by taking the previous adhesion node as a calculation starting network element; and finishing the configuration when the network element range of the initial network element contains the sink network element.
Preferably, the network elements which are the preferred sticky nodes are determined according to the network topology and the equipment type; and when the intersection comprises the preferred adhesion node, taking the preferred adhesion node as the adhesion node.
Preferably, when a plurality of preferred sticky nodes exist in the intersection, the preferred sticky node farthest from the calculation starting network element is taken as the sticky node.
Preferably, the method further includes, with the preferred sticky node farthest from the calculation starting network element as the sticky node: when the label stack of the sticky node is full, taking the preferred sticky node which is next far from the calculation starting network element as the sticky node; and when the label stacks of all the preferred sticky nodes are full, taking the network element farthest from the calculation starting network element as the sticky node.
Preferably, determining the network element as the preferred sticky node according to the network topology and the device type specifically includes: and determining the network element as the preferred sticky node according to one or more items of the label stack depth, the routing capability and the calculation performance of the network element.
Preferably, dividing the network element range of each network element according to the label stack depth specifically includes: acquiring the maximum number of labels which can be contained in a label stack of a current network element; starting from the last network element of the current network element, acquiring the network element with the same number as the maximum label forward to serve as the forward network element range of the current network element; starting from the next network element of the current network element, backward acquiring the network element with the same number as the maximum label as the backward network element range of the current network element; and acquiring one of the forward network element range and the backward network element range which is positioned in the network element range of the calculation starting network element as the network element range of the current network element.
Preferably, the obtaining the network element with the same number as the maximum number of tags backward further includes: judging whether the number of the network elements between the current network element and the SR service sink node is larger than the label stack depth of the network element; if so, the network element range comprises the number of network elements corresponding to the label stack depth of the current network element; if not, the network element range includes all network elements between the current network element and the SR service sink node.
Preferably, the calculating of the intersection of the network element ranges of all network elements in the network element range of the starting network element specifically includes: acquiring network element ranges of an initial network element and a next network element of the initial network element, and taking the network elements simultaneously contained in the two network element ranges as an intersection; and sequentially obtaining the network element range of the next network element, and taking the intersection with the intersection calculated in the previous time again until the last network element in the network element range in which the next network element is the initial network element.
Preferably, when the SR service is created, the sticky nodes of the SR service are calculated.
On the other hand, the invention provides a device for SR (scheduling request) adhesion node configuration, which specifically comprises the following steps: the SR sticky node configuration method comprises at least one processor and a memory, wherein the at least one processor and the memory are connected through a data bus, the memory stores instructions capable of being executed by the at least one processor, and the instructions are used for completing the SR sticky node configuration method in the first aspect after being executed by the processor.
Compared with the prior art, the embodiment of the invention has the beneficial effects that: according to the invention, through reasonable selection and combination of the adhesive node devices, dispersed adhesive nodes are focused on some devices with strong device capability, so that the layout of the adhesive nodes is more reasonable, a network operator can reasonably layout the devices supporting the device label stack, and the deployment cost of the network operator is effectively reduced.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly described below. It is obvious that the drawings described below are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
Fig. 1 is a flowchart of a method for SR sticky node configuration according to an embodiment of the present invention;
fig. 2 is a flowchart of another method for SR sticky node configuration according to an embodiment of the present invention;
fig. 3 is a flowchart of another method for SR sticky node configuration according to an embodiment of the present invention;
fig. 4 is a schematic view of an actual usage scenario of another SR sticky node configuration according to an embodiment of the present invention;
fig. 5 is a flowchart of another method for SR sticky node configuration according to an embodiment of the present invention;
fig. 6 is a flowchart of another method for SR sticky node configuration according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of an apparatus for SR sticky node configuration according to an embodiment of the present invention.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The present invention is a system structure of a specific function system, so the functional logic relationship of each structural module is mainly explained in the specific embodiment, and the specific software and hardware implementation is not limited.
In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other. The invention will be described in detail below with reference to the figures and examples.
Example 1:
in the segment routing, Label stacks are needed to be used for storing labels, when the depth of a Label stack exceeds the Label depth supported by a forwarder, one Label stack cannot carry link labels of the whole Label Switched Path (Label Switched Path, abbreviated as LSP), the whole Path needs to be divided into a plurality of Label stacks for carrying, adjacent Label stacks are adhered together through a special Label, and the Label stacks are connected end to end, so that a complete LSP is identified. The special label is called an adhesive label, and the node where the adhesive label is located is called an adhesive node. The controller allocates an adhesion label for the adhesion node, pushes the adhesion label to the bottom of the stack of the LSP upstream label stack, and associates the adhesion label with an adjacent downstream label stack. Unlike a link label, an adhesive label cannot identify a link. And when the message is forwarded to the adhesive node according to the LSP upstream label stack, replacing the adhesive label with a new label stack according to the incidence relation between the adhesive label and the downstream label stack, and continuing to guide the forwarding of the message at the LSP downstream. The storage and analysis of the adhesion labels have certain requirements on the performance of equipment, adhesion nodes are set at will, and each piece of equipment is required to have the performance of configuring the adhesion nodes, so that the equipment cost is increased. In the embodiment of the present invention, the smallest unit that can be monitored and managed in network management is referred to as a network element, and includes a switch, a router, a transmission device, and the like. The method for configuring the adhesive nodes provided by the embodiment can select the equipment for configuring the adhesive nodes, focus the dispersed adhesive nodes on certain equipment with strong equipment capacity, make the layout of the adhesive nodes more reasonable, make the network operator reasonably layout the equipment supporting the equipment label stack, and effectively reduce the deployment cost of the network operator.
As shown in fig. 1, the method for SR sticky node configuration provided by the embodiment of the present invention includes the following specific steps:
step 101: and obtaining the label stack depth of each network element between the SR service source network element and the host network element, and dividing the network element range of each network element according to the label stack depth.
The label stack depth of each network element represents the maximum number of labels that the network element can accommodate, and also represents the maximum network element range that the sticky node of the network element can manage. When performing the configuration of the adhesion nodes, the range of the adhesion nodes to be configured for the network element needs to be determined according to the label stack depth of each network element, and the range of the adhesion nodes to be configured for each network element is the network element range of the network element. .
As shown in fig. 2, the network element range of each network element may be divided by the following steps.
Step 201: and acquiring the maximum number of labels which can be contained in the label stack of the current network element.
In actual use, each network element has a corresponding configuration file, the label stack depth of the network element is stored in the configuration file, and the label stack depth of the network element, that is, the maximum number of labels that can be contained in a label stack, can be directly obtained by reading the configuration file.
Step 202: and starting from the last network element of the current network element, and acquiring the network element with the same number as the maximum label forward to serve as the forward network element range of the current network element.
Step 203: and starting from the current next network element, backward acquiring the network element with the same number as the maximum label as the network element range of the current network element.
Step 204: and acquiring one of the forward network element range and the backward network element range which is positioned in the network element range of the calculation starting network element as the network element range of the current network element.
In order to enable the network element where the next adhesion node is located to be within the range which can be set by the adhesion node of the current network element, after the depth of the label stack of the network element is obtained, namely the maximum number of labels which can be contained by the label stack, the range which can be managed by the adhesion node in each network element can be divided according to the depth of the label stack to serve as the network element range of the network element. In addition to the source network element and the sink network element, a transmission path passing through each network element needs to be bidirectionally connected with the upstream network element and the downstream network element, so that the range of each network element needing to be configured with the bonded node needs to be searched forwards and backwards. If the range of the network element needing to be configured with the adhesion nodes exceeds the calculation range, the network element can normally forward without being configured with the adhesion nodes in the calculation range, and the adhesion nodes do not need to be configured, so that the range within the network element range of the initial calculation network element is selected as the network element range of the current network element during calculation. In specific implementation, in order to avoid setting the calculation range of the sticky node to exceed the service transmission range, the location of the sink node needs to be considered when dividing the network element range of each network element according to the depth of the label stack. Specifically, as shown in fig. 3, the adjustment can be performed by the following steps.
Step 301: and judging whether the number of the network elements between the current network element and the SR service sink node is greater than the label stack depth of the network elements. If yes, go to step 302; if not, go to step 303.
Step 302: the network element range includes the number of network elements corresponding to the label stack depth of the current network element.
Step 303: the network element range includes all network elements between the current network element and the SR service sink node.
After the network element range division of all network elements is completed through the steps, the distribution of the adhesion nodes can be planned according to the network element ranges of all the network elements.
Step 102: taking the SR service source network element as a calculation starting network element, taking the intersection of the network element ranges of all the network elements in the network element range of the calculation starting network element, and taking the network element farthest from the calculation starting network element in the intersection as an adhesion node.
In order to reduce the number of the sticky nodes as much as possible, the distance between two adjacent sticky nodes needs to be as far as possible, and meanwhile, the next adjacent sticky node needs to be located within the range of the network element of the previous sticky node. In actual implementation, it can be ensured that the adhesion nodes are located within the network element ranges of all the network elements by obtaining the intersection of the network element ranges of the network elements. Specifically, the network element ranges of the initial network element and the next network element of the initial network element are obtained, the network elements included in the two network element ranges are used as an intersection, the network element range of the next network element is sequentially obtained, and the intersection is taken again with the intersection calculated in the previous time until the next network element is the last network element in the network element range of the initial network element.
As shown in fig. 4, in a specific implementation scenario, each device may be regarded as a network element, the source node network element is located on the device 1, and the label stack depth of the device 1 is 7. According to step 101, the range of the network elements in which the network elements on the device 1 need to configure the sticky nodes is from the device 1 to the device 8, and whether the range in which the sticky nodes need to be configured is from the device 1 to the device 8 is calculated subsequently. According to step 102, the network element range of the network element on each device in the devices 1 to 8 is intersected, and the network element of the source node can be obtained. In fig. 4, an arc line represents a network element range of each device, a starting point of the arc line is a calculation starting network element, an end point of the arc line is a last network element in the network element range, a solid line represents that the network element range is within the current calculation range, and a dotted line represents that the network element range exceeds the current calculation range. If the network element range exceeds the calculation range, the forwarding can be normally carried out in the calculation range without configuring the adhesion nodes, so that the calculation is not needed when the intersection is calculated. As shown in fig. 4, the label stack depth of the device 1 is 7, and the network element range is device 1-device 8. According to step 102, the network element ranges of the devices 1 to 8 in the network element range of the device 1 are sequentially obtained, and the intersection is taken for the network element ranges. The label stack depth of the device 2 is 5, the network element range is from the device 2 to the device 7, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is from the device 2 to the device 7. The label stack depth of the device 3 is 5, the network element range is 3-8, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is 3-7. The label stack depth of the device 4 is 5, the network element range is 4-8, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is 3-7. The label stack depth of the device 5 is 5, and the upstream and downstream calculations exceed the calculation range of this time, so that no adhesive node needs to be configured in the range of this section, and the intersection of the network element ranges continued from the previous calculation is the device 3-the device 7. The label stack depth of the device 6 is 4, the network element range is 2-6, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is 3-6. The label stack depth of the device 7 is 5, the network element range is 2-7, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is 3-6. The label stack depth of the device 8 is 7, the network element range is from device 1 to device 8, the range shown by the arc in the figure is visible, and the intersection of the network element ranges is from device 3 to device 6. The device 8 is the last network element within the range of the network element of the device 1, and the calculation process is finished. Through the above calculation, the network element range intersection of all network elements within the network element range of the device 1 can be obtained: device 3-device 6, the network element that is farthest from device 1 as the starting computing network element in the intersection is device 6, and therefore an adhesion node is set on device 6.
Furthermore, because the label stack capacity of the adhesive node of each network element is limited, when the label stack capacity of the network element farthest from the calculation starting network element is full, the adhesive node is arranged on the network element farthest from the calculation starting network element. And when the label stack capacity of the next far network element is full, the analogy is carried out from far to near. For example, in the above example, the network element range of the sticky node is set to be device 3 to device 6, and when the label stack capacity of device 6 is full, the sticky node is set on the next-distant device 5 in the order from far to near. And analogizing in sequence, the adhesion node is arranged on the equipment 4 under the condition that the label stack of the equipment 5 is full, and the adhesion node is arranged on the equipment 3 under the condition that the label stack of the equipment 4 is full.
Step 103: and sequentially calculating the network element where the next adhesion node is located backwards by taking the previous adhesion node as a calculation starting network element.
In a general SR service, not only one sticky node may be needed, and therefore, the position of the next sticky node needs to be calculated backward. And (3) repeating the calculation step in the step 102 by using the previous adhesive node as a calculation starting network element, and calculating the next adhesive node back one by one so that the label stacks on all the adhesive nodes are connected end to form a complete LSP.
For example, in the example shown in fig. 4, a stuck node is set on the device 6, via step 102. After the setting is completed, the device 6 is used as a calculation starting network element, the network element range of the device 6 is obtained according to the label stack depth of the device 6, the intersection is calculated for the network element ranges of all the network elements in the network element range of the device 6, and the network element where the next adhesion node of the device 6 is located is calculated. And by analogy, calculating each bonding node behind the subsequent bonding node backwards.
Step 104: and finishing the configuration when the network element range of the initial network element contains the sink network element.
The transmission of the SR service starts from the source network element and ends to the sink network element. When the network element range of the starting network element includes the sink network element, the sink network element is located within the link range that can be identified by the label stack of the previous adhesive node, a complete LSP from the source node to the sink node can be formed using the label stacks on the adhesive nodes set in step 102 and step 103, a new adhesive node is no longer needed, and the configuration can be ended.
After the steps 101 to 104 provided in this embodiment, all network elements for configuring the adhesion nodes are found between the source node and the sink node of the SR service, an adhesion label is allocated to each adhesion node, and the adhesion label is pressed into the stack bottom of the label of the adhesion node on the upstream of the LSP, that is, the adjacent label stacks are associated via the adhesion label, a complete LSP is identified, and a packet of the SR service is guided to be forwarded in the LSP. Because the network element farthest from the upstream sticky node is selected as the downstream sticky node in steps 102 and 103, the sticky nodes configured according to the method provided by this embodiment have the farthest distance from each other on the basis of availability, and the number of devices configured with sticky nodes is the smallest under the same transmission distance. Therefore, the number of devices for configuring the sticky nodes can be reduced, and the device cost of a network operator can be reduced.
In actual use, each SR service needs one LSP for forwarding, and therefore, when each SR service is created, a calculation needs to be performed on the sticky node of the SR service. Further, for the same SR service of the same source node and sink node, the same sticky node configuration scheme may be used when the label stack of the sticky node is not full.
Further, when the network element device is used as an adhesion node, the device needs to have a larger label stack capability, the device with a strong label stack capability has a higher performance requirement, and the corresponding cost is also higher. In order to concentrate the sticky nodes on the existing network element equipment with higher performance as much as possible, and do not need to upgrade and replace the equipment for setting the sticky nodes, in step 102 and step 103, when selecting the sticky nodes, not only the distance but also the performance of the network element equipment need to be considered. In the existing related patents of SR services, the function of focusing the sticky nodes is missing, but the function is very important, so that the mutual connection of devices with strong and weak label stack capabilities can be realized, and the layout of an operator is more economical and reasonable.
In a specific implementation, steps 101-104 may be adjusted using the steps shown in fig. 6, and step 401 is added before step 102.
Step 401: and screening the performance of the network elements according to the network topology and the equipment type, and determining the network elements which can meet the performance requirements of the adhesive nodes as the network elements of the preferred adhesive nodes.
Through step 401, the network element serving as the preferred adhesion node is acquired, and the adhesion nodes are concentrated on the acquired network element, so that the performance requirement of the adhesion nodes can be met, and the network element with lower performance does not need to be specially upgraded and replaced in order to configure the adhesion nodes. In specific implementation, the network element serving as the preferred adhesive node may be selected according to parameters such as the label stack depth of the network element, the routing capability of the network element, the calculation performance of the network element, and the like as a basis for screening. In the actual service deployment of an operator, the distribution positions of the adhesive nodes can also be reasonably adjusted according to the fact that the network topology and the equipment capacity are jointly used as the basis for screening.
Accordingly, step 102 requires the addition of the following decision branch.
Step 402: and taking the SR service source network element as a calculation starting network element, and taking the intersection of the network element ranges of all the network elements in the network element range of the calculation starting network element.
Step 402 is the same as the previous part of step 102, and all network elements that can be configured as sticky nodes within the range of the network element of the calculation starting network element are obtained.
Step 403: and judging whether the intersection contains the preferred adhesion nodes. If not, go to step 404; if so, go to step 405.
Step 404: and taking the network element farthest from the initial calculation network element in the intersection as an adhesion node.
Step 405: and taking the preferred adhesive node as an adhesive node.
The performance of the preferred adhesion node is superior to that of other network elements, and the optimal adhesion node is most suitable for being used as the adhesion node. If the intersection includes the preferred adhesion node, the adhesion node may be concentrated on the network element where the preferred adhesion node is located. If the priority sticky node is not included in the intersection, in order to guarantee the connection relationship of the LSP, the processing is performed according to the general method in step 102. Similarly, in step 103, repeating steps 401-405 for each downstream stuck node to perform selective configuration of the stuck node. In the example shown in fig. 4, the intersection of the network element ranges is device 3-device 6, and if device 5 is a preferred sticky node, device 5 is set as a sticky node instead of device 6 that is farthest from the calculation start node.
Further, in order to centralize the sticky nodes, when a plurality of preferable sticky nodes exist in the intersection, according to a similar manner in the scheme of step 102, the preferable sticky node farthest from the calculation starting network element is used as the sticky node, so that the distance between adjacent sticky nodes is as far as possible, the sticky nodes in the whole SR service path are reduced as far as possible, the number of times of forwarding by using the sticky nodes and the number of devices needing to configure the sticky nodes are reduced, the transmission efficiency is improved, and the system cost is reduced. In the example shown in fig. 4, the intersection of the network element ranges is device 3-device 6, and if both device 3 and device 5 are preferred sticky nodes, the device 5 farthest from the calculation start node among all preferred sticky nodes is set as a sticky node.
Further, although the label stack capacity of the preferred sticky node is larger, there may be a case that the label stack is full, and therefore, according to a similar manner in the scheme of step 102, another network element needs to be selected to configure as a sticky node, and the preferred sticky node is preferentially selected, and after all label stacks of the preferred sticky node are full, another network element is selected. Specifically, when the label stack of the network element scheduled to be set as the sticky node is full, other preferred sticky nodes are preferentially used as the sticky nodes, and the preferred sticky node next far from the calculation starting network element is used as the sticky node. And when the label stacks of all the preferred sticky nodes are full, taking the network element farthest from the calculation starting network element as the sticky node. In the example shown in fig. 4, the intersection of the network element ranges is device 3-device 6, if device 3 and device 5 are preferred sticky nodes, device 5 is set as a sticky node, and when the label stack of device 5 is full, device 3 with the preferred sticky node is selected as the sticky node instead of device 4 with a longer distance. Further, when the label stack of the device 3 is full, the device 6 and the device 4 are sequentially selected as the sticky nodes according to the sequence from far to far.
In the method for configuring the SR adhesion nodes provided in this embodiment, the network element ranges of the multiple network elements are intersected, and then the network element with the farthest distance is selected as the adhesion node, and the dispersed adhesion nodes are focused on the specific network element device, so that the layout of the adhesion nodes is more reasonable, and the number of the adhesion devices is reduced. Furthermore, the adhesion nodes are arranged on the optimal adhesion nodes, and the adhesion nodes are further focused on certain devices with strong device capability, so that a network operator can reasonably arrange the devices supporting the device label stack, the existing hardware devices do not need to be upgraded or replaced due to scattered adhesion nodes, and the deployment cost of the network operator is effectively reduced.
Example 2:
on the basis of the method for SR sticky node configuration provided in embodiment 1, the present invention further provides an apparatus for SR sticky node configuration, which is capable of implementing the method, as shown in fig. 7, and is a schematic diagram of an apparatus architecture in an embodiment of the present invention. The SR sticky node configuration apparatus of the present embodiment includes one or more processors 21 and a memory 22. In fig. 7, one processor 21 is taken as an example.
The processor 21 and the memory 22 may be connected by a bus or other means, and fig. 7 illustrates the connection by a bus as an example.
The memory 22, which is a non-volatile computer-readable storage medium for the SR sticky node configuration method, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as the SR sticky node configuration method in embodiment 1. The processor 21 executes various functional applications and data processing of the apparatus for SR stuck node configuration by running the nonvolatile software program, instructions, and modules stored in the memory 22, that is, implements the method for SR stuck node configuration of embodiment 1.
The memory 22 may include high speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, the memory 22 may optionally include memory located remotely from the processor 21, and these remote memories may be connected to the processor 21 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
Program instructions/modules are stored in the memory 22 and, when executed by the one or more processors 21, perform the method of SR sticky node configuration in embodiment 1 described above, e.g., perform the various steps shown in fig. 1-3 and 6 described above.
Those of ordinary skill in the art will appreciate that all or part of the steps of the various methods of the embodiments may be implemented by associated hardware as instructed by a program, which may be stored on a computer-readable storage medium, which may include: a Read Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and the like.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (10)
1. A method for SR sticky node configuration is characterized in that:
acquiring the label stack depth of each network element between an SR service source network element and a host network element, and dividing the network element range of each network element according to the label stack depth;
taking an SR service source network element as a calculation starting network element, taking an intersection of network element ranges of all network elements in the network element range of the calculation starting network element, and taking a network element which is farthest away from the calculation starting network element in the intersection as an adhesion node;
calculating the network element of the next adhesion node backwards in sequence by taking the previous adhesion node as a calculation starting network element;
and finishing the configuration when the network element range of the initial network element contains the sink network element.
2. The method of SR sticky node configuration according to claim 1, further comprising:
determining a network element as an optimal sticky node according to the network topology and the equipment type;
and when the intersection comprises the preferred adhesion node, taking the preferred adhesion node as the adhesion node.
3. The method of SR sticky node configuration according to claim 2, further comprising:
and when a plurality of preferred sticky nodes exist in the intersection, taking the preferred sticky node farthest from the calculation starting network element as the sticky node.
4. The method of SR sticky node configuration according to claim 3, wherein said preferred sticky node farthest from a computing initiating network element is a sticky node, further comprising:
when the label stack of the sticky node is full, taking the preferred sticky node which is next far from the calculation starting network element as the sticky node;
and when the label stacks of all the preferred sticky nodes are full, taking the network element farthest from the calculation starting network element as the sticky node.
5. The method for SR sticky node configuration according to claim 2, wherein the determining a network element as a preferred sticky node according to a network topology and a device type specifically comprises:
and determining the network element as the preferred sticky node according to one or more items of the label stack depth, the routing capability and the calculation performance of the network element.
6. The method for SR sticky node configuration according to claim 1, wherein the dividing the network element range of each network element according to the label stack depth specifically comprises:
acquiring the maximum number of labels which can be contained in a label stack of a current network element;
starting from the last network element of the current network element, acquiring the network element with the same number as the maximum label forward to serve as the forward network element range of the current network element;
starting from the next network element of the current network element, backward acquiring the network element with the same number as the maximum label as the backward network element range of the current network element;
and acquiring one of the forward network element range and the backward network element range which is positioned in the network element range of the calculation starting network element as the network element range of the current network element.
7. The method of SR sticky node configuration according to claim 6, wherein said backward obtaining of network elements having the same number as the maximum number of labels further comprises:
judging whether the number of the network elements between the current network element and the SR service sink node is larger than the label stack depth of the network element;
if so, the network element range comprises the number of network elements corresponding to the label stack depth of the current network element;
if not, the network element range includes all network elements between the current network element and the SR service sink node.
8. The method according to claim 1, wherein the intersecting the network element ranges of all network elements within the network element range of the initial network element is calculated, specifically comprising:
acquiring network element ranges of an initial network element and a next network element of the initial network element, and taking the network elements simultaneously contained in the two network element ranges as an intersection;
and sequentially obtaining the network element range of the next network element, and taking the intersection with the intersection calculated in the previous time again until the last network element in the network element range in which the next network element is the initial network element.
9. The method of SR sticky node configuration according to claim 1, further comprising:
and when the SR service is created, calculating the sticky nodes of the SR service.
10. An apparatus for SR sticky node configuration, comprising:
comprising at least one processor and a memory, said at least one processor and memory being connected by a data bus, said memory storing instructions executable by said at least one processor, said instructions upon execution by said processor, performing the method of SR sticky node configuration of any of claims 1-9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110322166.5A CN113162852B (en) | 2021-03-25 | 2021-03-25 | Method and device for configuring SR (scheduling request) sticky nodes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110322166.5A CN113162852B (en) | 2021-03-25 | 2021-03-25 | Method and device for configuring SR (scheduling request) sticky nodes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113162852A CN113162852A (en) | 2021-07-23 |
| CN113162852B true CN113162852B (en) | 2022-03-25 |
Family
ID=76884946
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110322166.5A Active CN113162852B (en) | 2021-03-25 | 2021-03-25 | Method and device for configuring SR (scheduling request) sticky nodes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113162852B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116915685B (en) * | 2023-09-06 | 2023-12-12 | 新华三技术有限公司 | Message transmission method and device and electronic equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7158515B1 (en) * | 2000-07-06 | 2007-01-02 | Nortel Networks Limited | Method of optical network bandwidth representation for optical label switching networks |
| CN110290068A (en) * | 2018-03-19 | 2019-09-27 | 华为技术有限公司 | A kind of sending method, method of reseptance and the equipment of adhesion label |
| CN110677341A (en) * | 2019-09-09 | 2020-01-10 | 锐捷网络股份有限公司 | Data forwarding method and device, electronic equipment and storage medium |
| CN112100533A (en) * | 2020-06-30 | 2020-12-18 | 网络通信与安全紫金山实验室 | Label compression method based on region division |
| CN112118179A (en) * | 2020-08-10 | 2020-12-22 | 中盈优创资讯科技有限公司 | Method and device for creating end-to-end Segmented Routing (SR) path |
-
2021
- 2021-03-25 CN CN202110322166.5A patent/CN113162852B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7158515B1 (en) * | 2000-07-06 | 2007-01-02 | Nortel Networks Limited | Method of optical network bandwidth representation for optical label switching networks |
| CN110290068A (en) * | 2018-03-19 | 2019-09-27 | 华为技术有限公司 | A kind of sending method, method of reseptance and the equipment of adhesion label |
| CN110677341A (en) * | 2019-09-09 | 2020-01-10 | 锐捷网络股份有限公司 | Data forwarding method and device, electronic equipment and storage medium |
| CN112100533A (en) * | 2020-06-30 | 2020-12-18 | 网络通信与安全紫金山实验室 | Label compression method based on region division |
| CN112118179A (en) * | 2020-08-10 | 2020-12-22 | 中盈优创资讯科技有限公司 | Method and device for creating end-to-end Segmented Routing (SR) path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113162852A (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10432537B2 (en) | Service function chaining based on resource availability in the time dimension | |
| EP2453607B1 (en) | Method and device for calculating k-shortest paths | |
| CN100596102C (en) | Method for establishing label switched path of minimized path preemption cost | |
| US20180227244A1 (en) | Efficient message forwarding for distributed resource orchestration | |
| US7496039B2 (en) | Delay guarantee path setting system | |
| US20180262443A1 (en) | Just-enough-time provisioning of service function chain resources | |
| CN110730478B (en) | Slice association method, device, end-to-end slice organizer and storage medium | |
| CN112003787B (en) | Routing path determining method, device, control equipment and storage medium | |
| US20200162367A1 (en) | Data stream transmission | |
| US11121975B2 (en) | Framework for temporal label switched path tunnel services | |
| CN106209623A (en) | Determine method and the control equipment of forward-path | |
| CN102907051A (en) | Label switching path establishing method, data forwarding method and equipment | |
| EP3979574B1 (en) | Method and device for implementing rerouting | |
| CN105409169B (en) | A kind of building method, the apparatus and system of multipath forward rule | |
| CN113162852B (en) | Method and device for configuring SR (scheduling request) sticky nodes | |
| US11121940B2 (en) | Techniques to meet quality of service requirements for a fabric point to point connection | |
| CN101296178B (en) | Inter-domain flux engineering route computing method and route computing device | |
| CN102098596A (en) | Route establishing method and device in optical network | |
| CN110958168B (en) | Cross-domain bidirectional tunnel creation method, communication method and device, and storage medium | |
| KR20140036542A (en) | Apparatus for configuring overlay network and method thereof | |
| Ahmed et al. | A dynamic bulk provisioning framework for concurrent optimization in PCE-based WDM networks | |
| WO2022016969A1 (en) | Data processing method and device | |
| CN104579992A (en) | Method and device for controlling network flow path | |
| JP6233059B2 (en) | Network reconfiguration system and method | |
| CN117675682A (en) | Communication method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |