CN107872388A - For realizing the methods, devices and systems of message forwarding - Google Patents

For realizing the methods, devices and systems of message forwarding Download PDF

Info

Publication number
CN107872388A
CN107872388A CN201610852364.1A CN201610852364A CN107872388A CN 107872388 A CN107872388 A CN 107872388A CN 201610852364 A CN201610852364 A CN 201610852364A CN 107872388 A CN107872388 A CN 107872388A
Authority
CN
China
Prior art keywords
message
label
router
interface
routing
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
Application number
CN201610852364.1A
Other languages
Chinese (zh)
Inventor
黄灿灿
朱永庆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN201610852364.1A priority Critical patent/CN107872388A/en
Publication of CN107872388A publication Critical patent/CN107872388A/en
Pending legal-status Critical Current

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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • 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/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507—Label distribution

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention discloses a kind of methods, devices and systems for being used to realize message forwarding, is related to the communications field.Wherein, router is after the first message is received, in the case where not finding the routing iinformation corresponding with the first message, first message is forwarded to SDN controllers, SDN controllers are according to the destination address of the first message, the optimal path from the router to destination address is calculated, each interface label on optimal path is found out from global interface coding schedule, and the corresponding interface label is pressed into the label stack of the first message to obtain the second message according to respective sequence；Router is forwarded after the second message that SND controllers issue is received, by the second message by interface corresponding with the first layer label in label stack, while the first layer label in label stack is ejected.By implementing the present invention, the occupancy of memory source can be effectively reduced while routing forwarding efficiency is improved.

Description

