CN106411738A - Processing method and apparatus of packaging of IPV6 message - Google Patents
Processing method and apparatus of packaging of IPV6 message Download PDFInfo
- Publication number
- CN106411738A CN106411738A CN201510460405.8A CN201510460405A CN106411738A CN 106411738 A CN106411738 A CN 106411738A CN 201510460405 A CN201510460405 A CN 201510460405A CN 106411738 A CN106411738 A CN 106411738A
- Authority
- CN
- China
- Prior art keywords
- list
- message
- ipv6
- node
- route
- 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.)
- Pending
Links
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/74—Address processing for routing
- H04L45/741—Routing in networks with a plurality of addressing schemes, e.g. with both IPv4 and IPv6
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a processing method and apparatus of packaging of an IPV6 message. The method comprises steps: a forwarding node obtains a corresponding relation between an SR segment routing list and a list identifier LIST ID; and the forwarding node forwards the received IPV6 message according to the corresponding relation between the segment routing list and the LIST ID.
Description
Technical field
The present invention relates to the communications field, more particularly, to a kind for the treatment of method and apparatus of IPV6 message encapsulation.
Background technology
Section route SR (Segment Routing) be a kind of method of the route based on source address, by
The nodal information that outside data message, the existing shortest path of one layer of impact of superposition forwards, carries outside data message
Portion, message carries out shortest path forwarding according to these specified path nodal informations.
As shown in figure 1, when the message comprising section route heading is transmitted in SR network domains,
Section route the specified SR node path information carry in head, and the network equipment (router) is according to section
Section operation instruction in route heading is operated accordingly, and this operation instruction includes Push, Next,
Continue.When operation instruction operates for PUSH, section is route heading (Segment by the network equipment
Routing Header, SR Header) it is pressed in IP message, or increase in section route heading
Other section instructions；Next and continue operation is shown by the pointer of Ptr, current when judging
Section operation finished, pointer moves on to next section, and the section of pointer indication is shown to be for forwarding next
The active segment jumping；Continue operates and is not over for this section of operation, and pointer remains in works as
In front section.By SR specified path forwarding capability, the load that can easily realize very much network is equal
Weighing apparatus and flow process engineering, and the quickly complex network function such as heavy-route.
As shown in Fig. 2 section route technology make use of the route head of existing IPV6 to be packaged extending,
SR Header is carried in existing IPV6 heading.In addition, the heading of IPV6 of the prior art
Carry next extension header (Next Header, NH) type, routing type extends for one of which
Head, its prolate-headed form is referring to Fig. 3.In the encapsulation process of SR extension in the prior art, due to
It is made up of expandable length field in IPV6SR extension header, when section is specified in the display carrying in LIST list
Point or number of links number are more, and the length of heading is longer.
For example, illustrate taking network shown in Fig. 4 as a example：
When all nodes in an almost overlay network of showing paths occur in network, a SR
LIST shows and is appointed as：R1-R2-R4-R3-R5-R6-R8-R7-R9-R10, then the IPV6 message of SR
Head at least needs the head length of 128bits*9+64bits to be packaged in R1 node.
As seen from the above, this extension form brings very big burden can to the heading of IPV6.
Content of the invention
The present invention provides a kind for the treatment of method and apparatus of IPV6 message encapsulation, technical problem to be solved
It is the heading problem that over-burden of IPV6 in prior art.
For solving above-mentioned technical problem, the invention provides following technical scheme：
A kind of processing method of IPV6 message encapsulation, including：
Forward node obtains the corresponding relation of SR section route list and List Identification LIST ID；
Described forward node according to the corresponding relation of described section of route list and LIST ID, to receive
IPV6 message is forwarded.
Wherein, when described forward node is SR Ingress node, described LIST ID is by described forwarding
Node carries in the amplifying message head of IPV6 message.
Wherein, described LIST ID is the bit set by Flag field in the heading of IPV6 message
The particular preset value information of information or routing type is identifying.
Wherein, described forward node obtain section route list and List Identification LIST ID corresponding relation it
Afterwards, methods described also includes：
Generate the forwarding entry of LIST ID.
Wherein, the forwarding entry of described generation LIST ID, including：
Search the outgoing interface information of next forward node in LIST list for the described forward node；
The outgoing interface finding information is saved as the outgoing interface information of the forwarding entry of LIST ID.
Wherein, the described corresponding relation according to described section of route list and LIST ID, to the IPV6 receiving
Message is forwarded, including：
When receiving the address that destination address is described forward node, if the report of described IPV6 message
In civilian head, next prolate-headed type is route-type, and the jumping figure of remaining LIST list is not zero,
Then the next hop information in LIST list is obtained according to LIST ID value, and the IPV6 address by next-hop
As destination address, continue to forward described IPV6 message.
Wherein, when described LIST ID includes all approach nodal informations in path, by by LIST
ID is placed in the destination address field (DAF) that IPV6 E-Packets to carry all approach nodal informations in path.
A kind of processing meanss of IPV6 message encapsulation, including：
Acquisition module, for obtaining the corresponding relation of SR section route list and List Identification LIST ID；
Forwarding module, for the corresponding relation according to described section of route list and LIST ID, to receiving
IPV6 message forwarded.
Wherein, when described forward node is SR Ingress node, described LIST ID is by described forwarding
Node carries in the amplifying message head of IPV6 message.
Wherein, described LIST ID is the bit set by Flag field in the heading of IPV6 message
The particular preset value information of information or routing type is identifying.
Wherein, described device also includes：
Generation module, for after obtaining the corresponding relation of section route list and List Identification LIST ID,
Generate the forwarding entry of LIST ID.
Wherein, described generation module includes：
Searching unit, for searching next forward node in LIST list for the described forward node
Outgoing interface information；
Storage unit, for saving as the going out of forwarding entry of LIST ID by the outgoing interface finding information
Interface message.
Wherein, described forwarding module includes：
Acquiring unit, for when receiving the address that destination address is described forward node, if described
In the heading of IPV6 message, next prolate-headed type is route-type, and remaining LIST list
Jumping figure is not zero, then obtain the next hop information in LIST list according to LIST ID value；
Retransmission unit, for as destination address, continuing to forward described IPV6 the IPV6 address of next-hop
Message.
Wherein, when described LIST ID includes all approach nodal informations in path, by by LIST
ID is placed in the destination address field (DAF) that IPV6 E-Packets to carry all approach nodal informations in path.
The embodiment that the present invention provides, distributes a LIST ID to LIST, and IPV6 is carried by encapsulation
LIST ID, and each LIST is identified by LIST id, and locally LIST is being searched by LIST ID
In next-hop destination address search the encapsulation of corresponding destination address, and forward table or original forward table,
Only showing in LIST needs to safeguard the mapping of LIST ID to LIST on the node specified.Make tool
The V6 having regular length extends and is packaged for the encapsulation of SR heading, and described LIST ID is used for mapping SR
The nodal information of LIST, is forwarded to terminal with this IPV6SR message, carries form by LIST ID
The SR encapsulation carrying out IPV6 message is realized, and effectively solving heading load shows with the quantity of specified node
Show the problem of increase, alleviate the burden of the heading of IPV6 message, improve data transmission efficiency.
Brief description
Fig. 1 is the schematic diagram of the heading form of SR in prior art；
Fig. 2 is the schematic diagram of the heading form of IPv6SR in prior art；
Fig. 3 is the schematic diagram of network topology in prior art；
Fig. 4 is the prolate-headed schematic diagram of IPv6 in prior art；
The flow chart of the processing method embodiment of the IPV6 message encapsulation that Fig. 5 provides for the present invention；
The schematic diagram of the extension header form of the IPv6 message that Fig. 6 provides for the embodiment of the present invention one；
The schematic diagram of the network topology that Fig. 7 provides for the embodiment of the present invention two；
The schematic diagram of the forward table on router R1 that Fig. 8 provides for the embodiment of the present invention two；
The schematic diagram of the LIST ID forward table that Fig. 9 provides for the embodiment of the present invention three；
The schematic diagram of Flag field in the heading of the IPV6 message that Figure 10 provides for the present invention；
The structure chart of the processing meanss of the IPV6 message encapsulation that Figure 11 provides for the present invention.
Specific embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing and specifically
The present invention is described in further detail for embodiment.It should be noted that in the case of not conflicting,
Embodiment in the application and the feature in embodiment can mutually be combined.
The flow chart of the processing method embodiment of the IPV6 message encapsulation that Fig. 5 provides for the present invention.Fig. 5
Shown method, including：
Step 501, forward node obtain the corresponding relation of SR section route list and List Identification LIST ID；
Step 502, described forward node according to the corresponding relation of described section of route list and LIST ID,
The IPV6 message receiving is forwarded.
The embodiment of the method that the present invention provides, obtains end router-list pass corresponding with LIST ID
System, recycles this corresponding relation to carry out message forwarding, by the LIST ID carrying, effectively solving message
Head load, with the problem of the quantity display increase of specified node, alleviates the heading of IPV6 message
Burden, improves data transmission efficiency.
The embodiment of the method below present invention being provided is described further：
Wherein, when described forward node is SR Ingress node, described LIST ID is by described forwarding
Node carries in the amplifying message head of IPV6 message.
Specifically, the node of path approach can be facilitated by Ingress node in IPV6 message abundant
Using this LIST ID.
Described LIST ID be bit set information by Flag field in the heading of IPV6 message or
The particular preset value information of routing type is identifying.
Available field in form by the heading making full use of IPV6 message, reduces to existing association
The modification of view, realizes simple and convenient.
Certainly, described forward node obtain section route list and List Identification LIST ID corresponding relation it
Afterwards, methods described also includes：Generate the forwarding entry of LIST ID.
By generating forwarding entry for this LIST ID, can facilitate and carry out data using this LIST ID and turn
Send out, improve the efficiency that IPV6 message forwards.
Specifically, the forwarding entry of described generation LIST ID, including：
Search the outgoing interface information of next forward node in LIST list for the described forward node；Will
The outgoing interface information finding saves as the outgoing interface information of the forwarding entry of LIST ID.
Wherein, the described corresponding relation according to described section of route list and LIST ID, to the IPV6 receiving
Message is forwarded, including：
When receiving the address that destination address is described forward node, if the report of described IPV6 message
In civilian head, next prolate-headed type is route-type, and the jumping figure of remaining LIST list is not zero,
Then the next hop information in LIST list is obtained according to LIST ID value, and the IPV6 address by next-hop
As destination address, continue to forward described IPV6 message.
In addition, when described LIST ID includes all approach nodal informations in path, by by LIST
ID is placed in the destination address field (DAF) that IPV6 E-Packets to carry all approach nodal informations in path.
Embodiment one
The SR LIST problem of the present invention to be described with a specific embodiment below.By expansion management
IPV6 address block, using the global I PV6 address being not used by or other bits length mark in order to table
Show the mapping mark of LIST, as shown in Figure 3：
Controller Controller (Operator) gets the IPV6 address of all nodes in network, sends out
Now also has the vacant IPV6 address 2001 of globally unique unicast：：1001-2001：：2000 (this word
Section can be continuous or discontinuous) be not used by, then give each node R 1-R10 distribution
Node SID be respectively 2001：：1001-2001：：1010, in addition according to strategy meter on controller
The tactful path calculating is 2001：：1001-2001：：1002-2001：：1004-2001：：
1003-2001：：1005-2001：：1006-2001：：1008-2001：：1007-2001：：1009-2001：：
1010, the nodal information of this LIST can all be carried in RH extension header by present SR header extension,
Merely just one of scene, if network size is big again, and some special strategies need through tactful warp
Cross the node of more jumping figures, be then also required to all carry in extension header by all of nodal information, this can be big
Big increase heading burden, this patent can be as shown realization：
1st, by untapped 2001 on controller：：2000 route assignment gives this path, uses 2001：：
The map maintenance that 2000 address is carried out on the controller to this tactful path, namely pass through this LIST ID
Uniquely to identify this LIST；
2nd, by 2001：：2000 to 2001：：1001-2001：：1002-2001：：1004-2001：：
1003-2001：：1005-2001：：1006-2001：：1008-2001：：1007-2001：：1009-2001：：
(described information is issued 1010 map informations by southbound interface agreement, such as PCEP (Path Computation
Element Protocol path computation element protocol), BGP-LS (Border Gateway
Protocol-Link-state Border Gateway Protocol-Link State), openflow (open flows), netconf
The extension of agreements such as (network configuration) issues) issue each node in this path.
3rd, for each node in this path, form a LIST ID (2001：：2000) arrive LIST
(2001：：1001-2001：：1002-2001：：1004-2001：：1003-2001：：1005-2001：：
1006-2001：：1008-2001：：1007-2001：：1009-2001：：1010) mapping table；
4th, for the entrance ingress node R 1 of message, as shown in figure 5, a newly-increased new routing
What type head represented that this extension header carries is an ID of trace route path information, in described new type still with existing
Extension equally include Segments Left field (jumping figure of remaining LIST list) and be still tactful road
Node number -2 (counting from zero, the first jump of itself is stripped) in footpath, Segment LIST
ID is encapsulated as 2001：：The message encapsulation destination address of 2000, basic v6 is this node R1 (2001：：
1001) next-hop node 2001 in this LIST：：1002, R2, according in the forward table of R2
Route entry forwarded；
5th, when message is forwarded to R2, destination address is itself, and message carries NH head, the inside
Segments Left field is not 0, then take out Segment LIST id field, carry out mapping table
Search, find this node R2 (2001：：1002) next-hop node 2001 in this LIST：：
1004, R4, then the address of R4 is filled in destination address field (DAF), Segments left field subtracts 1,
Then forwarded according to destination address R4；
6th, message is forwarded to R4, the operation described in same repeat step 5, and message is forwarded to
R3-R5-R6-R8-R7-R9-R10
7th, when message reaches R10, destination address is itself, and message carries NH head, the inside
Segments Left field is 0, judges it oneself is final jump, by this SR type in NH message
The optional ejection of extension header.
Embodiment two
In above-described embodiment all covering be node SID, when path need specify show paths through a certain
During bar link, need to be related to the adjacent SID (Adjacency SID) of each node, as shown in fig. 6,
Two equal-cost links are had, the adjacent SID that link above is specified is local label value between R4 and R6,
As upper and lower both links are respectively FE80::9001 and FE80::9002, if showing paths of specifying must
By a link above R4-R6 up to the LIST that then controller calculates, such as LIST 3
For:2001：：1001-2001：：1004-FE80：：9001-2001：：1010, or as real in schemed
Apply under the chain of command control described in example one, be designated 2001 to the mapping of described LIST 3：：1199,
Then the map information of this mark and routing information is handed down to R1, R3, R10 by controller, each node storage
This map information：
1st, for R1 node, controller issues the warp needed for heading of the flow needing to this tactful path
The path crossed is 2001：：1001-2001：：1004-FE80：：9001-2001：：1010, carry
The mapping mark 2001 of this LIST ID：：1199；Encapsulate as needed for Fig. 6 and show, issue needs and be forwarded to
Segments Left needed for the heading of the flow in this tactful path is still the node in tactful path
Number -2 (starting counting up from 0, local node has cut the jumping figure of oneself this jump), as 2, Segment
LIST ID is encapsulated as 2001：：1199, IPV6 message encapsulation destination address is this node R1 (2001：：
1001) next-hop node 2001 in this LIST：：1004, R4, according to shortest path to R4
Route forwarded, as shown in Fig. 8 forward table, now R1 shortest path is can by R2 to R4
Reach；
2nd, message is forwarded to R2 node, and R2 node checks that destination address is that NH head is routing to R4
Type head, oneself need not be processed, and the content in this extension header and outer envelope is not processed message
It is transmitted to R4 node；
3rd, message reaches R4 node, finds that destination address is to oneself, and shows the next one in NH head
Extension header is routing type head, then check that the type in routing type head is the ID of trace route path showing,
And segments left field is 2, oneself is not final jump, search mapping table, the next-hop of itself
For FE80：：9001, it is link-local address, take off next hop address 2001：：1010 are encapsulated in
Dst field, forwards the packet to the interface at this link address place, and segments left field subtracts one and jumps to
Locally, then subtract one and jump to link-local, then the message delivered away is now 0；
4th, message is transferred to R6 by the interface of 9001 links, and R6 is relay equipment, does not exist
In this LIST, it is according to the DST field 2001 of message：：1010 are forwarded, and give tacit consent to shortest path
For R6-R8-R10, NH head is routing type head, and oneself need not be processed, that is, to this extension header and outer layer
Dst content in encapsulation does not process and forwards the message to R8 node；
5th, the same R6 of R8 nodal operation, forwards the message to R10 node
6th, destination address is itself, and NH head is routing type head, the Segments Left word of the inside
Section is 0, judges it oneself is final jump, by the optional bullet of extension header of this SR type in NH message
Go out.
Embodiment three
As described in embodiment one describes, controller sends a map information LIST ID showing paths
(2001：：2000) arrive LIST (2001：：1001-2001：：1002-2001：：1004-2001：：
1003-2001：：1005-2001：：1006-2001：：1008-2001：：1007-2001：：1009-2001：：
1010) give all nodes, when the path between ingress to egress node comprise path approach all in
During intermediate node, all forward node all can receive this mapping message.Then can be by next of LIST ID
Hop-information learns to be from the outgoing interface of next-hop in described LIST list and gateway address, i.e. R1
Forwarding entry for example similar to Figure 7, the next-hop of R1 is R2 in this LIST, and next-hop is to R2
Outgoing interface, gateway is also the gateway to R2, then be locally generated one arrive LIST ID forwarding bar
Mesh, next-hop is the outgoing interface to R2, and gateway is also the gateway to R2, as shown in Figure 9；Equally
The nodes such as R2 R3 also all so form forwarding entry.Then when doing message encapsulation, by LIST id information
It is placed on destination node, the forwarding of each node is all forwarded according to destination address LIST ID, optional nothing
Extension header is needed to carry information, you can to pass on terminal by message along path.In destination node R10, need to know
Oneself it is not the purpose of this LIST, analytic message content, it is analyzed.Described embodiment three requires LIST
Complete node information in overlay path, not so might have intermediate forwarding nodes and searches less than to LIST
The route entry of ID.
Example IV
Marking each LIST, wherein LIST ID using unique mark LIST ID can be 20bits
The ipv4 address of label or 32bits or the IPV6 address of 128bits.
Specific LIST ID can be carried in the following way, including：
It is identified by some bit set in the RESV field in the extension header of route-type；
Or, new routing type value is set.
Wherein, RESV field can carry for the field of existing SR extension.As shown in Figure 10, FLAG
Certain R set in field is shown to be the ID of trace route path carrying.Because node has the mapping table of ID of trace route path,
The label that the reserved place of original policy can be available for representing how many bits specifically carrying, its
In as three bit fields of wherein FLAG field low level be respectively the mark of how many bits set in order to identify.
The structure chart of the processing meanss of the IPV6 message encapsulation that Figure 11 provides for the present invention.Shown in Figure 10
Device, including：
Acquisition module 1101, for obtaining, SR section route list is corresponding with List Identification LIST ID to close
System；
Forwarding module 1102, for the corresponding relation according to described section of route list and LIST ID, docks
The IPV6 message receiving is forwarded.
Wherein, when described device is located at SR Ingress node, described LIST ID is to forward section by described
Point carries in the amplifying message head of IPV6 message.
Wherein, described LIST ID is the bit set by Flag field in the heading of IPV6 message
The particular preset value information of information or routing type is identifying.
Wherein, described device also includes：
Generation module, for after obtaining the corresponding relation of section route list and List Identification LIST ID,
Generate the forwarding entry of LIST ID.
Wherein, described generation module includes：
Searching unit, for searching next forward node in LIST list for the described forward node
Outgoing interface information；
Storage unit, for saving as the going out of forwarding entry of LIST ID by the outgoing interface finding information
Interface message.
Wherein, described forwarding module 1102 includes：
Acquiring unit, for when receiving the address that destination address is described forward node, if described
In the heading of IPV6 message, next prolate-headed type is route-type, and remaining LIST list
Jumping figure is not zero, then obtain the next hop information in LIST list according to LIST ID value；
Retransmission unit, for as destination address, continuing to forward described IPV6 the IPV6 address of next-hop
Message.
Wherein, when described LIST ID includes all approach nodal informations in path, by by LIST
ID is placed in the destination address field (DAF) that IPV6 E-Packets to carry all approach nodal informations in path.
The device embodiment that the present invention provides, obtains end router-list pass corresponding with LIST ID
System, recycles this corresponding relation to carry out message forwarding, by the LIST ID carrying, effectively solving message
Head load, with the problem of the quantity display increase of specified node, alleviates the heading of IPV6 message
Burden, improves data transmission efficiency.
One of ordinary skill in the art will appreciate that all or part of step of above-described embodiment can be using meter
Realizing, described computer program can be stored in a computer-readable recording medium calculation machine program circuit,
Described computer program executes (as system, unit, device etc.) on corresponding hardware platform,
Upon execution, including one or a combination set of the step of embodiment of the method.
Alternatively, all or part of step of above-described embodiment can also be realized using integrated circuit, this
A little steps can be fabricated to integrated circuit modules one by one respectively, or by the multiple modules in them or
Step is fabricated to single integrated circuit module to realize.So, the present invention be not restricted to any specifically hard
Part and software combine.
Each device/functional module/functional unit in above-described embodiment can be come using general computing device
Realize, they can concentrate on single computing device it is also possible to be distributed in multiple computing device institutes group
On the network becoming.
Each device/functional module/functional unit in above-described embodiment is realized in the form of software function module
And as when independent production marketing or use, can be stored in a computer read/write memory medium.
Computer read/write memory medium mentioned above can be read-only storage, disk or CD etc..
The above, the only specific embodiment of the present invention, but protection scope of the present invention is not limited to
In this, any those familiar with the art the invention discloses technical scope in, can be easily
Expect change or replacement, all should be included within the scope of the present invention.Therefore, the protection of the present invention
Scope should the protection domain described in by claim be defined.
Claims (14)
1. a kind of processing method of IPV6 message encapsulation is it is characterised in that include：
Forward node obtains the corresponding relation of SR section route list and List Identification LIST ID；
Described forward node according to the corresponding relation of described section of route list and LIST ID, to receive
IPV6 message is forwarded.
2. method according to claim 1 is it is characterised in that when described forward node enters for SR
During mouth node, described LIST ID is the amplifying message head being carried by described forward node in IPV6 message
In.
3. method according to claim 2 is it is characterised in that described LIST ID is by IPV6
The bit set information of Flag field or the particular preset value information of routing type in the heading of message
To identify.
4. method according to claim 1 is it is characterised in that described forward node obtains section route
After the corresponding relation of list and List Identification LIST ID, methods described also includes：
Generate the forwarding entry of LIST ID.
5. method according to claim 4 is it is characterised in that the forwarding of described generation LIST ID
Entry, including：
Search the outgoing interface information of next forward node in LIST list for the described forward node；
The outgoing interface finding information is saved as the outgoing interface information of the forwarding entry of LIST ID.
6. method according to claim 1 it is characterised in that described according to described section of route list
With the corresponding relation of LIST ID, the IPV6 message receiving is forwarded, including：
When receiving the address that destination address is described forward node, if the report of described IPV6 message
In civilian head, next prolate-headed type is route-type, and the jumping figure of remaining LIST list is not zero,
Then the next hop information in LIST list is obtained according to LIST ID value, and the IPV6 address by next-hop
As destination address, continue to forward described IPV6 message.
7. according to the arbitrary described method of claim 1 to 6 it is characterised in that in described LIST ID
When including all approach nodal informations in path, by LIST ID is placed in what IPV6 E-Packeted
Destination address field (DAF) is carrying all approach nodal informations in path.
8. a kind of processing meanss of IPV6 message encapsulation are it is characterised in that include：
Acquisition module, for obtaining the corresponding relation of SR section route list and List Identification LIST ID；
Forwarding module, for the corresponding relation according to described section of route list and LIST ID, to receiving
IPV6 message forwarded.
9. device according to claim 8 is it is characterised in that when described forward node enters for SR
During mouth node, described LIST ID is the amplifying message head being carried by described forward node in IPV6 message
In.
10. device according to claim 9 is it is characterised in that described LIST ID is by IPV6
The bit set information of Flag field or the particular preset value information of routing type in the heading of message
To identify.
11. devices according to claim 8 are it is characterised in that described device also includes：
Generation module, for after obtaining the corresponding relation of section route list and List Identification LIST ID,
Generate the forwarding entry of LIST ID.
12. devices according to claim 11 are it is characterised in that described generation module includes：
Searching unit, for searching next forward node in LIST list for the described forward node
Outgoing interface information；
Storage unit, for saving as the going out of forwarding entry of LIST ID by the outgoing interface finding information
Interface message.
13. devices according to claim 8 are it is characterised in that described forwarding module includes：
Acquiring unit, for when receiving the address that destination address is described forward node, if described
In the heading of IPV6 message, next prolate-headed type is route-type, and remaining LIST list
Jumping figure is not zero, then obtain the next hop information in LIST list according to LIST ID value；
Retransmission unit, for as destination address, continuing to forward described IPV6 the IPV6 address of next-hop
Message.
14. according to Claim 8 to 13 arbitrary described devices it is characterised in that in described LIST ID
When including all approach nodal informations in path, by LIST ID is placed in what IPV6 E-Packeted
Destination address field (DAF) is carrying all approach nodal informations in path.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510460405.8A CN106411738A (en) | 2015-07-30 | 2015-07-30 | Processing method and apparatus of packaging of IPV6 message |
| PCT/CN2016/080539 WO2017016254A1 (en) | 2015-07-30 | 2016-04-28 | Ipv6 message encapsulation processing method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510460405.8A CN106411738A (en) | 2015-07-30 | 2015-07-30 | Processing method and apparatus of packaging of IPV6 message |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106411738A true CN106411738A (en) | 2017-02-15 |
Family
ID=57884057
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510460405.8A Pending CN106411738A (en) | 2015-07-30 | 2015-07-30 | Processing method and apparatus of packaging of IPV6 message |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN106411738A (en) |
| WO (1) | WO2017016254A1 (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379359A (en) * | 2018-10-19 | 2019-02-22 | 盛科网络（苏州）有限公司 | The treating method and apparatus of SRv6 data packet |
| CN109688057A (en) * | 2018-12-13 | 2019-04-26 | Ut斯达康通讯有限公司 | The message forwarding method and device of section route network based on IPV6 |
| CN109962847A (en) * | 2017-12-14 | 2019-07-02 | 中国电信股份有限公司 | The packaging method and device and computer readable storage medium of business function chain message |
| CN110611616A (en) * | 2019-09-18 | 2019-12-24 | 下一代互联网重大应用技术（北京）工程研究中心有限公司 | Traffic scheduling method, system, device and medium based on Radius server |
| CN111385199A (en) * | 2018-12-28 | 2020-07-07 | 瞻博网络公司 | Compressed Routing Header |
| CN111510386A (en) * | 2019-01-30 | 2020-08-07 | 华为技术有限公司 | Method and apparatus for processing messages |
| CN111541614A (en) * | 2020-01-21 | 2020-08-14 | 中国银联股份有限公司 | Message forwarding method and network node |
| WO2020182085A1 (en) * | 2019-03-08 | 2020-09-17 | 华为技术有限公司 | Transmission method and device for message |
| CN112350934A (en) * | 2019-08-07 | 2021-02-09 | 中国电信股份有限公司 | Data transmission method, network node and data transmission system |
| CN112910772A (en) * | 2019-11-19 | 2021-06-04 | 中国移动通信有限公司研究院 | Message forwarding method and device based on segmented routing |
| CN113014485A (en) * | 2021-02-25 | 2021-06-22 | 烽火通信科技股份有限公司 | Message forwarding method and message forwarding device based on SRv6-TE path |
| CN113141338A (en) * | 2020-01-20 | 2021-07-20 | 华为技术有限公司 | Message generation method, message processing method and message processing device |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| WO2021244487A1 (en) * | 2020-06-02 | 2021-12-09 | 华为技术有限公司 | Processing capability determination method, and node and system |
| WO2022134674A1 (en) * | 2020-12-22 | 2022-06-30 | 华为技术有限公司 | Message transmission method and apparatus, and device, storage medium and system |
| US11412071B2 (en) | 2019-05-13 | 2022-08-09 | Juniper Networks, Inc. | Compressed routing header information for networks |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112583745A (en) | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method, equipment and system for forwarding message in SR network |
| CN112511424B (en) * | 2020-05-15 | 2024-11-19 | 中兴通讯股份有限公司 | Method for forwarding and forwarding messages, head node, forwarding node, storage medium |
| CN114697254B (en) * | 2020-12-31 | 2024-06-11 | 北京华为数字技术有限公司 | Message processing method and related device |
| CN113472653B (en) * | 2021-05-25 | 2022-11-18 | 新华三信息安全技术有限公司 | Method and device for detecting path consistency |
| CN113542059B (en) * | 2021-06-29 | 2022-08-30 | 新华三大数据技术有限公司 | Segment routing multipath BFD detection method, device and storage medium |
| CN113472666B (en) * | 2021-06-29 | 2023-08-18 | 新华三信息安全技术有限公司 | Message forwarding method and device |
| CN113411259A (en) * | 2021-06-30 | 2021-09-17 | 新华三技术有限公司 | Message forwarding method, device and equipment |
| CN114124781B (en) * | 2021-11-23 | 2023-05-16 | 中国联合网络通信集团有限公司 | Method and system for forwarding message in SRv, electronic equipment and storage medium |
| CN116366516B (en) * | 2021-12-27 | 2024-08-20 | 苏州盛科通信股份有限公司 | Editing method and device of route information, storage medium and electronic device |
| CN117376233A (en) * | 2022-06-30 | 2024-01-09 | 华为技术有限公司 | Data processing method, device and system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014144344A1 (en) * | 2013-03-15 | 2014-09-18 | Cisco Technology, Inc. | Seamless segment routing |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7688829B2 (en) * | 2005-09-14 | 2010-03-30 | Cisco Technology, Inc. | System and methods for network segmentation |
| US9369371B2 (en) * | 2012-10-05 | 2016-06-14 | Cisco Technologies, Inc. | Method and system for path monitoring using segment routing |
| US9559954B2 (en) * | 2013-03-11 | 2017-01-31 | Cisco Technology, Inc. | Indexed segment ID |
-
2015
- 2015-07-30 CN CN201510460405.8A patent/CN106411738A/en active Pending
-
2016
- 2016-04-28 WO PCT/CN2016/080539 patent/WO2017016254A1/en active Application Filing
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014144344A1 (en) * | 2013-03-15 | 2014-09-18 | Cisco Technology, Inc. | Seamless segment routing |
Non-Patent Citations (1)
| Title |
|---|
| 思科系统公司: "IPv6 Segment Routing Header（SRH）", 《IPV6 SEGMENT ROUTING HEADER（SRH）DRAFT-PREVIDI-6MAN-SEGMENT-ROUTING-HEADER-01》 * |
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109962847A (en) * | 2017-12-14 | 2019-07-02 | 中国电信股份有限公司 | The packaging method and device and computer readable storage medium of business function chain message |
| CN109379359A (en) * | 2018-10-19 | 2019-02-22 | 盛科网络（苏州）有限公司 | The treating method and apparatus of SRv6 data packet |
| CN109688057A (en) * | 2018-12-13 | 2019-04-26 | Ut斯达康通讯有限公司 | The message forwarding method and device of section route network based on IPV6 |
| CN109688057B (en) * | 2018-12-13 | 2021-08-24 | Ut斯达康通讯有限公司 | Message forwarding method and device of segment routing network based on IPV6 |
| CN115733784A (en) * | 2018-12-28 | 2023-03-03 | 瞻博网络公司 | Compressed Routing Header |
| CN111385199A (en) * | 2018-12-28 | 2020-07-07 | 瞻博网络公司 | Compressed Routing Header |
| US11245617B1 (en) | 2018-12-28 | 2022-02-08 | Juniper Networks, Inc. | Compressed routing header |
| US11902153B1 (en) | 2018-12-28 | 2024-02-13 | Juniper Networks, Inc. | Compressed routing header |
| US11349754B2 (en) | 2019-01-30 | 2022-05-31 | Huawei Technologies Co., Ltd. | Packet processing method and apparatus |
| CN111510386A (en) * | 2019-01-30 | 2020-08-07 | 华为技术有限公司 | Method and apparatus for processing messages |
| US11956148B2 (en) | 2019-03-08 | 2024-04-09 | Huawei Technologies Co., Ltd. | Packet transmission method and device |
| WO2020182085A1 (en) * | 2019-03-08 | 2020-09-17 | 华为技术有限公司 | Transmission method and device for message |
| US11412071B2 (en) | 2019-05-13 | 2022-08-09 | Juniper Networks, Inc. | Compressed routing header information for networks |
| CN112350934A (en) * | 2019-08-07 | 2021-02-09 | 中国电信股份有限公司 | Data transmission method, network node and data transmission system |
| CN110611616A (en) * | 2019-09-18 | 2019-12-24 | 下一代互联网重大应用技术（北京）工程研究中心有限公司 | Traffic scheduling method, system, device and medium based on Radius server |
| CN112910772B (en) * | 2019-11-19 | 2023-01-13 | 中国移动通信有限公司研究院 | Message forwarding method and device based on segmented routing |
| CN112910772A (en) * | 2019-11-19 | 2021-06-04 | 中国移动通信有限公司研究院 | Message forwarding method and device based on segmented routing |
| CN113141338B (en) * | 2020-01-20 | 2022-07-22 | 华为技术有限公司 | Message generation method, processing method and device |
| CN113141338A (en) * | 2020-01-20 | 2021-07-20 | 华为技术有限公司 | Message generation method, message processing method and message processing device |
| US11588732B2 (en) | 2020-01-20 | 2023-02-21 | Huawei Technologies Co., Ltd. | Message generation method and apparatus, and message processing method and apparatus |
| US11757775B2 (en) | 2020-01-20 | 2023-09-12 | Huawei Technologies Co., Ltd. | Message generation method and apparatus, and message processing method and apparatus |
| CN111541614B (en) * | 2020-01-21 | 2022-04-08 | 中国银联股份有限公司 | Message forwarding method and network node |
| CN111541614A (en) * | 2020-01-21 | 2020-08-14 | 中国银联股份有限公司 | Message forwarding method and network node |
| CN113438160A (en) * | 2020-03-23 | 2021-09-24 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| CN113438160B (en) * | 2020-03-23 | 2024-05-31 | 中兴通讯股份有限公司 | Routing method, routing device and computer readable storage medium |
| WO2021244487A1 (en) * | 2020-06-02 | 2021-12-09 | 华为技术有限公司 | Processing capability determination method, and node and system |
| WO2022134674A1 (en) * | 2020-12-22 | 2022-06-30 | 华为技术有限公司 | Message transmission method and apparatus, and device, storage medium and system |
| CN113014485A (en) * | 2021-02-25 | 2021-06-22 | 烽火通信科技股份有限公司 | Message forwarding method and message forwarding device based on SRv6-TE path |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017016254A1 (en) | 2017-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106411738A (en) | Processing method and apparatus of packaging of IPV6 message | |
| CN111953604B (en) | Method and device for providing business service for business flow | |
| CN103354988B (en) | For calculating the system and method for the point-to-point label switched path through multiple territory | |
| CN106330714B (en) | Method and device for realizing service function chain | |
| CN104378292B (en) | A kind of method and device of forwarding MPLS packets | |
| US11743204B2 (en) | Tunnel establishment method, apparatus, and system | |
| EP2993836B1 (en) | Method and device for routing data message | |
| CN108737269B (en) | Encapsulation method, device and node | |
| CN108737128A (en) | It is a kind of to realize the method and device with interior operation management maintainance IOAM | |
| CN107925624A (en) | Message forwarding method, device and system based on business function chain SFC | |
| CN104348727B (en) | Flow table item processing method and equipment in OpenFlow networks | |
| CN106603413B (en) | Method and device for transmitting flow through designated path | |
| US11075833B2 (en) | Packet forwarding method and node device based on BIER-TE, and storage medium | |
| CN107342939A (en) | The method and apparatus for transmitting data | |
| CN105594167A (en) | Method, controller, forwarding device, and network system for forwarding packets | |
| CN106487686A (en) | SR forwarding entry generation method and device | |
| CN105991437A (en) | Massage forwarding processing method, massage forwarding processing device, controller and routing forwarding device | |
| CN113746729B (en) | Method and device for processing binding segment identification | |
| CN108768856A (en) | A kind of route processing method and device | |
| EP4002776A1 (en) | End-to-end flow monitoring in a computer network | |
| CN113194033B (en) | Message forwarding method and device based on SDN (software defined network) segment routing networking and storage medium | |
| EP3846392B1 (en) | Cross-domain bidirectional tunnel creation method, communication method and apparatus, and storage medium | |
| CN114448881B (en) | Method and system for inter-operating communication of cross-SR MPLS and SRV6 domains | |
| CN106789705A (en) | The method and apparatus of transmission control message | |
| CN113542126B (en) | Generalized SRv6 full-path compression method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170215 |
|
| RJ01 | Rejection of invention patent application after publication |