CN115150311B - A message forwarding method, device and equipment - Google Patents
A message forwarding method, device and equipment Download PDFInfo
- Publication number
- CN115150311B CN115150311B CN202110347858.5A CN202110347858A CN115150311B CN 115150311 B CN115150311 B CN 115150311B CN 202110347858 A CN202110347858 A CN 202110347858A CN 115150311 B CN115150311 B CN 115150311B
- Authority
- CN
- China
- Prior art keywords
- sub
- link
- identifier
- forwarding
- node
- 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
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000004422 calculation algorithm Methods 0.000 claims description 51
- 238000004364 calculation method Methods 0.000 claims description 27
- 238000012545 processing Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 4
- 230000005540 biological transmission Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 13
- 238000013507 mapping Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 8
- 238000002955 isolation Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 239000003623 enhancer Substances 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000005641 tunneling Effects 0.000 description 3
- ABEXEQSGABRUHS-UHFFFAOYSA-N 16-methylheptadecyl 16-methylheptadecanoate Chemical compound CC(C)CCCCCCCCCCCCCCCOC(=O)CCCCCCCCCCCCCCC(C)C ABEXEQSGABRUHS-UHFFFAOYSA-N 0.000 description 2
- 241000764238 Isis Species 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 2
- 239000003086 colorant Substances 0.000 description 2
- 238000000354 decomposition reaction Methods 0.000 description 2
- 238000005417 image-selected in vivo spectroscopy Methods 0.000 description 2
- 238000012739 integrated shape imaging system Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000006798 recombination Effects 0.000 description 2
- 238000005215 recombination Methods 0.000 description 2
- 101100064323 Arabidopsis thaliana DTX47 gene Proteins 0.000 description 1
- 101000840469 Arabidopsis thaliana Isochorismate synthase 1, chloroplastic Proteins 0.000 description 1
- 101150026676 SID1 gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本发明提供一种报文转发方法、装置及设备，所述方法包括：将网络设备的物理链路划分为多个子链路；为所述子链路配置子链路标识以及节点邻接标识；根据所述子链路的子链路标识与节点邻接标识，生成转发表；根据所述转发表，进行报文转发。本发明的方案可实现子链路颗粒度的底层物理资源的独享，提升网络价值。
The present invention provides a message forwarding method, device and equipment, the method comprising: dividing a physical link of a network device into a plurality of sub-links; configuring a sub-link identifier and a node adjacency identifier for the sub-link; generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link; and forwarding the message according to the forwarding table. The scheme of the present invention can realize the exclusive use of the underlying physical resources at the sub-link granularity and improve the network value.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a device for forwarding a message.
Background
Existing slicing techniques include FlexAlgo techniques, SR-TE, SRv6 Policy tunneling techniques. Wherein FlexAlgo (FA for short, flexible algorithm) technology is based on IGP (interior gateway) single topology, each node and each L3 link correspond to one or more FA algorithm spaces, and are issued by IGP protocol to form IGP sub-algorithm space. The FlexAlgo technology can only ensure node selection and physical link selection, realize coarse granularity slicing at the physical port level, but the existing network cannot ensure that a plurality of links exist between all nodes, so that the end-to-end slice resource exclusive sharing cannot be ensured, and the scheme can only independently share a certain physical link, cannot realize that a plurality of sub-link resources are distributed to different slice users, so that great resource waste can be caused for scenes with physical isolation slice requirements.
The SR-TE, SRv6 Policy technology is a source routing tunneling technology, and may calculate, for a user, a path identifier list SEGMENTLIST < SID1, SID2,.. SIDn >, which satisfies a requirement, in a network based on SLA (service level agreement) requirements, such as time delay and bandwidth, of the user, where SID is a segment identifier, and instruct the user to forward a message in the network along a specified path.
The SR-TE and SRv Policy solve the path planning problem, guide the message to avoid the congestion section and forward along the designated path, but the resources, such as bandwidth, on each physical link on the forwarding path cannot be guaranteed, because the link resources are shared by all tunnels and cannot be associated with the sub-link physical resources of the bottom layer, only the logical isolation is realized, and the hard slice requirement of the exclusive sharing of the resources required by the user cannot be met.
Disclosure of Invention
The invention aims to provide a message forwarding method, a message forwarding device and message forwarding equipment. And slicing of physical resources based on sub-links and independent sharing of bottom physical resources of granularity of each sliced sub-link are realized, so that the network value is improved.
In order to solve the technical problems, the technical scheme of the invention is as follows:
a method for forwarding a message, applied to a network device, the method comprising:
dividing a physical link of the network device into a plurality of sub-links;
configuring a sub-link identifier and a node adjacency identifier for the sub-link;
Generating a forwarding table according to the sub-link identification and the node adjacency identification of the sub-link;
And forwarding the message according to the forwarding table.
Optionally, each of the plurality of sub-links is configured with physical resources.
Optionally, the sub-link identification comprises a slice identification of a network slice to which the sub-link belongs and an underlying physical resource identification of the sub-link.
Optionally, the node adjacency identifies an Algorithm field in a child extension format of the node adjacency identification.
Optionally, the network device carries a plurality of node adjacency identification sub-extension formats in the same adjacency extension format, and is used for advertising a plurality of sub-link node adjacency identifications.
Optionally, the color types in the affinity attribute contained in the sub-extension format of each adjacent extension format corresponding to the physical link of the network device at least comprise color types required to be contained in the calculation path constraint by the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.
Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:
And generating a forwarding table based on the calculation of the sub-link information of the interface according to the preset indication information and the sub-link identification and the node adjacency identification of the sub-link.
Optionally, generating the forwarding table based on calculation of the sub-link information of the interface according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link includes:
Network equipment serving as a forwarding node in the network determines a flexible algorithm FA slice identifier to which the network equipment belongs according to the prefix identifier SID;
Selecting a node adjacent identifier according to the FA slice identifier;
and determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, generating the forwarding table based on calculation of the sub-link information of the interface according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link includes:
The network equipment serving as a head node in the network determines the section identification of the FA of the flexible algorithm to which the network equipment belongs according to the prefix identification SID;
According to preset indication information advertised by each device on a forwarding path, calculating a path meeting constraint conditions of the target prefix by utilizing an FA algorithm corresponding to the prefix identification SID, and arranging the paths of all sub-links on the path;
selecting a node adjacent identifier of the current sub-link according to the FA slice identifier;
and determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, the scheduling of the path for each sub-link on the path includes:
the node identification SID of each node corresponding to the flexible algorithm FA slice on the path is arranged in the path, or
And carrying out path arrangement on the node adjacency identification of the sub-link on the path.
Optionally, forwarding the message according to the forwarding table includes:
and forwarding the message according to the physical resources corresponding to each sub-link in the forwarding table.
The embodiment of the invention also provides a message forwarding device, which comprises:
the processing module is used for dividing the physical link of the network equipment into a plurality of sub-links, configuring a sub-link identifier and a node adjacent identifier for the sub-link, and generating a forwarding table according to the sub-link identifier and the node adjacent identifier of the sub-link;
And the transmission module is used for forwarding the message according to the forwarding table.
The embodiment of the invention also provides a network device, which comprises:
The processor is used for dividing the physical link of the network equipment into a plurality of sub-links, configuring a sub-link identifier and a node adjacent identifier for the sub-link, and generating a forwarding table according to the sub-link identifier and the node adjacent identifier of the sub-link;
and the transceiver is used for forwarding the message according to the forwarding table.
The embodiment of the invention also provides a network device comprising a processor, a memory storing a computer program which, when run by the processor, performs the method as described above.
Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform a method as described above.
The scheme of the invention at least comprises the following beneficial effects:
The scheme of the invention divides the physical link of the network equipment into a plurality of sub-links, configures the sub-link identification and the node adjacent identification for the sub-links, generates a forwarding table according to the sub-link identification and the node adjacent identification of the sub-links, forwards the message according to the forwarding table, realizes the slicing of the physical resource based on the sub-links and the exclusive sharing of the bottom physical resource of the granularity of each sliced sub-link, and improves the network value.
Drawings
Fig. 1 is a flow chart of a message forwarding method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a node adjacency identification sub-extension format End.X SID sub-TLV structure according to an embodiment of the present invention;
fig. 3 is a FADF sub-sub-TLV structure schematic diagram;
Fig. 4 is a schematic structural diagram of preset indication information according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a physical network networking structure of a device in a network according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of End-of-device SID and end.X SID assignments for various End-of-device node identifiers in accordance with an embodiment of the present invention;
FIG. 7 is a schematic diagram of an FA128 slice topology in accordance with an embodiment of the present invention;
FIG. 8 is a schematic diagram of an FA129 slice topology according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of an FA130 slice topology in accordance with an embodiment of the present invention;
FIG. 10 is a diagram of an FA130 slice message SRv BE tunnel device forwarding representation intent of an embodiment of the present invention;
fig. 11 is a schematic diagram of a forwarding process of a FA130 slice packet SRv6 Policy tunnel according to an embodiment of the present invention;
fig. 12 is a schematic diagram of a forwarding process of a FA130 slice packet SRv6 Policy tunnel according to an embodiment of the present invention;
Fig. 13 is a block diagram of a message forwarding device according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention provides a method for forwarding a message, which is applied to a network device, and the method includes:
Step 11, dividing the physical link of the network device into a plurality of sub-links;
step 12, configuring a sub-link identifier and a node adjacent identifier for the sub-link;
Step 13, generating a forwarding table according to the sub-link identification and the node adjacency identification of the sub-link;
and step 14, forwarding the message according to the forwarding table.
This embodiment of the invention provides for the physical links of the network device to be separated from each other by dividing the physical links into a plurality of sub-links, each of the plurality of sub-links being configured with a single shared physical resource. The physical resource here may be at least one of a VLAN (virtual local area network) enhanced sub-interface, channelized channelized sub-interface, flexE/MTN (tunnel isolation) sub-interface. The embodiment of the invention is based on the slicing of the physical resources of the sub-links and the independent sharing of the bottom physical resources of the granularity of each sliced sub-link, improves the network value and provides the hard slicing service of the data carrying network with the resource guarantee of the sub-link level for users.
In the above embodiment of the present invention, the sub-link identifier includes a slice identifier of a network slice to which the sub-link belongs and an underlying physical resource identifier of the sub-link. The sub-link identification length may be 4 bytes, wherein the upper 8 bits represent the slice identifier FA-ID (flexible algorithm slice identification) of the slice to which the sub-link belongs, and the remaining lower 24 bits represent the sub-link resource ID, such as vlan ID/ChannelID/FlexEID/MTNID, etc.
The sub-link identification is exemplified as follows, for reduced expression, each digit in the following table represents an 8-bit decimal value:
The physical resource attributes corresponding to the sub-links can be flexibly defined on the device, and are exemplified herein only by bandwidth resources.
In the above embodiment of the present invention, the node adjacency identifier assigns an independent node adjacency identifier (end.x SID) to each sub-link, as shown in fig. 2, where the sub-extension format (end.x SID sub-TLV) of each node adjacency identifier corresponds to the algorism field and the FA Algorithm (Flexible Algorithm) used by the FA slice to which it belongs.
In the above embodiment of the present invention, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, and is configured to advertise multiple sub-link node adjacency identifiers.
For example, SRv nodes advertise multiple sub-link end.x SIDs by carrying multiple SRv end.x SID sub-TLVs (node adjacency identification sub-extension format) in the same adjacency TLV (extension format).
The equipment locally stores the mapping relation between each sub-link end.X SID and the corresponding sub-link identification.
The mapping relationship is exemplified as follows:
| End.X SID | Sub-Link Num of Sub-Link identification |
| End.x1/FA1 | 1001 |
| End.x2/FA2 | 2002 |
| End.x3/FA3 | 3003 |
It should be noted that, if multiple end.x SIDs may belong to the same FA slice, the traffic of the slice is allocated on the sub-link resources mapped by multiple end.x SIDs, which may be preferable to average the load allocation.
In the above embodiment of the present invention, in order to be compatible with the underlying resources of each type, a Sub-Link Num is introduced, and of course, the vlan id/ChannelID/FlexEID/MTNID may also be directly used to identify a specific Sub-Link.
In the above embodiment of the present invention, the color types in the affinity attribute included in the sub-extension format of each adjacent extension format corresponding to the physical link of the network device at least include color types that are required to be included in the calculation constraint by the flexible algorithm FA slice to which each sub-link included in the physical link belongs.
That is, the color contained in each sub-TLV (sub-extension format) of each adjacency TLV (extension management group) corresponding to each physical link on the node needs to at least contain the color that the FA slice to which each sub-link belongs needs to contain in the calculation constraint.
In an alternative embodiment of the present invention, step 13 may include:
step 131, generating a forwarding table based on the calculation of the sub-link information of the interface according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link.
The predicted indication information here may be a part of extending FADF (flexible algorithm definition flag bit) sub-TLV of FAD (flexible algorithm definition) sub-TLV of router capability TLV, adding a Q-flag (i.e. preset indication information Q), and indicating that the calculation is performed based on the sub-link information of the interface. The FADF sub-sub-TLV structure is shown in FIG. 3, and the extended flag structure is shown in FIG. 4.
In an alternative embodiment of the present invention, step 131 may include:
Step 1311, network equipment serving as a forwarding node in a network determines a flexible algorithm FA slice identifier to which the network equipment belongs according to a prefix identifier SID;
step 1312, selecting a node adjacency identifier according to the FA slice identifier;
Step 1313, determining an outgoing interface sub-link corresponding to the prefix identifier SID according to the node adjacency identifier, and generating a forwarding table.
In an alternative implementation manner, a SRv-BE manner is adopted, specifically, forwarding equipment in a network knows the FA-ID (flexible Algorithm slice identifier) to which the forwarding equipment belongs according to a prefix SID (prefix identifier), then knows that equipment support of a corresponding slice is based on a Sub-Link calculation path according to setting information of a Q-flag field in FADF Sub-Sub-TLV of the equipment, so that when the Sub-Link is calculated, the slice information of the Sub-Link end.x SID is considered (a local end.x SID supporting the corresponding Algorithm is selected according to the FA-ID of the prefix SID, and then an outgoing interface Sub-Link corresponding to each prefix SID is calculated according to which Sub-Link the end.x SID segment walks, so as to generate a local forwarding table for guiding traffic to enter a VLAN enhancer Sub-interface, a Channel Sub-interface and a FlexE/MTN interface corresponding to Sub-Link Num on the equipment outgoing interface, so as to ensure that the FA slice belonging to the prefix can share corresponding Sub-Link bottom physical resources.
Examples of forwarding tables are as follows:
| Prefix | Next hop (next hop) | OutIf (out interface) | Sub-Link Num |
| A0:3:1/FA1 | End.x1 | GE0/1/0 | 1001 |
| A1:3:1/FA2 | End.x2 | GE0/1/0 | 2002 |
| A2:3:1/FA3 | End.x3 | GE0/1/0 | 3003 |
It should be noted that, in order to be compatible with the underlying resources of each type, a Sub-Link Num is introduced, and physical resources, such as vlan id/ChannelID/FlexEID/MTNID, which can also be directly associated to a specific Sub-Link.
In an alternative embodiment of the present invention, step 131 may include:
step 1314, the network device serving as the head node determines the flexible algorithm FA slice identifier to which the head node network device belongs according to the prefix identifier SID;
step 1315, calculating a path meeting constraint conditions of the destination prefix by using an FA algorithm corresponding to the prefix identification SID according to preset indication information advertised by each device on the forwarding path, and arranging paths for each sub-link on the path;
step 1316, selecting a node adjacency identifier of the current sub-link according to the FA slice identifier;
step 1317, determining an outgoing interface sub-link corresponding to the prefix identifier SID according to the node adjacency identifier, and generating a forwarding table.
In step 1315, path arrangement is performed on each sub-link on the path, including:
And arranging the path of the node identification SID of each node corresponding to the flexible algorithm FA slice on the path, or arranging the path of the node adjacent identification of the sub-link on the path.
In an alternative implementation manner, a SRv-Policy mode is adopted to carry out path arrangement on node identification SIDs of FA slices of flexible algorithms corresponding to nodes on the path, namely a loose path, namely a head node PE device knows FA-IDs to which the nodes belong according to a prefix SID, meanwhile, knows that the device supports a sub-link-based calculation path according to setting information of Q-flag fields in FADF sub-sub-TLVs advertised by each device, so that the FA Algorithm corresponding to the prefix SIDs is used to calculate a path meeting constraint conditions to the prefix, nodeSID of corresponding FAs along the path is adopted to carry out path arrangement, when traffic is forwarded to a designated device in SEGMENTLIST (SID list) along the path, the device knows that the local is to be based on the sub-link calculation path according to setting information of Q-flag fields in FADF sub-sub-TLVs, then selects a local End. X supporting corresponding Algorithm according to the FA-IDs of the prefix SIDs, and then determines which sub-SIDs of the corresponding AlgoSIDs are mapped on the sub-links to the sub-SIDs, and the corresponding FAs of the sub-links are required to be searched according to the end. X segments, so that the physical interfaces of the sub-links are shared by the forwarding resources of the sub-links are ensured.
In an alternative implementation manner, a SRv-Policy mode is adopted to carry out path arrangement on node adjacent identifiers of sub-links on the path, and a strict path is adopted, namely, a head node PE device knows the FA-ID to which the head node PE device belongs according to a prefix SID, meanwhile, according to setting information of a Q-flag field in FADF sub-sub-TLV advertised by each device, the device is known to support a sub-link-based calculation path, so that the FA Algorithm corresponding to the prefix SID is used to calculate a path meeting constraint conditions to the destination prefix, an end.X SID of the corresponding sub-link carries out SRv Policy tunnel path arrangement (namely, algorithm of the end.X SID of each sub-link on the SRv Policy path is consistent with the FA-ID of the prefix SID), so as to guide traffic carried in the SR Policy tunnel to be forwarded on the determined sub-link, and ensure that FA slices to which the prefix SID belongs have shared sub-link bottom physical resources.
In an optional embodiment of the present invention, step 14 may include forwarding the message according to physical resources corresponding to each sub-link in the forwarding table.
The implementation process of the above embodiment is described below in conjunction with specific embodiments:
1) And (3) networking description:
the topology is shown in fig. 5, assuming that A, B, C, D, E, F, G, H devices are in the network, running the ISIS dynamic routing protocol and all being in the same ISIS (link state routing protocol) domain, all devices support FA functions and announce Q-flag of FADF sub-sub-TLV to the outside, if Q-flag is set to a first preset bit, it indicates a sub-link based calculation path, where the first preset bit may be 1 or 0, or may be a flag bit indicated in other manners.
2) As shown in fig. 6, a schematic diagram of the assignment of End SID and end.x SID for each device in the network is shown.
The link affinity attributes in the network are configured as follows:
| link (two-way) | Affinity attributes |
| A-B、A-F、B-C、F-G、G-H、H-E、C-G | 0X00000111 (Green, yellow, blue) |
| C-D,D-E | 0X00000101 (Green, blue) |
| B-F | 0X00000110 (Green, yellow) |
| D-H | 0X00000100 (Green) |
Based on the above basic configuration, the following 3 FA slice topologies can be formed, as shown in fig. 7, 8, and 9, wherein fig. 7 represents a green link topology, fig. 8 represents a yellow link topology, and fig. 9 represents a blue link topology.
And (3) pre-configuring equipment Sub-Link resources, namely configuring the mapping relation from the end.X SID to the Sub-Link identifier Sub-Link Num for the logic Sub-Link of each physical Link on the forwarding equipment. Taking the example of the device a, the mapping relationship is shown in the following table, and the other devices are similar.
Physical resources corresponding to Sub-Link identifiers Sub-Link Num are configured on forwarding equipment, VLAN resources are taken as an example, mapping relation on equipment A is shown in the following table, and other equipment are similar:
| Sub-Link Num | VLANID | Bandwidth | ...... |
| 1001 | 001 | 5G | ...... |
| 2002 | 002 | 5G | ...... |
| 3003 | 003 | 5G | ...... |
here, the physical resources corresponding to the logical sub-link resources may also be Channel channelized sub-interface resources, flex/MTN sub-interface resources, and the like, which are only exemplified by VLAN enhanced sub-interface resources. Other physical resources besides bandwidth may also be configured for the VLAN enhancement subinterface/Channel channelization subinterface/Flex/MTN subinterface, here exemplified only by bandwidth resources.
3) Message forwarding process
① SRv6 BE tunneling, the forwarding device in the network generates local forwarding tables for different Prefix-SIDs according to the previously described operating mechanism. Taking the example of the device a, the forwarding table is as follows:
| Prefix | Nexthop | OutIf | Sub-Link Num |
| E1:1::/FA128 | X1:1:: | GE0/1/0 | 1001 |
| E2:1::/FA129 | X2:1:: | GE0/1/0 | 2002 |
| E3:1::/FA130 | X3:1:: | GE0/1/0 | 3003 |
When a message with a destination of E3:1:100 arrives at the A device, the A device searches a forwarding table, knows that the output interface of the message is GE0/1/0, the corresponding Sub-Link identifier Sub-Link Num is 3003, then searches a corresponding Vlan003 subinterface according to the Sub-Link Num table, and forwards the E3:1:100 message through the Vlan003 subinterface, thereby ensuring the exclusive 10G physical bandwidth resource.
And the forwarding process of other devices is the same until the device reaches the destination, and the physical resource guarantee corresponding to the FA130 slice can be obtained on each link. As shown in FIG. 10, the forwarding of the FA130 slice message SRv BE tunnel devices represents an intent.
② SRv6-Policy tunnel
According to the operation mechanism, the head node PE device can calculate paths meeting the slicing constraint conditions for different Prefix-SIDs, and adopts the Adj-SIDs of corresponding sub-links to arrange SRv Policy tunnel paths.
With a Prefix SID: E1:1:1:Fa 128, E2:1:1:Fa 129 and E3:1:Fa 130 and SRv are examples of strict paths of Policy, and the paths of SRv Policy generated by the head node A equipment for the device are respectively:
E1:1::/FA128,Segmentlist:<X1:1::100,X1:2:1::100,X1:3::100,X1:4::100>
E2:1::/FA129,Segmentlist:<X2:1::100,X2:2::100,X2:10::100,X2:7::100,X2:8::100>
E3:1::/FA130,Segmentlist:<X3:1::100,X3:2::100,X3:3::100,X3:4::100>
After the message is forwarded to each device along the path specified by SRv Policy, each device finds out the corresponding output interface and the corresponding Sub-Link identifier Sub-Link Num according to the next hop end.X SID, and then finds out the corresponding VLAN enhancer interface according to the Sub-Link Num table lookup, and forwards the message through the VLAN enhancer interface, thereby ensuring the exclusive physical bandwidth resource.
The message forwarding process for the SRv Policy tunnel (tunnel Endpoint is E3:1: 100) with VPN traffic iterated to slice FA130 is shown in fig. 11 and 12.
The message arrives at the ingress node A device, the A device iterates the message to be carried by the SRv Policy tunnel of the slice FA130 according to the VPN routing Policy (tunnel Endpoint is E3:1:100), an IPv6 header of the SRv Policy tunnel is added outside the original message, the segmentlist of the SRH is < X3:1:100, X3:2:100, X3:3:100, X3:4:100, E3:1:B 100> (E3:1:B 100 is the flow corresponds to VPN SID), and the current SL pointer points to X3:1:100.
The equipment A checks a local mapping table according to the ratio of 100:1 of DA field, knows that the output interface of the message is GE0/1/0, the corresponding Sub-Link identifier Sub-Link Num is 3003, checks a table according to the Sub-Link Num, knows the corresponding Vlan003 Sub-interface, copies the ratio of 100:100 of DA field into an outer IPv6 header DA field, forwards the SL-1, and then forwards the message through the Vlan003 Sub-interface of GE0/1/0 to the equipment B.
The equipment B checks a local mapping table according to the ratio of X3:2:100 of the DA field, knows that the output interface of the message is GE0/1/0, the corresponding Sub-Link identifier Sub-Link Num is 3003, checks a table according to the Sub-Link Num, knows the corresponding Vlan003 Sub-interface, copies the ratio of X3:100 of the DA field of the IPv6 header on the outer layer, forwards the SL-1, and then forwards the message through the Vlan003 Sub-interface of GE0/1/0 to the equipment C.
The subsequent devices execute the same local mapping table according to the DA field in the node, and the local mapping table is associated to the corresponding VLAN enhancer interface to forward the message until the tunnel tail node E device is reached, and the message can obtain the physical resource guarantee of the VLAN enhancer interface corresponding to the FA130 slice on each link of the forwarding path.
According to the embodiment of the invention, by expanding FADF sub-sub-TLVs, a Q-flag is added to indicate sub-link information based on interfaces to calculate paths, and the configuration rule of the colors of the affinity attributes of each physical link at least comprises the colors required to be contained in the path constraint by the FA slices to which each sub-link belongs. The allocation rule of the sub-link identifier, the planning principle and the configuration strategy of each slice identifier and the corresponding resource, the allocation of independent end.X SIDs for each sub-link resource and the external notification, the maintenance of the mapping relation between the end.X SIDs and the sub-link identifiers, the maintenance of the mapping relation between each sub-link end.X SIDs containing the belonging FA algorithm information and the external notification, the identification FADF of the newly added identification on the forwarding equipment, the association relation between the sub-link end.X SIDs and the sub-link identifier, the whole processing mechanism and the whole flow to the sub-link bottom layer resource can realize the independent sharing of each slice resource on the same physical link, and the problems that FlexAlgo each slice can only independently share one physical link, has thick isolation granularity and can not be deployed on a large scale to realize the hard isolation of the slice can be solved. The embodiment of the invention can well provide the underlying physical resource guarantee for the slice, realize the hard slice and solve the problems of soft isolation and complete sharing of physical resources only through the tunnel.
As shown in fig. 13, an embodiment of the present invention further provides a packet forwarding device 130, where the device 130 includes:
The processing module 131 is configured to divide the physical link of the network device into a plurality of sub-links, configure a sub-link identifier and a node adjacency identifier for the sub-link, and generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;
and the transmission module 132 is configured to forward the message according to the forwarding table.
Optionally, each of the plurality of sub-links is configured with physical resources.
Optionally, the sub-link identification comprises a slice identification of a network slice to which the sub-link belongs and an underlying physical resource identification of the sub-link.
Optionally, the node adjacency identifies an Algorithm field in a child extension format of the node adjacency identification.
Optionally, the network device carries a plurality of node adjacency identification sub-extension formats in the same adjacency extension format, and is used for advertising a plurality of sub-link node adjacency identifications.
Optionally, the color types in the affinity attribute contained in the sub-extension format of each adjacent extension format corresponding to the physical link of the network device at least comprise color types required to be contained in the calculation path constraint by the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.
Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:
And generating a forwarding table based on the calculation of the sub-link information of the interface according to the preset indication information and the sub-link identification and the node adjacency identification of the sub-link.
Optionally, generating the forwarding table based on calculation of the sub-link information of the interface according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link includes:
Network equipment serving as a forwarding node in the network determines a flexible algorithm FA slice identifier to which the network equipment belongs according to the prefix identifier SID;
Selecting a node adjacent identifier according to the FA slice identifier;
And determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating calculation of interface-based sub-link information, generating a forwarding table, including:
The network equipment serving as a head node in the network determines the section identification of the FA of the flexible algorithm to which the network equipment belongs according to the prefix identification SID;
According to preset indication information advertised by each device on a forwarding path, calculating a path meeting constraint conditions of the target prefix by utilizing an FA algorithm corresponding to the prefix identification SID, and arranging the paths of all sub-links on the path;
selecting a node adjacent identifier of the current sub-link according to the FA slice identifier;
And determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, the scheduling of the path for each sub-link on the path includes:
And arranging the path of the node identification SID of each node corresponding to the flexible algorithm FA slice on the path, or arranging the path of the node adjacent identification of the sub-link on the path.
Optionally, forwarding the message according to the forwarding table includes:
and forwarding the message according to the physical resources corresponding to each sub-link in the forwarding table.
It should be noted that, the device is a device corresponding to the above method, and all implementation manners in the above method embodiments are applicable to the embodiment of the device, so that the same technical effects can be achieved.
The embodiment of the invention also provides a network device, which comprises:
The processor is used for dividing the physical link of the network equipment into a plurality of sub-links, configuring a sub-link identifier and a node adjacent identifier for the sub-link, and generating a forwarding table according to the sub-link identifier and the node adjacent identifier of the sub-link;
and the transceiver is used for forwarding the message according to the forwarding table.
Optionally, each of the plurality of sub-links is configured with physical resources.
Optionally, the sub-link identification comprises a slice identification of a network slice to which the sub-link belongs and an underlying physical resource identification of the sub-link.
Optionally, the node adjacency identifies an Algorithm field in a child extension format of the node adjacency identification.
Optionally, the network device carries a plurality of node adjacency identification sub-extension formats in the same adjacency extension format, and is used for advertising a plurality of sub-link node adjacency identifications.
Optionally, the color types in the affinity attribute contained in the sub-extension format of each adjacent extension format corresponding to the physical link of the network device at least comprise color types required to be contained in the calculation path constraint by the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.
Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:
And generating a forwarding table based on the calculation of the sub-link information of the interface according to the preset indication information and the sub-link identification and the node adjacency identification of the sub-link.
Optionally, according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating calculation of interface-based sub-link information, generating a forwarding table, including:
Network equipment serving as a forwarding node in the network determines a flexible algorithm FA slice identifier to which the network equipment belongs according to the prefix identifier SID;
Selecting a node adjacent identifier according to the FA slice identifier;
And determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating calculation of interface-based sub-link information, generating a forwarding table, including:
The network equipment serving as a head node in the network determines the section identification of the FA of the flexible algorithm to which the network equipment belongs according to the prefix identification SID;
According to preset indication information advertised by each device on a forwarding path, calculating a path meeting constraint conditions of the target prefix by utilizing an FA algorithm corresponding to the prefix identification SID, and arranging the paths of all sub-links on the path;
selecting a node adjacent identifier of the current sub-link according to the FA slice identifier;
And determining an outgoing interface sub-link corresponding to the prefix identification SID according to the node adjacent identification, and generating a forwarding table.
Optionally, the scheduling of the path for each sub-link on the path includes:
And arranging the path of the node identification SID of each node corresponding to the flexible algorithm FA slice on the path, or arranging the path of the node adjacent identification of the sub-link on the path.
Optionally, forwarding the message according to the forwarding table includes:
and forwarding the message according to the physical resources corresponding to each sub-link in the forwarding table.
It should be noted that, the network device is a network device corresponding to the above method, and all implementation manners in the above method embodiments are applicable to the embodiment of the network device, so that the same technical effects can be achieved.
The embodiment of the invention also provides a network device comprising a processor, a memory storing a computer program which, when run by the processor, performs the method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform a method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. The storage medium includes various media capable of storing program codes such as a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk.
Furthermore, it should be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. Also, the steps of performing the series of processes described above may naturally be performed in chronological order in the order of description, but are not necessarily performed in chronological order, and some steps may be performed in parallel or independently of each other. It will be appreciated by those of ordinary skill in the art that all or any of the steps or components of the methods and apparatus of the present invention may be implemented in hardware, firmware, software, or a combination thereof in any computing device (including processors, storage media, etc.) or network of computing devices, as would be apparent to one of ordinary skill in the art after reading this description of the invention.
The object of the invention can thus also be achieved by running a program or a set of programs on any computing device. The computing device may be a well-known general purpose device. The object of the invention can thus also be achieved by merely providing a program product containing program code for implementing said method or apparatus. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is apparent that the storage medium may be any known storage medium or any storage medium developed in the future. It should also be noted that in the apparatus and method of the present invention, it is apparent that the components or steps may be disassembled and/or assembled. Such decomposition and/or recombination should be considered as equivalent aspects of the present invention. The steps of executing the series of processes may naturally be executed in chronological order in the order described, but are not necessarily executed in chronological order. Some steps may be performed in parallel or independently of each other.
While the foregoing is directed to the preferred embodiments of the present invention, it will be appreciated by those skilled in the art that various modifications and adaptations can be made without departing from the principles of the present invention, and such modifications and adaptations are intended to be comprehended within the scope of the present invention.
Claims (15)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110347858.5A CN115150311B (en) | 2021-03-31 | 2021-03-31 | A message forwarding method, device and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110347858.5A CN115150311B (en) | 2021-03-31 | 2021-03-31 | A message forwarding method, device and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115150311A CN115150311A (en) | 2022-10-04 |
| CN115150311B true CN115150311B (en) | 2025-04-04 |
Family
ID=83403517
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110347858.5A Active CN115150311B (en) | 2021-03-31 | 2021-03-31 | A message forwarding method, device and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115150311B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109218201A (en) * | 2017-06-30 | 2019-01-15 | 华为技术有限公司 | A method, controller and network device for generating a forwarding entry |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9635148B2 (en) * | 2014-10-31 | 2017-04-25 | Aruba Networks, Inc. | Partitioning data sets for transmission on multiple physical links |
| CN116436850A (en) * | 2019-07-01 | 2023-07-14 | 华为技术有限公司 | A message forwarding method, message processing method and device |
-
2021
- 2021-03-31 CN CN202110347858.5A patent/CN115150311B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109218201A (en) * | 2017-06-30 | 2019-01-15 | 华为技术有限公司 | A method, controller and network device for generating a forwarding entry |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115150311A (en) | 2022-10-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10757008B2 (en) | Flow specification protocol-based communications method, device, and system | |
| CN111541613B (en) | A SRv6-based data processing method and related equipment | |
| CN101888334B (en) | Scalable routing policy construction using dynamic redefinition of routing preference value | |
| CN112491707B (en) | Method and device for determining forwarding path | |
| CN115277548B (en) | A transmission method, device and storage medium | |
| CN107968750B (en) | Message transmission method, device and node | |
| US20130077625A1 (en) | Extension of the interpretation and definition of the is-is tlv/sub-tlv | |
| CN110912795A (en) | A transmission control method, node, network system and storage medium | |
| CN114095305A (en) | Method, device and system for forwarding BIER message | |
| CN112995030A (en) | Business processing method and device, storage medium and electronic device | |
| US20220200820A1 (en) | Packet Sending Method and Apparatus | |
| CN107770073A (en) | A method, device and system for information synchronization | |
| EP3716529B1 (en) | Tunneling inter-domain stateless internet protocol multicast packets | |
| CN114205282B (en) | SRv6 Policy scheduling method, system, router and controller | |
| CN111355661B (en) | A VPN processing method and PE device and system | |
| CN115865769A (en) | Message processing method, network equipment and system | |
| CN114465920A (en) | Method, device and system for determining corresponding relation | |
| WO2021129023A1 (en) | Message sending method, device and system | |
| CN105391633B (en) | The route issuing method of transponder, controller and controller | |
| WO2021244108A1 (en) | Bier multicast traffic statistics method, device and system | |
| JP7574413B2 (en) | COMMUNICATION METHOD AND RELATED APPARATUS | |
| CN115150311B (en) | A message forwarding method, device and equipment | |
| CN115250262A (en) | Message sending method and device, message receiving method and device, and storage medium | |
| EP4425837A1 (en) | Method for receiving bgp-intent routing, and method for advertising bgp-intent routing | |
| CN115314440A (en) | Traffic scheduling method, system and storage medium |
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 |