For realizing the methods, devices and systems of message forwarding
Technical field
The present invention relates to the communications field, more particularly to a kind of methods, devices and systems for being used to realize message forwarding.
Background technology
Traditional IP routing forwardings are to search the outgoing interface of message by searching route forwarding table according to purpose IP address , due to more low using Longest prefix match algorithm, the search efficiency of forward table.MPLS (the Multi occurred later Protocol Label Switch, multiprotocol label switching) agreement, by the way that IP address prefix is mapped as into MPLS label so that Forward efficiency is greatly improved.Both the above message forward mode is the forwarding mould of the distributed route computing mainstream of the times Formula.
With the rise once again of SDN (Software Defined Network, software defined network) concepts in recent years, make Flexibly optimal path is calculated with concentrated route computation schema according to network various parameters progressively to become a reality.Segment routing (Segment Routing) is exactly a kind of label distribution protocol based on centralized and distributed router-level topology pattern.With forwarding Exemplified by plane is MPLS, it first passes through SDN and calculates forward-path end to end, then by each section in paths traversed Global label or the local interface label of the router at both ends is pressed into label stack in source, and message carries whole routing tag Forwarded.
But Segment Routing the shortcomings that also having oneself, because it is to carry out source routing calculating according to segmentation, Route between two end nodes being each segmented is drawn by traditional distributed route computing, therefore all on path Router must all retain IP route forwarding tables and its corresponding Label Forwarding Information Base under original distributed mode.With route Table clause is more and more (such as the routing table entry on CN2PE can be more than 600,000), although Label Forwarding Information Base can lift lookup Efficiency, but can also take more costlinesses router TCAM (Ternary Content Addressable Memory, three State content adressable memory) resource memory source either on piece.
The content of the invention
The embodiment of the present invention provides a kind of methods, devices and systems for being used to realize message forwarding, by by SDN controllers Optimal path is selected for message, and each interface code tag on optimal path is pressed into heading according to predetermined way In label stack, so that router carries out message routing according to the label of the label stack first floor, while first floor label is ejected.So as to The occupancy of memory source can be effectively reduced while routing forwarding efficiency is improved.
According to an aspect of the present invention, there is provided a kind of method for realizing message forwarding, including：
For router after the first message is received, inquiry whether there is the routing iinformation corresponding with the first message；
If in the absence of the routing iinformation corresponding with the first message, the first message is forwarded to SDN controllers by router, So that SDN controllers are according to the destination address of the first message, the optimal path from router to destination address is calculated, from the overall situation Each interface label on optimal path is found out in interface coding schedule, and according to the order from destination address to router, by phase Interface label is answered to be pressed into the label stack of the first message to obtain the second message；
Router after the second message that SND controllers issue is received, by the second message by with the second message label The corresponding interface of first layer label in storehouse is forwarded, while by the first layer label bullet in the second message label storehouse Go out.
In one embodiment, router is after the first message is received, and inquiry is with the presence or absence of corresponding with the first message Routing iinformation include：
Router judges whether include label in the label stack of the first message after the first message is received；
If not including label in the label stack of the first message, further determine whether in the presence of related to the first message Local routing information；
If in the absence of the local routing information related to the first message, router is determined in the absence of relative with the first message The routing iinformation answered.
In one embodiment, if including label in the label stack of the first message, router passes through the first message Interface corresponding with the first layer label in the first message label storehouse is forwarded, while by the first message label storehouse First layer label ejects.
In one embodiment, if not including label in the label stack of the first message, but exist related to the first message Local routing information, then router the first message is forwarded using the local routing information related to the first message.
In one embodiment, local routing information includes route flow table or routing forwarding entry.
According to another aspect of the present invention, there is provided a kind of router for being used to realize message forwarding, including receiving module, look into Module, label acquisition module and routing module are ask, wherein：
Receiving module, for receiving the first message；
Enquiry module, for after receiving module receives the first message, inquiry to be with the presence or absence of corresponding with the first message Routing iinformation；
Label acquisition module, in the case of in the absence of the routing iinformation corresponding with the first message, first to be reported Text is forwarded to SDN controllers, so that SDN controllers are according to the destination address of the first message, calculates from router to destination The optimal path of location, finds out each interface label on optimal path from global interface coding schedule, and according to from destination address To the order of router, the corresponding interface label is pressed into the label stack of the first message to obtain the second message；
Routing module, for receive that SND controllers issue in label acquisition module the second message after, by the second message Forwarded by interface corresponding with the first layer label in the second message label storehouse, while by the second message label storehouse In first layer label ejection.
In one embodiment, enquiry module judges the label stack of the first message specifically after the first message is received In whether include label, if not including label in the label stack of the first message, further determine whether exist and first report Literary related local routing information, if in the absence of the local routing information related to the first message, it is determined that in the absence of with first The corresponding routing iinformation of message.
In one embodiment, routing module is additionally operable in the case of including label in the label stack of the first message, First message is forwarded by interface corresponding with the first layer label in the first message label storehouse, while first is reported First layer label ejection in literary label stack.
In one embodiment, routing module is additionally operable to not include label in the label stack of the first message but existed In the case of the local routing information related to the first message, first is reported using the local routing information related to the first message Text is forwarded.
In one embodiment, local routing information includes route flow table or routing forwarding entry.
According to another aspect of the present invention, there is provided a kind of system for being used to realize message forwarding, including any of the above-described implementation The router that example is related to, and
SDN controllers, for after the first message that router reports is received, according to the destination address of the first message, The optimal path from router to destination address is calculated, and each connecing on optimal path is found out from global interface coding schedule Mouth label；Order from destination address to router, the corresponding interface label is pressed into the label stack of the first message to obtain Second message, and the second message is handed down to router.
By referring to the drawings to the present invention exemplary embodiment detailed description, further feature of the invention and its Advantage will be made apparent from.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this Some embodiments of invention, for those of ordinary skill in the art, without having to pay creative labor, may be used also To obtain other accompanying drawings according to these accompanying drawings.
Fig. 1 is the schematic diagram that the present invention is used to realize method one embodiment of message forwarding.
Fig. 2 is the schematic diagram that the present invention is used to realize another embodiment of method of message forwarding.
Fig. 3 is the schematic diagram that the present invention is used to realize router one embodiment of message forwarding.
Fig. 4 is the schematic diagram that the present invention is used to realize system one embodiment of message forwarding.
Fig. 5 is the schematic diagram that message of the present invention forwards one embodiment.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, rather than whole embodiments.Below Description only actually at least one exemplary embodiment is illustrative, is never used as to the present invention and its application or makes Any restrictions.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise Lower obtained every other embodiment, belongs to the scope of protection of the invention.
Unless specifically stated otherwise, the part and positioned opposite, the digital table of step otherwise illustrated in these embodiments Do not limited the scope of the invention up to formula and numerical value.
Simultaneously, it should be appreciated that for the ease of description, the size of the various pieces shown in accompanying drawing is not according to reality Proportionate relationship draw.
It may be not discussed in detail for technology, method and apparatus known to person of ordinary skill in the relevant, but suitable In the case of, the technology, method and apparatus should be considered as authorizing part for specification.
In shown here and discussion all examples, any occurrence should be construed as merely exemplary, without It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should be noted that：Similar label and letter represents similar terms in following accompanying drawing, therefore, once a certain Xiang Yi It is defined, then it need not be further discussed in subsequent accompanying drawing in individual accompanying drawing.
Fig. 1 is the schematic diagram that the present invention is used to realize method one embodiment of message forwarding.Wherein：
Step 101, router after the first message is received, with the presence or absence of the route corresponding with the first message believe by inquiry Breath.
Step 102, if in the absence of the routing iinformation corresponding with the first message, the first message is forwarded to by router SDN controllers, so that SDN controllers press respective sequence by the label stack of each interface label press-in message on optimal path In.
Wherein SDN controllers calculate the optimal road from router to destination address according to the destination address of the first message Footpath, find out each interface label on optimal path from global interface coding schedule, and according to from destination address to router Sequentially, the corresponding interface label is pressed into the label stack of the first message to obtain the second message.
Step 103, router is after the second message that SND controllers issue is received, by the second message by with second The corresponding interface of first layer label in message label storehouse is forwarded, while by the first layer in the second message label storehouse Label ejects.
Alternatively, router first determines whether included in the label stack of the first message after the first message is received Label, if not including label in the label stack of the first message, it can further determine whether the sheet related to the first message be present Ground routing iinformation, if in the absence of the local routing information related to the first message, router determines to be not present and the first message Corresponding routing iinformation, ask SDN controllers to calculate optimal path in this case and provide each on the optimal path The label of interface.
The method for being used to realize message forwarding provided based on the above embodiment of the present invention, by being report by SDN controllers Selected works select optimal path, and by each interface code tag on optimal path according to the label in predetermined way press-in heading In storehouse, so that router carries out message routing according to the label of the label stack first floor, while first floor label is ejected.So as to carry The occupancy of memory source can be effectively reduced while high routing forwarding efficiency.
Fig. 2 is the schematic diagram that the present invention is used to realize another embodiment of method of message forwarding.Wherein：
Step 201, router receives the first message.
Step 202, router judges whether include label in the label stack of the first message.If the label heap of the first message Label is included in stack, then performs step 203；If not including label in the label stack of the first message, step 204 is performed.
Step 203, router connects the first message by corresponding with the first layer label in the first message label storehouse Mouth is forwarded, while the first layer label in the first message label storehouse is ejected.Its of the present embodiment is no longer performed afterwards Its step.
Label is included in label stack, this shows SDN controllers and calculates optimal path for the message, and by path On interface label be pressed into label stack, first floor label in the label stack can be used directly in this case and carry out Routing forwarding.
Step 204, router further determines whether the local routing information related to the first message be present.Wherein, originally Ground routing iinformation may include to route flow table or routing forwarding entry.
If in the presence of the local routing information related to the first message, step 205 is performed；If it is not present and the first message phase The local routing information of pass, then perform step 206.
Step 205, router is forwarded the first message using the local routing information related to the first message.Afterwards No longer perform other steps of the present embodiment.
Step 206, due to being forwarded to the first message in the absence of the routing iinformation corresponding with the first message, router SDN controllers, so that SDN controllers press respective sequence by the label of each interface label the first message of press-in on optimal path To obtain the second message in storehouse.
Step 207, router is after the second message that SND controllers issue is received, by the second message by with second The corresponding interface of first layer label in message label storehouse is forwarded, while by the first layer in the second message label storehouse Label ejects.
Fig. 3 is the schematic diagram that the present invention is used to realize router one embodiment of message forwarding.As shown in figure 3, the road Receiving module 301, enquiry module 302, label acquisition module 303 and routing module 304 may include by device.Wherein：
Receiving module 301 is used to receive the first message.
Enquiry module 302 is used for after receiving module 301 receives the first message, and inquiry whether there is and the first message phase Corresponding routing iinformation.
Label acquisition module 303 is used in the case of in the absence of the routing iinformation corresponding with the first message, by first Message is forwarded to SDN controllers, so that SDN controllers are according to the destination address of the first message, calculates from router to purpose The optimal path of address, finds out each interface label on optimal path from global interface coding schedule, and according to from destination The corresponding interface label is pressed into the label stack of the first message to obtain the second message by location to the order of router.
Routing module 304 is used for after the second message that label acquisition module 303 receives that SND controllers issue, by the Two messages are forwarded by interface corresponding with the first layer label in the second message label storehouse, while by the second message mark Sign the first layer label ejection in storehouse.
The router for being used to realize message forwarding provided based on the above embodiment of the present invention, wherein being by SDN controllers Message selects optimal path, and by each interface code tag on optimal path according to the mark in predetermined way press-in heading Sign in storehouse, so that router carries out message routing according to the label of the label stack first floor, while eject first floor label.So that The occupancy of memory source can be effectively reduced while improving routing forwarding efficiency.
Alternatively, enquiry module 302 is specifically after the first message is received, judge in the label stack of the first message whether Comprising label, if not including label in the label stack of the first message, further determine whether in the presence of related to the first message Local routing information, if in the absence of the local routing information related to the first message, it is determined that in the absence of with the first message phase Corresponding routing iinformation.
For example, local routing information may include to route flow table or routing forwarding entry.
Alternatively, routing module 304 is additionally operable in the case of including label in the label stack of the first message, by first Message is forwarded by interface corresponding with the first layer label in the first message label storehouse, while by the first message label First layer label ejection in storehouse.
Alternatively, routing module 304 is additionally operable to not include label in the label stack of the first message but existed and first In the case of the related local routing information of message, the first message is carried out using the local routing information related to the first message Forwarding.
Fig. 4 is the schematic diagram that the present invention is used to realize system one embodiment of message forwarding.As shown in figure 4, the system It may include router 401 and SDN controllers 402, wherein router 401 can be the router that any embodiment is related in Fig. 3.
SDN controllers 402 are used for after the first message that router 401 reports is received, according to the purpose of the first message Address, the optimal path from router to destination address is calculated, and found out from global interface coding schedule on optimal path Each interface label；Order from destination address to router, the corresponding interface label is pressed into the label stack of the first message To obtain the second message, and the second message is handed down to router 401.
As an example, a router is illustrate only in Fig. 4.Those skilled in the art are it will be appreciated that SDN is controlled Device can interact with multiple routers.
Below by a specific example, the present invention will be described.
Wherein, if SDN controllers have link and the real-time performance data of equipment in routed domain, SDN controllers are to Yu Nei roads Global coding is carried out by each interface of device.
1) when message reaches the first router, due to not including label, while first in the label stack of the message Corresponding route flow table or routing forwarding entry is also not present in router, then the message is forwarded to SDN controls by the first router Device.
2) SDN controllers are according to the destination address of the message, and combine obtained network real-time condition, calculate from the Optimal path of one router to the destination address.
For example, be related to 4 routers on the optimal path altogether, i.e., the first router, the second router, third router and 4th router.Corresponding system architecture is as shown in Figure 5.
Wherein, the interface label mapping table of the first router is as shown in table 1.
Table 1
The interface label mapping table of the second router is as shown in table 2.
Int POS1/0 10010100
Int E0/0 10000101
Int E2/1 11001110
Int E1/2 10011110
Table 2
The interface label mapping table of third router is as shown in table 3.
Int POS0/1 11000100
Int E2/0 11000110
Int E2/1 10101110
Int E1/1 10111110
Table 3
The interface label mapping table of 4th router is as shown in table 4.
Int POS0/1 11000100
Int E2/0 11000110
Int E2/1 10100101
Int E1/1 10111110
Table 4
3) SDN controllers find out what is passed through on path according to the optimal path calculated from global interface coding schedule The coding of each interface, and the label by these codings according to the order press-in heading from the 4th router to the first router In storehouse, and message is handed down to the first router.
Now, label stack is as shown in table 5.
Table 5
4) the first router is corresponding from the first router according to the first layer label in the label stack of message 10000100 interface is gone out, while ejects the first floor label.
5) after message reaches the direct-connected interface of the second router, because message label storehouse now is as shown in table 6, therefore The second router searches the outgoing interface corresponding to 10000101, and message is forwarded to the direct-connected end of third router from the outgoing interface Mouthful, and eject the first floor label.
10000101
11000100
10100101
Table 6
6) after message reaches the direct-connected interface of third router, because message label storehouse now is as shown in table 7, therefore Third router searches the outgoing interface corresponding to 11000100, and message is forwarded to the direct-connected end of the 4th router from the outgoing interface Mouthful, and eject the first floor label.
11000100
10100101
Table 7
7) after message reaches the direct-connected interface of the 4th router, because message label storehouse now is as shown in table 8, therefore Third router searches the outgoing interface corresponding to 11000100, message is forwarded into destination address from the outgoing interface, and eject and be somebody's turn to do First floor label.
10100101
Table 8
After the first floor label is ejected, label stack is sky, as shown in table 9.
Table 9
Theing improvement is that relative to existing Segment routing SR of the invention：
1) message expense contrasts.SR and global interface involved in the present invention (Global interface, abbreviation：GI) mark It is all 4 bytes to sign length.SR is always above spent generally using segmentation, label stack level less than GI in source, SR header Less than GI；On non-end node, SR is not leant out using segmentation, label, and label stack level is constant, therefore message total length is possible to More than GI.
2) router memory takes contrast.SR methods neutralize distributed two kinds of router-level topology patterns using collection, and router needs To store simultaneously route forwarding table, MPLS label forward table,
SR MPLS label forward tables.GI methods router using concentration be router-level topology pattern, only need to store GI labels with The mapping table of interface, entry number are consistent with router interface number.SR methods EMS memory occupation will be far longer than GI methods.
One of ordinary skill in the art will appreciate that hardware can be passed through by realizing all or part of step of above-described embodiment To complete, by program the hardware of correlation can also be instructed to complete, described program can be stored in a kind of computer-readable In storage medium, storage medium mentioned above can be read-only storage, disk or CD etc..
Description of the invention provides for the sake of example and description, and is not exhaustively or by the present invention It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.Select and retouch State embodiment and be to more preferably illustrate the principle and practical application of the present invention, and one of ordinary skill in the art is managed The present invention is solved so as to design the various embodiments with various modifications suitable for special-purpose.

