CN114124781A - SRv6 message forwarding method, system, electronic equipment and storage medium - Google Patents
SRv6 message forwarding method, system, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114124781A CN114124781A CN202111394560.6A CN202111394560A CN114124781A CN 114124781 A CN114124781 A CN 114124781A CN 202111394560 A CN202111394560 A CN 202111394560A CN 114124781 A CN114124781 A CN 114124781A
- Authority
- CN
- China
- Prior art keywords
- message
- path
- sid
- sub
- bandwidth utilization
- 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.)
- Granted
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure provides a forwarding method, a forwarding system, an electronic device and a computer-readable storage medium for SRv6, so as to solve the technical problem in the prior art that a link bandwidth utilization rate is low when the number of hops passed by a packet in a network is too large, where the method includes: receiving a message forwarding request; setting an expected bandwidth utilization rate during message transmission, and calculating the maximum hop count of the segment identifier SID of SRv6 allowed by the message to meet the expected bandwidth utilization rate; dividing the whole transmission path of the message into a plurality of sections of sub-paths according to the maximum hop count, and setting SID information of each section of sub-path node; and forwarding the message according to the set SID information of each segment of sub-path node. The technical scheme of the invention can solve the problem of excessive overhead of the message header during multi-hop transmission, and improve the bandwidth utilization rate in the transmission process.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method for forwarding an SRv6 message, a system for forwarding a SRv6 message, an electronic device, and a computer-readable storage medium.
Background
Segment Routing (SR) is a source Routing Technology, and based on an SDN (Software Defined Network) concept, a Network architecture facing path connection is formed, a multilevel programmable requirement of a future Network is supported, and a connection requirement in an application scenario of 5G (5th Generation Mobile Communication Technology) ultra-large connection and slicing can be met. SRv6(Segment Routing IPv6, Segment Routing based on IPv6 forwarding plane) is a Protocol designed based on the concept of source Routing to forward IPv6(Internet Protocol Version 6, Version 6) packets over a network. SRv 6by inserting a route extension Header, called SRH (Segment Routing Header), into the IPv6 message, pressing an explicit IPv6 address stack in SRH, SRv6 does not usually pop Segment during packet forwarding, but points to active Segment by using Segment Left field in SRH as pointer, similar to the top Label in SR MPLS (Segment Routing with MPLS (Multi-Protocol Label Switching), MPLS Segment Routing). And after passing through one SRv6 end node, the SL is reduced by 1, the destination address of the IPv6 header is updated to be the Segment corresponding to the current SL in the Segment list, and the data packet is forwarded out according to the conventional IPv6 route.
Currently, the SRv6 scheme is based on SRH, and the length of SID (Segment Identifier) is 128-bit SID, when the number of hops that a packet passes through in the network is too many, if there is 8-layer SID, then 128Byte overhead will be brought to the packet, for an application payload with an average length of 256Byte, the overhead brought by SRv6 exceeds 1/3, the bandwidth utilization rate is reduced to below 67%, and the link bandwidth utilization rate is low.
Disclosure of Invention
In order to at least solve the technical problem of low link bandwidth utilization rate when too many hops are passed by a message in the prior art, the present disclosure provides a forwarding method of a message in SRv6, a forwarding system of a message in SRv6, an electronic device, and a computer-readable storage medium, which can solve the problem of too large overhead of a message header during multi-hop transmission, and improve the bandwidth utilization rate during transmission.
In a first aspect, the present disclosure provides a method for forwarding a packet in SRv6, where the method includes:
receiving a message forwarding request;
setting an expected bandwidth utilization rate during message transmission, and calculating the maximum hop count of the segment identifier SID of SRv6 allowed by the message to meet the expected bandwidth utilization rate;
dividing the whole transmission path of the message into a plurality of sections of sub-paths according to the maximum hop count, and setting SID information of each section of sub-path node;
and forwarding the message according to the set SID information of each segment of sub-path node.
Further, the method further comprises:
calculating the transmission path of the message according to the current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
calculating the current bandwidth utilization rate of the message on the whole transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and determining whether to divide the original whole transmission path of the message or not according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
Further, the determining whether to segment the original whole transmission path of the packet according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate includes:
if the current bandwidth utilization rate is larger than or equal to the expected bandwidth utilization rate, the message header is encapsulated directly according to the SID information of each node of the current forwarding path in a unified way, and the message header is issued to the header node for message forwarding;
and if the current bandwidth utilization rate is less than the expected bandwidth utilization rate, performing the step of calculating the SID maximum hop count of SRv6 allowed by the message to meet the expected bandwidth utilization rate.
Further, the calculating the SID maximum hop count of SRv6 allowed by the packet to satisfy the expected bandwidth utilization includes:
calculating SRv6 allowed SID maximum cost of the message to meet the expected bandwidth utilization rate by the following formula (2);
Re＝P/(P+Ce+X) (2)
wherein, Re is the expected bandwidth utilization rate, P is the effective application payload, Ce is the SID maximum overhead of SRv6 allowed by the message, and X is the overhead of other message headers;
calculating the allowed SID maximum hop count of SRv6 of the message according to the following formula (3) in a manner of rounding down;
Ce＝He*128/8 (3)
wherein He is the maximum SID hop count of SRv6 allowed by the message.
Further, the forwarding the packet according to the set SID information of each segment of sub-path node includes:
sending the SID information of all nodes on each section of sub-path to the head node of each section of sub-path to form a respective SID list on each section of sub-path;
executing PUSH operation at the head node of the first segment of path according to the SID List on the first segment of sub-path, pressing SID information of the corresponding sub-path node in the head of the SID List of the message, setting the rest segment SL as H-1, and subtracting 1 from SL every time the message is transmitted to one node until the message is transmitted to the head node of the next segment of sub-path, wherein H is the total hop count of the forwarding path;
after the head node of the next segment of sub-path identifies that the IPv6 destination address is the node and SL is greater than 0, Push operation is executed, SID List information on the segment of sub-path is replaced into an original SID List as a new SID List, SL is reduced by 1, and the message is forwarded according to the new SID List information until the message is transmitted to the final destination node;
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the SRH and IPv6 headers to read the final message when the SL is 0.
In a second aspect, the present disclosure provides an SRv6 message forwarding system, including:
a receiving module configured to receive a message forwarding request;
a calculation module, configured to set an expected bandwidth utilization rate during message transmission, and calculate a maximum SID hop count of SRv6 segment identifiers allowed by the message to satisfy the expected bandwidth utilization rate;
a dividing module, configured to divide the entire transmission path of the packet into multiple segments of sub-paths according to the maximum hop count, and set SID information of each segment of sub-path node;
and the message forwarding module is configured to forward the message according to the SID information of each segment of path node set by the segmentation module.
Further, the calculation module comprises:
the first computing unit is configured to compute a transmission path of the message according to a current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
a second calculation unit configured to calculate a bandwidth utilization rate of the current entire transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and the determining unit is set to determine whether to divide the original whole transmission path of the message according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
Further, the packet forwarding module includes:
the sending unit is set to send the SID information of all the nodes on each section of sub-path to the head node of each section of sub-path so as to form a respective SID list on each section of sub-path;
a forwarding unit, configured to perform PUSH operation at a head node of a first segment of path according to a SID List on the first segment of sub-path, press SID information of a corresponding sub-path node in a SID List header of a packet, and set a remaining segment SL as H-1, where, every time the packet is transmitted to one node, SL is decremented by 1 until the packet is transmitted to a head node of a next segment of sub-path, where H is a total hop count of the forwarding path; and the number of the first and second groups,
the head node of the next sub-path recognizes that the IPv6 destination address is the local node and SL
If the number of the paths is more than 0, executing Push operation, replacing the SID List information on the sub-path of the segment into the original SID List as a new SID List, reducing the SL by 1, and forwarding the message according to the new SID List information until the message is transmitted to a final destination node; and the number of the first and second groups,
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the message in the SRH and IPv6 headers when the SL is 0, and reading the final message.
In a third aspect, the present disclosure provides an electronic device, including a memory and a processor, where the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the method for forwarding the packet in SRv6 according to any one of the first aspect.
In a fourth aspect, the present disclosure provides a computer-readable storage medium, having a computer program stored thereon, where the computer program, when executed by a processor, implements the method for forwarding SRv6 messages according to any one of the first aspect.
Has the advantages that:
the forwarding method of the message in SRv6, the forwarding system of the message in SRv6, the electronic device and the computer-readable storage medium provided by the present disclosure receive a message forwarding request; setting an expected bandwidth utilization rate during message transmission, and calculating the maximum hop count of the segment identifier SID of SRv6 allowed by the message to meet the expected bandwidth utilization rate; dividing the whole transmission path of the message into a plurality of sections of sub-paths according to the maximum hop count, and setting SID information of each section of sub-path node; and forwarding the message according to the set SID information of each segment of sub-path node. According to the technical scheme, SRv6 message headers are encapsulated in segments under a centralized control architecture, the existing network architecture or message structure is not required to be changed greatly, the advantages of SRv6 are fully exerted, meanwhile, the problem of overlarge message header overhead during multi-hop transmission is solved, and the bandwidth utilization rate in the transmission process is improved.
Drawings
Fig. 1 is a schematic flowchart of a forwarding method of a message SRv6 according to an embodiment of the present disclosure;
fig. 2 is a diagram of a centralized network architecture for forwarding a message in SRv6 according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram of SID information forwarded by a conventional SRv6 message according to a second embodiment of the present disclosure;
fig. 4 is a schematic diagram of SID information forwarded by a segmented SRv6 packet according to a second embodiment of the present disclosure;
fig. 5 is an architecture diagram of a forwarding system for SRv6 messages according to a third embodiment of the present disclosure;
fig. 6 is an architecture diagram of an electronic device according to a fourth embodiment of the disclosure.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those skilled in the art, the present disclosure is further described in detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments and figures described herein are merely illustrative of the invention and are not limiting of the invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order; also, the embodiments and features of the embodiments in the present disclosure may be arbitrarily combined with each other without conflict.
In which the terminology used in the embodiments of the disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in the disclosed embodiments and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for the convenience of explanation of the present disclosure, and have no specific meaning in themselves. Thus, "module", "component" or "unit" may be used mixedly.
At SRv6, the node may perform the following operations on the packet:
PUSH: one or more segments are pressed in the SID list header, and the first Segment is set as the active Segment;
CONTINUE: indicating that segment processing is not completed, and continuing to keep the active state;
NEXT: the active Segment has completed and the next Segment in the Segment list will become the active Segment.
The following describes the technical solutions of the present disclosure and how to solve the above problems in detail with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a schematic flowchart of a forwarding method of a message SRv6 according to an embodiment of the present disclosure, and as shown in fig. 1, the method includes:
step S101: receiving a message forwarding request;
step S102: setting an expected bandwidth utilization rate during message transmission, and calculating the maximum hop count of the segment identifier SID of SRv6 allowed by the message to meet the expected bandwidth utilization rate;
step S103: dividing the whole transmission path of the message into a plurality of sections of sub-paths according to the maximum hop count, and setting SID information of each section of sub-path node;
step S104: and forwarding the message according to the set SID information of each segment of sub-path node.
As shown in fig. 2, when a message forwarding request reaches a controller, the controller controls the message to be forwarded from one client to another client through multiple forwarding devices, the controller first calculates a forwarding path according to a current topology routing table, and the total hop count of the path is H; presetting to ensure that the current service is transmitted smoothly, wherein the lowest expected bandwidth utilization rate of each link on a forwarding path is Re, calculating SRv6 SID maximum hop count allowed by the message according to message information to meet the expected bandwidth utilization rate, when H is greater than the allowed maximum hop count, dividing the original whole transmission path of the message into a plurality of sub-paths according to the maximum hop count, if H is 14 hops and the maximum allowed hop count is 5, dividing the whole link into 5 sub-paths, and the last sub-path is 4 hops, setting SID information of each sub-path node, wherein each sub-path has corresponding sub-path SID information, and the SID information of each sub-path includes head node information of the next sub-path, and forwarding the message on each sub-path according to the corresponding SID information.
In this embodiment, the forwarding link is segmented and then segment-by-segment to perform SRv6 header encapsulation, so as to forward the packet, thereby improving the utilization rate of the link bandwidth on the premise of fully exerting the advantages of SRv 6.
Further, the method further comprises:
calculating the transmission path of the message according to the current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
calculating the current bandwidth utilization rate of the message on the whole transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and determining whether to divide the original whole transmission path of the message or not according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
The message comprises an effective application payload, other message headers and SRv6 SID, the bandwidth utilization rate of the current whole forwarding path is calculated through R ═ P/(P + C + X), byte is taken as a unit in the calculation process, the message overhead of each hop is 128/8(by byte is taken as a unit), and C ═ H ═ 128/8 (byte); after the bandwidth utilization rate of the whole transmission path is calculated, the bandwidth utilization rate is compared with the expected bandwidth utilization rate (or called as the lowest bandwidth utilization rate) of each link on the forwarding path, if the bandwidth utilization rate is satisfied, the path division is not needed, and if the bandwidth utilization rate is not satisfied, the path division is carried out.
Further, the determining whether to segment the original whole transmission path of the packet according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate includes:
if the current bandwidth utilization rate is larger than or equal to the expected bandwidth utilization rate, the message header is encapsulated directly according to the SID information of each node of the current forwarding path in a unified way, and the message header is issued to the header node for message forwarding;
and if the current bandwidth utilization rate is less than the expected bandwidth utilization rate, performing the step of calculating the SID maximum hop count of SRv6 allowed by the message to meet the expected bandwidth utilization rate.
When the calculated R is more than or equal to Re, the message header can be directly and uniformly packaged according to SID information of each node of the current forwarding path and issued to the header node;
when R is smaller than Re, it shows that the high-efficiency utilization of bandwidth can not be achieved by using the current whole link as a whole to package the message header, and then the message header is processed according to the segmentation.
Further, the calculating the SID maximum hop count of SRv6 allowed by the packet to satisfy the expected bandwidth utilization includes:
calculating SRv6 allowed SID maximum cost of the message to meet the expected bandwidth utilization rate by the following formula (2);
Re＝P/(P+Ce+X) (2)
wherein, Re is the expected bandwidth utilization rate, P is the effective application payload, Ce is the SID maximum overhead of SRv6 allowed by the message, and X is the overhead of other message headers;
calculating the allowed SID maximum hop count of SRv6 of the message according to the following formula (3) in a manner of rounding down;
Ce＝He*128/8 (3)
wherein He is the maximum SID hop count of SRv6 allowed by the message.
The allowed SRv6 SID maximum overhead Ce to meet the expected bandwidth utilization can be calculated by formula (2); the expected bandwidth utilization rate Re can be set autonomously according to actual conditions, such as 70%, 80%, 85%, and so on, after Re, P, and X are known, the allowed SRv6 SID maximum overhead Ce can be obtained, and the calculation process is performed in byte units, and the allowed SRv6 SID maximum hop count He can be obtained according to the SID length of 128/8 bytes per hop (1 byte consists of 8 bits). The maximum allowed hop count He, i.e., the maximum number of layers of the SRv6 SID, is calculated by rounding down.
In another embodiment of the present disclosure, He corresponding to the message may also be obtained first, and whether to perform path segmentation is determined according to a relationship between He and the total hop count H of the path, if He is greater than or equal to H, then no segmentation is needed, otherwise, path segmentation is needed.
Further, the forwarding the packet according to the set SID information of each segment of sub-path node includes:
sending the SID information of all nodes on each section of sub-path to the head node of each section of sub-path to form a respective SID list on each section of sub-path;
executing PUSH operation at the head node of the first segment of path according to the SID List on the first segment of sub-path, pressing SID information of the corresponding sub-path node in the head of the SID List of the message, setting the rest segment SL as H-1, and subtracting 1 from SL every time the message is transmitted to one node until the message is transmitted to the head node of the next segment of sub-path, wherein H is the total hop count of the forwarding path;
after the head node of the next segment of sub-path identifies that the IPv6 destination address is the node and SL is greater than 0, Push operation is executed, SID List information on the segment of sub-path is replaced into an original SID List as a new SID List, SL is reduced by 1, and the message is forwarded according to the new SID List information until the message is transmitted to the final destination node;
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the SRH and IPv6 headers to read the final message when the SL is 0.
Dividing the original whole transmission path into a plurality of sub-paths according to He through a controller, and issuing node SID information on each section of sub-path to a head node of each sub-path;
the head node of the whole path executes PUSH operation according to the SID List of the first section of sub-path sent by the controller, presses corresponding sub-path SID information in the head of the SID List, and sets SL to be H-1;
after receiving the message, the intermediate node of the sub-path compares the IPv6 destination address in the message header to search a local SID list, hits the local SID list, executes a Next operation, and subtracts 1 from SL;
when the message is transmitted to the head node of the next sub-path, the node can recognize that the destination address of the IPv6 is the node, but the SL is more than 0, the Push operation is executed, the SID List information on the sub-path of the segment received from the controller is replaced into the original SID List, the SL is reduced by 1, and the message is forwarded according to the new SID List information;
when the message reaches the final destination node, it is recognized that the destination address is the node, and at the same time, when SL is 0, the node will strip the SRH and IPv6 headers and read the real Payload.
In the embodiment of the disclosure, under a centralized control architecture, if the bandwidth utilization rate does not reach the standard, SRv6 message header encapsulation is performed in segments without making a great change on the existing network architecture or message structure, so that the advantages of SRv6 are fully exerted, the problem of excessive cost of the message header during multi-hop transmission is solved, and the bandwidth utilization rate in the transmission process is improved.
For more clearly describing the technical solution of the present disclosure, as shown in fig. 3 and fig. 4, a second embodiment of the present disclosure provides a method for forwarding a packet in SRv 6.
Fig. 3 shows a conventional packet forwarding process in SRv6, in a centralized control architecture, it is assumed that a forwarding path that needs to be passed through from H1 to H2 passes through 17 nodes SRv6, that is, F1, F2, and … … F17, and is composed of 16 hops in total, the expected minimum bandwidth utilization rate is 80%, a payload 512byte is effectively applied to a packet, and a header overhead 64byte of other packets, and if the overhead occupied by a SRv6 SID is 128/8 × 16 — 256byte according to a uniform encapsulation manner of the entire transmission path, the effective bandwidth utilization rate at this time is 512/(512+256+64) × 100% > -61.54%, which is much lower than the expected 80%. For this purpose, segmented SRv6 message forwarding is required, and the forwarding flow is shown in fig. 4:
calculating Ce-64 byte and He-64 8/128-4 by the formula 512/(512+ Ce +64) × 100-80%;
the controller divides the original 16 transmission paths into 4 segments, each segment has 4 hops, F1, F5, F9 and F13 are respectively head nodes of each sub-path, the head nodes receive SID information lists of sub-nodes on corresponding sub-paths, for example, F1 receives SIDs corresponding to F2 and F3 and F4 and F5, and F13 receives SIDs corresponding to F14, F15, F16 and F17;
when the message is transmitted, F1 encapsulates the SID information of the corresponding child node and SL 15 into the message for forwarding, F2, F3, and F4 execute a Next operation according to the SID list to forward the message, and subtract 1 from SL;
when the message is transmitted to F5, at this time, the destination address of IPv6 is consistent with F5, but SL is 10, the SID list is replaced with the SID of the next sub-path, that is, the SID information corresponding to F6, F7, F8, and F9, the forwarding operation is continued, and SL is decremented by 1;
when the packet is forwarded to F17, it is recognized that the destination address is the node, and at the same time, SL is 0, at this time, the node will strip the SRH and IPv6 headers and read the real Payload.
Fig. 5 is an architecture diagram of a forwarding system for SRv6 messages according to a third embodiment of the present disclosure, as shown in fig. 5, including:
a receiving module 11 configured to receive a message forwarding request;
a calculation module 12, configured to set an expected bandwidth utilization rate during message transmission, and calculate the maximum hop count of segment identifier SID of SRv6 allowed by the message to satisfy the expected bandwidth utilization rate;
a dividing module 13 configured to divide the entire transmission path of the packet into a plurality of segments of sub-paths according to the maximum hop count, and set SID information of each segment of sub-path node;
and the message forwarding module 14 is configured to forward the message according to the SID information of each segment path node set by the segmentation module.
Further, the calculation module 12 includes:
the first computing unit is configured to compute a transmission path of the message according to a current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
a second calculation unit configured to calculate a bandwidth utilization rate of the current entire transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and the determining unit is set to determine whether to divide the original whole transmission path of the message according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
Further, the segmentation module 13 is specifically further configured to:
if the current bandwidth utilization rate is larger than or equal to the expected bandwidth utilization rate, the distribution system is directly enabled to uniformly package message headers according to SID information of each node of the current forwarding path, and the message headers are issued to the header nodes for message forwarding;
and if the current bandwidth utilization rate is smaller than the expected bandwidth utilization rate, calculating the SID maximum hop count of SRv6 allowed by the message to meet the expected bandwidth utilization rate by the calculation module 12.
Further, the calculating module 12 is specifically configured to:
calculating SRv6 allowed SID maximum cost of the message to meet the expected bandwidth utilization rate by the following formula (2);
Re＝P/(P+Ce+X) (2)
wherein, Re is the expected bandwidth utilization rate, P is the effective application payload, Ce is the SID maximum overhead of SRv6 allowed by the message, and X is the overhead of other message headers;
calculating the allowed SID maximum hop count of SRv6 of the message according to the following formula (3) in a manner of rounding down;
Ce＝He*128/8 (3)
wherein He is the maximum SID hop count of SRv6 allowed by the message.
Further, the message forwarding module 14 includes:
the sending unit is set to send the SID information of all the nodes on each section of sub-path to the head node of each section of sub-path so as to form a respective SID list on each section of sub-path;
a forwarding unit, configured to perform PUSH operation at a head node of a first segment of path according to a SID List on the first segment of sub-path, press SID information of a corresponding sub-path node in a SID List header of a packet, and set a remaining segment SL as H-1, where, every time the packet is transmitted to one node, SL is decremented by 1 until the packet is transmitted to a head node of a next segment of sub-path, where H is a total hop count of the forwarding path; and the number of the first and second groups,
after the head node of the next segment of sub-path identifies that the IPv6 destination address is the node and SL is greater than 0, Push operation is executed, SID List information on the segment of sub-path is replaced into an original SID List as a new SID List, SL is reduced by 1, and the message is forwarded according to the new SID List information until the message is transmitted to the final destination node; and the number of the first and second groups,
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the message in the SRH and IPv6 headers when the SL is 0, and reading the final message.
The forwarding system of SRv6 message in this embodiment of the disclosure is used to implement the forwarding method of SRv6 message in the first embodiment of the method and the second embodiment of the method, so the description is simpler, and reference may be specifically made to the related description in the first embodiment of the method and the second embodiment of the method, and details are not described here again.
Furthermore, as shown in fig. 6, a fourth embodiment of the present disclosure further provides an electronic device, which includes a memory 10 and a processor 20, where the memory 10 stores a computer program, and when the processor 20 runs the computer program stored in the memory 10, the processor 20 executes the above-mentioned various possible methods.
The memory 10 is connected to the processor 20, the memory 10 may be a flash memory, a read-only memory or other memories, and the processor 20 may be a central processing unit or a single chip microcomputer.
Furthermore, the disclosed embodiments also provide a computer-readable storage medium, on which a computer program is stored, the computer program being executed by a processor to perform the above-mentioned various possible methods.
The computer-readable storage media include volatile or nonvolatile, removable or non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, computer program modules or other data. Computer-readable storage media include, but are not limited to, RAM (Random Access Memory), ROM (Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash Memory or other Memory technology, CD-ROM (Compact disk Read-Only Memory), Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer.
It is to be understood that the above embodiments are merely exemplary embodiments that are employed to illustrate the principles of the present disclosure, and that the present disclosure is not limited thereto. It will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope of the disclosure, and these are to be considered as the scope of the disclosure.
Claims (10)
1. A method for forwarding a message in SRv6, the method comprising:
receiving a message forwarding request;
setting an expected bandwidth utilization rate during message transmission, and calculating the maximum hop count of the segment identifier SID of SRv6 allowed by the message to meet the expected bandwidth utilization rate;
dividing the whole transmission path of the message into a plurality of sections of sub-paths according to the maximum hop count, and setting SID information of each section of sub-path node;
and forwarding the message according to the set SID information of each segment of sub-path node.
2. The method of claim 1, further comprising:
calculating the transmission path of the message according to the current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
calculating the current bandwidth utilization rate of the message on the whole transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and determining whether to divide the original whole transmission path of the message or not according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
3. The method of claim 2, wherein determining whether to segment the original entire transmission path of the packet according to the relationship between the current bandwidth utilization and the expected bandwidth utilization comprises:
if the current bandwidth utilization rate is larger than or equal to the expected bandwidth utilization rate, the message header is encapsulated directly according to the SID information of each node of the current forwarding path in a unified way, and the message header is issued to the header node for message forwarding;
and if the current bandwidth utilization rate is less than the expected bandwidth utilization rate, performing the step of calculating the SID maximum hop count of SRv6 allowed by the message to meet the expected bandwidth utilization rate.
4. The method of claim 1, wherein said calculating the SID maximum number of hops allowed for SRv6 in the message to satisfy the expected bandwidth utilization comprises:
calculating SRv6 allowed SID maximum cost of the message to meet the expected bandwidth utilization rate by the following formula (2);
Re＝P/(P+Ce+X) (2)
wherein, Re is the expected bandwidth utilization rate, P is the effective application payload, Ce is the SID maximum overhead of SRv6 allowed by the message, and X is the overhead of other message headers;
calculating the allowed SID maximum hop count of SRv6 of the message according to the following formula (3) in a manner of rounding down;
Ce＝He*128/8 (3)
wherein He is the maximum SID hop count of SRv6 allowed by the message.
5. The method according to claim 1 or 4, wherein the forwarding the packet according to the set SID information of each segment of sub-path node includes:
sending the SID information of all nodes on each section of sub-path to the head node of each section of sub-path to form a respective SID list on each section of sub-path;
executing PUSH operation at the head node of the first segment of path according to the SID List on the first segment of sub-path, pressing SID information of the corresponding sub-path node in the head of the SID List of the message, setting the rest segment SL as H-1, and subtracting 1 from SL every time the message is transmitted to one node until the message is transmitted to the head node of the next segment of sub-path, wherein H is the total hop count of the forwarding path;
after the head node of the next segment of sub-path identifies that the IPv6 destination address is the node and SL is greater than 0, Push operation is executed, SID List information on the segment of sub-path is replaced into an original SID List as a new SID List, SL is reduced by 1, and the message is forwarded according to the new SID List information until the message is transmitted to the final destination node;
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the SRH and IPv6 headers to read the final message when the SL is 0.
6. An SRv6 message forwarding system, comprising:
a receiving module configured to receive a message forwarding request;
a calculation module, configured to set an expected bandwidth utilization rate during message transmission, and calculate a maximum SID hop count of SRv6 segment identifiers allowed by the message to satisfy the expected bandwidth utilization rate;
a dividing module, configured to divide the entire transmission path of the packet into multiple segments of sub-paths according to the maximum hop count, and set SID information of each segment of sub-path node;
and the message forwarding module is configured to forward the message according to the SID information of each segment of path node set by the segmentation module.
7. The system of claim 6, wherein the computing module comprises:
the first computing unit is configured to compute a transmission path of the message according to a current topology routing table corresponding to the message forwarding request to obtain the whole transmission path of the message;
a second calculation unit configured to calculate a bandwidth utilization rate of the current entire transmission path by the following formula (1):
R＝P/(P+C+X) (1)
wherein, R is the current bandwidth utilization rate of the message transmission, P is the effective application payload, C is SRv6 SID integral overhead, and X is other message header overhead;
and the determining unit is set to determine whether to divide the original whole transmission path of the message according to the relationship between the current bandwidth utilization rate and the expected bandwidth utilization rate.
8. The system of claim 6, wherein the message forwarding module comprises:
the sending unit is set to send the SID information of all the nodes on each section of sub-path to the head node of each section of sub-path so as to form a respective SID list on each section of sub-path;
a forwarding unit, configured to perform PUSH operation at a head node of a first segment of path according to a SID List on the first segment of sub-path, press SID information of a corresponding sub-path node in a SID List header of a packet, and set a remaining segment SL as H-1, where, every time the packet is transmitted to one node, SL is decremented by 1 until the packet is transmitted to a head node of a next segment of sub-path, where H is a total hop count of the forwarding path; and the number of the first and second groups,
after the head node of the next segment of sub-path identifies that the IPv6 destination address is the node and SL is greater than 0, Push operation is executed, SID List information on the segment of sub-path is replaced into an original SID List as a new SID List, SL is reduced by 1, and the message is forwarded according to the new SID List information until the message is transmitted to the final destination node; and the number of the first and second groups,
and recognizing that the destination address of the IPv6 is the node at the final destination node, and stripping the message in the SRH and IPv6 headers when the SL is 0, and reading the final message.
9. An electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor runs the computer program stored in the memory, the processor executes the SRv6 message forwarding method according to any one of claims 1-5.
10. A computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the SRv6 message forwarding method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111394560.6A CN114124781B (en) | 2021-11-23 | 2021-11-23 | Method and system for forwarding message in SRv, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111394560.6A CN114124781B (en) | 2021-11-23 | 2021-11-23 | Method and system for forwarding message in SRv, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114124781A true CN114124781A (en) | 2022-03-01 |
| CN114124781B CN114124781B (en) | 2023-05-16 |
Family
ID=80440225
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111394560.6A Active CN114124781B (en) | 2021-11-23 | 2021-11-23 | Method and system for forwarding message in SRv, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114124781B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023179606A1 (en) * | 2022-03-24 | 2023-09-28 | 中国移动通信有限公司研究院 | Message encapsulation method and apparatus, message transmission method and apparatus, and network node and storage medium |
| WO2023193511A1 (en) * | 2022-04-06 | 2023-10-12 | 中兴通讯股份有限公司 | Message forwarding method, apparatus, storage medium and electronic apparatus |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015011648A1 (en) * | 2013-07-24 | 2015-01-29 | Telefonaktiebolaget L M Ericsson (Publ) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization |
| JP2017028547A (en) * | 2015-07-23 | 2017-02-02 | 日本電信電話株式会社 | Device, system and method for load distribution, and program |
| WO2017016254A1 (en) * | 2015-07-30 | 2017-02-02 | 中兴通讯股份有限公司 | Ipv6 message encapsulation processing method and apparatus |
| WO2018019131A1 (en) * | 2016-07-27 | 2018-02-01 | 中兴通讯股份有限公司 | Method and device for forwarding message |
| CN109194578A (en) * | 2018-10-29 | 2019-01-11 | 中国联合网络通信集团有限公司 | A kind of activating method and device of private line service |
| WO2021004213A1 (en) * | 2019-07-09 | 2021-01-14 | 中兴通讯股份有限公司 | Method and apparatus for determining path tag of fusion network, storage medium, and electronic device |
| CN112511428A (en) * | 2020-03-10 | 2021-03-16 | 中兴通讯股份有限公司 | Message encapsulation method, message forwarding method, notification method, electronic device, and storage medium |
| CN112804148A (en) * | 2021-03-24 | 2021-05-14 | 新华三信息安全技术有限公司 | Message forwarding method and device |
| WO2021155759A1 (en) * | 2020-02-07 | 2021-08-12 | 中国移动通信有限公司研究院 | Method and device for processing segment identifier |
| CN113382452A (en) * | 2020-03-09 | 2021-09-10 | 中国移动通信有限公司研究院 | Path establishing method, data transmission method, device, network node and storage medium |
-
2021
- 2021-11-23 CN CN202111394560.6A patent/CN114124781B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015011648A1 (en) * | 2013-07-24 | 2015-01-29 | Telefonaktiebolaget L M Ericsson (Publ) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization |
| JP2017028547A (en) * | 2015-07-23 | 2017-02-02 | 日本電信電話株式会社 | Device, system and method for load distribution, and program |
| WO2017016254A1 (en) * | 2015-07-30 | 2017-02-02 | 中兴通讯股份有限公司 | Ipv6 message encapsulation processing method and apparatus |
| WO2018019131A1 (en) * | 2016-07-27 | 2018-02-01 | 中兴通讯股份有限公司 | Method and device for forwarding message |
| CN109194578A (en) * | 2018-10-29 | 2019-01-11 | 中国联合网络通信集团有限公司 | A kind of activating method and device of private line service |
| WO2021004213A1 (en) * | 2019-07-09 | 2021-01-14 | 中兴通讯股份有限公司 | Method and apparatus for determining path tag of fusion network, storage medium, and electronic device |
| WO2021155759A1 (en) * | 2020-02-07 | 2021-08-12 | 中国移动通信有限公司研究院 | Method and device for processing segment identifier |
| CN113382452A (en) * | 2020-03-09 | 2021-09-10 | 中国移动通信有限公司研究院 | Path establishing method, data transmission method, device, network node and storage medium |
| WO2021180077A1 (en) * | 2020-03-09 | 2021-09-16 | 中国移动通信有限公司研究院 | Path establishment method, data transmission method and apparatus, network node, and storage medium |
| CN112511428A (en) * | 2020-03-10 | 2021-03-16 | 中兴通讯股份有限公司 | Message encapsulation method, message forwarding method, notification method, electronic device, and storage medium |
| WO2021179732A1 (en) * | 2020-03-10 | 2021-09-16 | 中兴通讯股份有限公司 | Message encapsulating method, message forwarding method, notification method, electronic device, and storage medium |
| CN112804148A (en) * | 2021-03-24 | 2021-05-14 | 新华三信息安全技术有限公司 | Message forwarding method and device |
Non-Patent Citations (4)
| Title |
|---|
| 唐永林等: "SRv6的分段标识符结构的改善", 《电信科学》 * |
| 李根等: "软件定义的内容中心网络的多域分段路由机制", 《计算机应用研究》 * |
| 王新红等: "一种最小化最大带宽利用率的TE路由算法", 《小型微型计算机系统》 * |
| 黄建洋等: "一种基于分段路由的多路径流传输机制", 《电子学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023179606A1 (en) * | 2022-03-24 | 2023-09-28 | 中国移动通信有限公司研究院 | Message encapsulation method and apparatus, message transmission method and apparatus, and network node and storage medium |
| WO2023193511A1 (en) * | 2022-04-06 | 2023-10-12 | 中兴通讯股份有限公司 | Message forwarding method, apparatus, storage medium and electronic apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114124781B (en) | 2023-05-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113382442B (en) | Message transmission method, device, network node and storage medium | |
| US11323366B2 (en) | Path determining method, apparatus, and system | |
| EP4080835A1 (en) | Packet processing method, apparatus and system | |
| CN110401599B (en) | Data packet processing method and device, storage medium and electronic device | |
| CN114124781B (en) | Method and system for forwarding message in SRv, electronic equipment and storage medium | |
| US10374935B2 (en) | Link discovery method, system, and device | |
| CN109842868B (en) | Frame aggregation and network setting frame sending method and equipment | |
| CN113497754B (en) | Forwarding path establishing method and device and computer readable storage medium | |
| WO2003058868A2 (en) | Dynamic route selection for label switched paths in communication networks | |
| CN113037527B (en) | Network slice creation method, message forwarding method and device thereof | |
| CN113839870A (en) | Path creation method, device and system | |
| EP4167506A1 (en) | In-situ flow detection method and related device | |
| US20220124023A1 (en) | Path Switching Method, Device, and System | |
| US20240048479A1 (en) | Packet Forwarding Method and Apparatus, Network Device, and Storage Medium | |
| CN111385156B (en) | sFlow flow sampling method, device and system | |
| CN111277426B (en) | IOAM information processing method and device | |
| CN113206793B (en) | Data stream forwarding method and device | |
| CN113839868B (en) | SRv6 policy information control method, system and controller | |
| CN115883452A (en) | Communication method and communication device | |
| Liu et al. | Distributed route computation and provisioning in shared mesh optical networks | |
| CN114629843A (en) | Message processing method and device | |
| CN111277504B (en) | Method and system for inserting flow label in MPLS multilayer label stack | |
| CN111464342B (en) | Distributed routing convergence method and system for network equipment management information | |
| WO2023206165A1 (en) | Multicast data message sending method and apparatus, and device and storage medium | |
| CN108768858B (en) | MBB path calculation method and system based on bandwidth |
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 |