Claims (11)

  1. A kind of 1. method for being used to realize message forwarding, it is characterised in that including：
    For router after the first message is received, inquiry whether there is the routing iinformation corresponding with the first message；
    If in the absence of the routing iinformation corresponding with the first message, the first message is forwarded to SDN controllers by the router, So that SDN controllers are according to the destination address of the first message, the optimal road from the router to the destination address is calculated Footpath, finds out each interface label on the optimal path from global interface coding schedule, and according to from the destination address to The order of the router, the corresponding interface label is pressed into the label stack of the first message to obtain the second message；
    The router after the second message that SND controllers issue is received, by the second message by with the second message label The corresponding interface of first layer label in storehouse is forwarded, while by the first layer label bullet in the second message label storehouse Go out.
  2. 2. according to the method for claim 1, it is characterised in that
    After the first message is received, inquiry includes router with the presence or absence of the routing iinformation corresponding with the first message：
    The router judges whether include label in the label stack of the first message after the first message is received；
    If not including label in the label stack of the first message, further determine whether the local related to the first message be present Routing iinformation；
    If in the absence of the local routing information related to the first message, the router is determined in the absence of relative with the first message The routing iinformation answered.
  3. 3. according to the method for claim 2, it is characterised in that
    If including label in the label stack of the first message, the router by the first message by with the first message label heap The corresponding interface of first layer label in stack is forwarded, while the first layer label in the first message label storehouse is ejected.
  4. 4. according to the method for claim 3, it is characterised in that
    If not including label in the label stack of the first message, but the local routing information related to the first message be present, then institute Router is stated to be forwarded the first message using the local routing information related to the first message.
  5. 5. according to the method for claim 4, it is characterised in that
    Local routing information includes route flow table or routing forwarding entry.
  6. 6. a kind of router for being used to realize message forwarding, it is characterised in that obtained including receiving module, enquiry module, label Module and routing module, wherein：
    Receiving module, for receiving the first message；
    Enquiry module, for after receiving module receives the first message, inquiry to whether there is the road corresponding with the first message By information；
    Label acquisition module, in the case of in the absence of the routing iinformation corresponding with the first message, the first message to be turned SDN controllers are sent to, so that SDN controllers are according to the destination address of the first message, are calculated from the router to the mesh Address optimal path, find out each interface label on the optimal path from global interface coding schedule, and according to from The corresponding interface label is pressed into the label stack of the first message to obtain the by the destination address to the order of the router Two messages；
    Routing module, for receive that SND controllers issue in label acquisition module the second message after, the second message is passed through Interface corresponding with the first layer label in the second message label storehouse is forwarded, while by the second message label storehouse First layer label ejects.
  7. 7. router according to claim 6, it is characterised in that
    Enquiry module specifically after the first message is received, judges whether include label in the label stack of the first message, if the Do not include label in the label stack of one message, then further determine whether that the local routing related to the first message be present believes Breath, if in the absence of the local routing information related to the first message, it is determined that believe in the absence of the route corresponding with the first message Breath.
  8. 8. router according to claim 7, it is characterised in that
    Routing module is additionally operable in the case of including label in the label stack of the first message, by the first message by with first The corresponding interface of first layer label in message label storehouse is forwarded, while by the first layer in the first message label storehouse Label ejects.
  9. 9. router according to claim 8, it is characterised in that
    Routing module is additionally operable to not include label in the label stack of the first message but the local related to the first message be present In the case of routing iinformation, the first message is forwarded using the local routing information related to the first message.
  10. 10. router according to claim 9, it is characterised in that
    Local routing information includes route flow table or routing forwarding entry.
  11. 11. a kind of system for being used to realize message forwarding, it is characterised in that including being related to such as any one of claim 6-10 Router, and
    SDN controllers, for after the first message that router reports is received, according to the destination address of the first message, calculating Go out the optimal path from the router to the destination address, and found out from global interface coding schedule on the optimal path Each interface label；From the destination address to the order of the router, the corresponding interface label is pressed into the first message To obtain the second message in label stack, and the second message is handed down to router.
CN201610852364.1A 2016-09-26 2016-09-26 For realizing the methods, devices and systems of message forwarding Pending CN107872388A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610852364.1A CN107872388A (en) 2016-09-26 2016-09-26 For realizing the methods, devices and systems of message forwarding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610852364.1A CN107872388A (en) 2016-09-26 2016-09-26 For realizing the methods, devices and systems of message forwarding

Publications (1)

Publication Number Publication Date
CN107872388A true CN107872388A (en) 2018-04-03

Family

ID=61751189

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610852364.1A Pending CN107872388A (en) 2016-09-26 2016-09-26 For realizing the methods, devices and systems of message forwarding

Country Status (1)

Country Link
CN (1) CN107872388A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111327527A (en) * 2018-12-14 2020-06-23 中国电信股份有限公司 Flow forwarding method and system, SDN controller and computer readable storage medium
CN111713079A (en) * 2018-10-22 2020-09-25 思科技术公司 Packet network interworking including segment routing
CN111901184A (en) * 2019-05-04 2020-11-06 瞻博网络公司 Path monitoring system controller or multiprotocol label switching (PING) and route tracing
CN112118179A (en) * 2020-08-10 2020-12-22 中盈优创资讯科技有限公司 Method and device for creating end-to-end Segmented Routing (SR) path
CN112152924A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Method and related device for forwarding message in data center network
CN114827023A (en) * 2021-01-28 2022-07-29 中国电信股份有限公司 End-to-end service guarantee method and system
CN114915591A (en) * 2021-01-28 2022-08-16 中国电信股份有限公司 End-to-end service guarantee method and system

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1523819A (en) * 2003-02-20 2004-08-25 华为技术有限公司 Method for assigning route in network
CN1750504A (en) * 2004-09-15 2006-03-22 华为技术有限公司 Route repeating method in network
CN101374106A (en) * 2007-08-24 2009-02-25 华为技术有限公司 Method for forwarding data packet on MPLS LSP, network node and system
WO2012055168A1 (en) * 2010-10-27 2012-05-03 Hangzhou H3C Technologies Co., Ltd. Forwarding messages in a fibre channel network
CN104158749A (en) * 2013-05-14 2014-11-19 华为技术有限公司 Message forwarding method in software defined networking, network equipment and software defined networking
CN105490945A (en) * 2014-09-15 2016-04-13 上海贝尔股份有限公司 Method and device for controlling data transmission in control plane
CN105634940A (en) * 2014-10-27 2016-06-01 中兴通讯股份有限公司 SR information acquisition method and route segment network establishment method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1523819A (en) * 2003-02-20 2004-08-25 华为技术有限公司 Method for assigning route in network
CN1750504A (en) * 2004-09-15 2006-03-22 华为技术有限公司 Route repeating method in network
CN101374106A (en) * 2007-08-24 2009-02-25 华为技术有限公司 Method for forwarding data packet on MPLS LSP, network node and system
WO2012055168A1 (en) * 2010-10-27 2012-05-03 Hangzhou H3C Technologies Co., Ltd. Forwarding messages in a fibre channel network
CN104158749A (en) * 2013-05-14 2014-11-19 华为技术有限公司 Message forwarding method in software defined networking, network equipment and software defined networking
CN105490945A (en) * 2014-09-15 2016-04-13 上海贝尔股份有限公司 Method and device for controlling data transmission in control plane
CN105634940A (en) * 2014-10-27 2016-06-01 中兴通讯股份有限公司 SR information acquisition method and route segment network establishment method

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111713079A (en) * 2018-10-22 2020-09-25 思科技术公司 Packet network interworking including segment routing
US11838200B2 (en) 2018-10-22 2023-12-05 Cisco Technology, Inc. Packet network interworking including segment routing
CN111713079B (en) * 2018-10-22 2022-09-27 思科技术公司 Packet network interworking including segment routing
CN111327527B (en) * 2018-12-14 2022-03-18 中国电信股份有限公司 Flow forwarding method and system, SDN controller and computer readable storage medium
CN111327527A (en) * 2018-12-14 2020-06-23 中国电信股份有限公司 Flow forwarding method and system, SDN controller and computer readable storage medium
CN111901184B (en) * 2019-05-04 2023-08-18 瞻博网络公司 Path monitoring System controller or Multi-protocol Label switching PING and route tracking
CN111901184A (en) * 2019-05-04 2020-11-06 瞻博网络公司 Path monitoring system controller or multiprotocol label switching (PING) and route tracing
CN112152924A (en) * 2019-06-29 2020-12-29 华为技术有限公司 Method and related device for forwarding message in data center network
CN112118179A (en) * 2020-08-10 2020-12-22 中盈优创资讯科技有限公司 Method and device for creating end-to-end Segmented Routing (SR) path
CN114827023A (en) * 2021-01-28 2022-07-29 中国电信股份有限公司 End-to-end service guarantee method and system
CN114827023B (en) * 2021-01-28 2023-06-02 中国电信股份有限公司 End-to-end service guarantee method and system
CN114915591B (en) * 2021-01-28 2023-05-02 中国电信股份有限公司 End-to-end service guarantee method and system
CN114915591A (en) * 2021-01-28 2022-08-16 中国电信股份有限公司 End-to-end service guarantee method and system

Similar Documents

Publication Publication Date Title
CN107872388A (en) For realizing the methods, devices and systems of message forwarding
CN104811387B (en) The equal cost multipath explicitly replicated with position index
CN101965715B (en) Tie-Breaking in Shortest Path Determination
CN103379032B (en) The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route
CN103259725B (en) Messaging method and network equipment
CN105099913B (en) A kind of message forwarding method and equipment
CN105594167B (en) Method, controller, forwarding device and the network system to E-Packet
CN103891220B (en) The MPLS using LDP quickly re-routes method and the NE of (LDP-FRR)
CN103346968A (en) Method and apparatus for routing multicast data
CN106559340A (en) The network centered on information with little multipath or single footpath forwarding state
CN102075438B (en) unicast data frame transmission method and device
CN102833329A (en) Distributed storage of routing information in link state protocol controlled network
CN105872008A (en) System and method for on-demand content exchange with adaptive naming in information-centric networks
CN105471747B (en) A kind of intelligent router route selecting method and device
CN109391478A (en) A kind of multicast service control method and device, computer readable storage medium
CN110224935A (en) A kind of method and device handling multicast data message
CN109246018A (en) Message forwarding method, node apparatus and storage medium based on BIER-TE
CN109361596A (en) Route computing method, device and electronic equipment
CN102195844A (en) Method and equipment for managing forwarding table entry
CN106453091B (en) The equivalent route management method and device of router Forwarding plane
US7948917B2 (en) Routing internet communications using network coordinates
CN105407049A (en) Delay tolerance network maximum flow routing method based on time aggregation graph
CN107872383A (en) Notifying method, acquisition methods and the device of parameter
CN107689920A (en) A kind of multi-service end to end route cognitive method automatically
CN111800339A (en) Route optimization method with path number constraint in hybrid SDN scene

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20180403