CN111211978B - Method and device for distributing expanded segment routing labels - Google Patents
Method and device for distributing expanded segment routing labels Download PDFInfo
- Publication number
- CN111211978B CN111211978B CN201811388913.XA CN201811388913A CN111211978B CN 111211978 B CN111211978 B CN 111211978B CN 201811388913 A CN201811388913 A CN 201811388913A CN 111211978 B CN111211978 B CN 111211978B
- Authority
- CN
- China
- Prior art keywords
- link
- byte
- segment routing
- tag
- parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/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/12—Shortest path evaluation
-
- 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/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- 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/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- 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/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a method and a device for distributing extended segment routing labels, and relates to the field of data communication. The distribution method comprises the following steps: acquiring link network state parameters; and setting the link network state parameters at preset identification bits in the segment routing labels so that the controller calculates the optimal path according to the link network state parameters in the segment routing labels. According to the method and the device, the link network state parameters are set at the preset identification position in the segment routing label, the segment routing label is no longer only used as a routing forwarding identification, and the network controller can acquire the link network state parameters when acquiring the segment routing label, so that the optimal path can be calculated more conveniently.
Description
Technical Field
The present disclosure relates to the field of data communications, and in particular, to a method and an apparatus for allocating extended segment routing labels.
Background
Segment Routing (Segment Routing) refers to forwarding of a data packet based on MPLS (Multi-Protocol Label Switching), Segment labels are distributed through IGP (Interior Gateway Protocol) protocols, a Label stack is arranged on a packet header according to needs, and a network controller is combined to select a route as required.
The segment route label is only identified as a route forwarding in the standard. The network controller needs to collect other information to calculate the optimal path while collecting the segment routing identifiers.
Disclosure of Invention
The technical problem to be solved by the present disclosure is to provide an extended segment routing label allocation method and apparatus, which can enable a network controller to more conveniently obtain link network state parameters when obtaining a segment routing label, thereby quickly calculating an optimal path.
According to an aspect of the present disclosure, a method for allocating an extended segment routing label is provided, including: acquiring link network state parameters; and setting the link network state parameters at preset identification bits in the segment routing labels so that the controller calculates the optimal path according to the link network state parameters in the segment routing labels.
Optionally, the link network state parameter includes a link quality of service parameter and a link bandwidth parameter; the segment routing label is an adjacency label.
Optionally, the adjacency label comprises four bytes; writing the link service quality parameter into a third byte of the adjacent label, and writing the link bandwidth parameter into a fourth byte of the adjacent label; wherein the first byte and the second byte of the adjacent tag are written with tag values of the adjacent tag.
Optionally, the link quality of service parameter includes delay information; the link bandwidth parameters include link bandwidth and bandwidth utilization.
Optionally, writing the link bandwidth to a first bit of a fourth byte of the adjacency label; the bandwidth utilization is written into the last seven bits of the fourth byte of the adjacent tag.
According to another aspect of the present disclosure, there is also provided an apparatus for distributing an extended segment routing label, including: a parameter obtaining unit, configured to obtain a link network state parameter; and the parameter writing unit is used for setting the link network state parameters in the preset identification bits in the segment routing tags, so that the controller can calculate the optimal path according to the link network state parameters in the segment routing tags.
Optionally, the link network state parameter includes a link quality of service parameter and a link bandwidth parameter; the segment routing label is an adjacency label.
Optionally, the adjacency label includes four bytes; the parameter writing unit is used for writing the link service quality parameter into the third byte of the adjacent label and writing the link bandwidth parameter into the fourth byte of the adjacent label; wherein the first byte and the second byte of the adjacent tag are written with tag values of the adjacent tag.
Optionally, the link quality of service parameter includes delay information; the link bandwidth parameters include link bandwidth and bandwidth utilization.
Optionally, the parameter writing unit is configured to write the link bandwidth into a first bit of a fourth byte of the adjacent tag, and write the bandwidth utilization into the last seven bits of the fourth byte of the adjacent tag.
According to another aspect of the present disclosure, there is also provided an apparatus for allocating an extended segment routing label, including: a memory; and a processor coupled to the memory, the processor configured to perform the extended segment routing tag assignment method as described above based on instructions stored in the memory.
According to another aspect of the present disclosure, a computer-readable storage medium is also proposed, on which computer program instructions are stored, which instructions, when executed by a processor, implement the steps of the above-mentioned method for allocating extended segment routing labels.
Compared with the prior art, the link network state parameter is set at the preset identification position in the segment routing label, the segment routing label is no longer only used as a routing forwarding identification, and the network controller can acquire the link network state parameter when acquiring the segment routing label, so that the optimal path can be calculated more conveniently.
Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.
The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:
fig. 1 is a flowchart illustrating an embodiment of a method for assigning segment routing labels according to an extension of the present disclosure.
Fig. 2 is a schematic flow chart of another embodiment of a method for assigning segment routing labels according to an extension of the present disclosure.
Fig. 3 is a schematic diagram of a segment routing label extended by the present disclosure.
Fig. 4 is a schematic diagram of determining a forwarding path according to a segment routing label according to the present disclosure.
Fig. 5 is a schematic structural diagram of an embodiment of a distribution device of a segment routing label extended by the present disclosure.
Fig. 6 is a schematic structural diagram of a distribution device of segment routing labels according to still another embodiment of the present disclosure.
Fig. 7 is a schematic structural diagram of a distribution device of segment routing labels according to another embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
Fig. 1 is a flowchart illustrating an embodiment of a method for assigning segment routing labels according to an extension of the present disclosure.
At step 110, link network state parameters are obtained. The link network state parameters include a link quality of service parameter and a link bandwidth parameter. The link service quality parameters comprise time delay information, and the link bandwidth parameters comprise link bandwidth, bandwidth utilization rate and the like.
At step 120, the link network state parameter is set at a predetermined identification bit in the segment routing label so that the controller calculates the optimal path according to the link network state parameter in the segment routing label.
The segment routing tag is a 32-bit identifier, and realizes topology suggestion or service suggestion. In one embodiment, several bits are reserved in the segment routing label as flag bits of link delay, bandwidth usage and the like. The segment routing label includes a Node label (Node segment) and an Adjacency label (Adjacency segment). The adjacency label is assigned by the local router, and in this embodiment, the segment routing label is the adjacency label.
The network controller can collect the segment routing labels, and plan a path for the specified flow by planning the segment routing label stack, in this embodiment, the link network state parameter is set at a predetermined identification position in the segment routing label, the segment routing label is no longer only used as a route forwarding identification, and the network controller can obtain the link network state parameter when obtaining the segment routing label, so that the optimal path can be calculated more conveniently.
Fig. 2 is a schematic flow chart of another embodiment of a method for assigning segment routing labels according to an extension of the present disclosure.
At step 210, the segment router assigns an adjacency label for the link.
At step 220, link quality of service parameters are obtained. The link delay information is obtained, for example, based on ping.
At step 230, link bandwidth parameters are obtained.
At step 240, an extended adjacency label is generated in conjunction with the 16-bit locally unique label value. For example, the first byte and the second byte of the adjacent tag are written with the tag value of the adjacent tag, the link quality of service parameter is written in the third byte of the adjacent tag, and the link bandwidth parameter is written in the fourth byte of the adjacent tag. For example, the link bandwidth is written to the first bit of the fourth byte of the adjacency label; the bandwidth utilization is written into the last seven bits of the fourth byte of the adjacent tag.
As shown in fig. 3, the first 2 bits of 8bits are filled with a locally unique tag value. The 3 rd 8bits is filled with a delay identification bit, for example, if the delay obtained by the test is 65ms, the bit is 01000001, and if the delay is greater than or equal to 255ms, the bit is 11111111. The highest bit 0 of the 4 th 8bits represents a 10G link, and 1 represents a 100G link; the last 7 bits represent bandwidth utilization, for example, the link bandwidth is 10G, the average bandwidth utilization in the previous hour is 80%, and the bits are 01010000.
After the segment routing router writes the link quality of service parameter and the link bandwidth parameter into the predetermined identification bit of the adjacent label, as shown in fig. 4, the network controller can more conveniently acquire the network running state and select the optimal route for the application.
The routing requirement for the data packets is from R1 to R6, with the head node R1 requesting an appropriate path from the network controller, e.g., the network controller selecting a path with the shortest latency, or a path that is the most idle, or a path with the lowest cost. After the network controller acquires the segment routing labels, the information of time delay, occupancy rate, cost and the like of each circuit in the network is acquired, so that an optimal path can be calculated. And then based on a packet header label stack mode, marking a label stack on the first node, and forwarding the first node according to the label.
Wherein 204, 405, 506, etc. all belong to contiguous tags. The head node R1 determines the packet path as R1, R2, R4, R5, and R6 according to the optimal path result, and marks [ 204, 405, 506 ] a label stack in R1. For forwarding nodes R2, R4, and R5, pop up the top label of the stack, and select an egress link according to the label for forwarding, for example, forwarding a packet to forwarding node R4 at forwarding node R2 according to the top label 204, and delete the label 204, and forwarding nodes R4 and R5 sequentially perform forwarding. And the tail node R6 forwards the message according to the normal flow of the common message.
In the embodiment, by expanding the segment routing label, a plurality of bits are reserved in the segment routing label, and when the segment routing label is acquired as a zone bit such as link delay, bandwidth use condition and the like, the network controller can acquire relationship information such as link quality, interface utilization rate and the like, so that the network controller can calculate an optimal path more conveniently, the development of a lightweight network controller is promoted, the popularization and application of a source routing function are promoted, and the rapid deployment of an SDN can be promoted.
Fig. 5 is a schematic structural diagram of an embodiment of a distribution device of a segment routing label extended by the present disclosure. The distribution means is, for example, a segment router and includes a parameter acquisition unit 510 and a parameter writing unit 520.
The parameter obtaining unit 510 is configured to obtain a link network status parameter. The link network state parameters include a link quality of service parameter and a link bandwidth parameter. The link quality of service parameter includes delay information, e.g., link delay information based on ping. The link bandwidth parameters include link bandwidth, bandwidth utilization, and the like.
The parameter writing unit 520 is configured to set the link network state parameter in a predetermined flag in the segment routing tag, so that the controller calculates an optimal path according to the link network state parameter in the segment routing tag.
In one embodiment, the segment routing label is an adjacency label. The first byte and the second byte of the adjacent label are written with label values of the adjacent label, the link service quality parameter is written into the third byte of the adjacent label, and the link bandwidth parameter is written into the fourth byte of the adjacent label. For example, the link bandwidth is written to the first bit of the fourth byte of the adjacency label; the bandwidth utilization is written into the last seven bits of the fourth byte of the adjacent tag.
In this embodiment, the link network state parameter is set at a predetermined identification bit in the segment routing label, the segment routing label is no longer only used as a routing forwarding identification, and the network controller can obtain the link network state parameter when obtaining the segment routing label, so that the optimal path can be calculated more conveniently.
Fig. 6 is a schematic structural diagram of a distribution device of segment routing labels according to still another embodiment of the present disclosure. The apparatus includes a memory 610 and a processor 620. Wherein: the memory 610 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory 610 is used to store instructions in the embodiments corresponding to fig. 1-3. Processor 620 is coupled to memory 610 and may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 620 is configured to execute instructions stored in the memory.
In one embodiment, the apparatus 700 may also include a memory 710 and a processor 720, as shown in FIG. 7. Processor 720 is coupled to memory 710 by BUS 730. The apparatus 700 may be further connected to an external storage device 750 through a storage interface 740 for accessing external data, and may be further connected to a network or another computer system (not shown) through a network interface 760, which will not be described in detail herein.
In the embodiment, the data instruction is stored in the memory, and the instruction is processed by the processor, so that the device sets the link network state parameter at a predetermined identification position in the segment routing label, the segment routing label is no longer only used as a route forwarding identification, and the network controller can acquire the link network state parameter when acquiring the segment routing label, thereby being capable of calculating the optimal path more conveniently.
In another embodiment of the disclosure, a set top box is also protected, and the set top box comprises the video stuck failure analysis device.
In another embodiment, a computer-readable storage medium has stored thereon computer program instructions which, when executed by a processor, implement the steps of the method in the corresponding embodiment of fig. 1-3. As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Thus far, the present disclosure has been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the foregoing examples are for purposes of illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (10)
1. A method of assigning extended segment routing labels, comprising:
acquiring link network state parameters, wherein the link network state parameters comprise link service quality parameters and link bandwidth parameters;
and setting the link network state parameters at preset identification bits in the adjacent tags so that the controller calculates the optimal path according to the link network state parameters in the adjacent tags.
2. The assignment method of claim 1, wherein the adjacency label includes four bytes;
writing the link quality of service parameter into a third byte of the adjacency label and writing the link bandwidth parameter into a fourth byte of the adjacency label; wherein the first byte and the second byte of the adjacent tag are written with tag values of the adjacent tag.
3. The allocation method according to claim 2,
the link quality of service parameter comprises time delay information;
the link bandwidth parameters include link bandwidth and bandwidth utilization.
4. The distribution method according to claim 3,
writing the link bandwidth to a first bit of a fourth byte of the adjacency tag;
writing the bandwidth utilization into the last seven bits of the fourth byte of the adjacent tag.
5. An apparatus for distributing extended segment routing labels, comprising:
a parameter obtaining unit, configured to obtain link network state parameters, where the link network state parameters include a link quality of service parameter and a link bandwidth parameter;
and the parameter writing unit is used for setting the link network state parameters in the preset identification bits in the adjacent label so that the controller can calculate the optimal path according to the link network state parameters in the adjacent label.
6. The dispensing device of claim 5, wherein the contiguous tag comprises four bytes;
the parameter writing unit is configured to write the link quality of service parameter into a third byte of the adjacent tag, and write the link bandwidth parameter into a fourth byte of the adjacent tag; wherein the first byte and the second byte of the adjacency tag are written with tag values of the adjacency tag.
7. The dispensing device of claim 6,
the link quality of service parameter comprises time delay information;
the link bandwidth parameters include link bandwidth and bandwidth utilization.
8. The dispensing device of claim 7,
the parameter writing unit is configured to write the link bandwidth into a first bit of a fourth byte of the adjacent tag, and write the bandwidth utilization into the last seven bits of the fourth byte of the adjacent tag.
9. An apparatus for distributing extended segment routing labels, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of assigning extended segment routing tags of any of claims 1 to 4 based on instructions stored in the memory.
10. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, carry out the steps of the method of distributing extended segment routing tags of any of claims 1 to 4.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811388913.XA CN111211978B (en) | 2018-11-21 | 2018-11-21 | Method and device for distributing expanded segment routing labels |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201811388913.XA CN111211978B (en) | 2018-11-21 | 2018-11-21 | Method and device for distributing expanded segment routing labels |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111211978A CN111211978A (en) | 2020-05-29 |
CN111211978B true CN111211978B (en) | 2022-05-24 |
Family
ID=70787826
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201811388913.XA Active CN111211978B (en) | 2018-11-21 | 2018-11-21 | Method and device for distributing expanded segment routing labels |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111211978B (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106487537A (en) * | 2015-08-25 | 2017-03-08 | 中国电信股份有限公司 | Business chain implementation method and policy control platform |
WO2017198319A1 (en) * | 2016-05-20 | 2017-11-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for segment routing and rsvp-te routing in transport sdn networks |
CN108206780A (en) * | 2016-12-19 | 2018-06-26 | 中国电信股份有限公司 | Flow scheduling strategy report method, autonomy field system and SDN network system |
CN108234312A (en) * | 2016-12-15 | 2018-06-29 | 中国电信股份有限公司 | A kind of traffic scheduling method, PCE and SDN network system |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9537718B2 (en) * | 2013-03-15 | 2017-01-03 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
-
2018
- 2018-11-21 CN CN201811388913.XA patent/CN111211978B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106487537A (en) * | 2015-08-25 | 2017-03-08 | 中国电信股份有限公司 | Business chain implementation method and policy control platform |
WO2017198319A1 (en) * | 2016-05-20 | 2017-11-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and apparatus for segment routing and rsvp-te routing in transport sdn networks |
CN108234312A (en) * | 2016-12-15 | 2018-06-29 | 中国电信股份有限公司 | A kind of traffic scheduling method, PCE and SDN network system |
CN108206780A (en) * | 2016-12-19 | 2018-06-26 | 中国电信股份有限公司 | Flow scheduling strategy report method, autonomy field system and SDN network system |
Non-Patent Citations (2)
Title |
---|
draft-ietf-idr-bgp-ls-segment-routing-ext-04;Stefano Previdi等;《IETF》;20180729;第2节-第4节 * |
draft-li-spring-bw-guaranteed-sr-00;Zhenbin Li等;《IFTF》;20150910;第1节-第6节 * |
Also Published As
Publication number | Publication date |
---|---|
CN111211978A (en) | 2020-05-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107566272B (en) | Forwarding table establishing method and data forwarding method | |
US11909633B2 (en) | Packet processing method, device, and system | |
CN108737269B (en) | Encapsulation method, device and node | |
CN109962850B (en) | Method and controller for implementing segment routing and computer readable storage medium | |
CN109194581B (en) | Message processing method and device | |
US10200204B2 (en) | Link state information advertisement method and device | |
CN103312611B (en) | Message processing method, device label processing method and equipment | |
CN108111432A (en) | Message forwarding method and device | |
EP3253012B1 (en) | Method and apparatus for obtaining port path | |
US20230127464A1 (en) | Packet forwarding method, apparatus and system, network device and storage medium | |
CN110224934A (en) | A kind of method and device carrying out Message processing using unified SR label stack | |
CN102123091A (en) | Method, device and network equipment for generating multilink transparent transmission interconnection forwarding table | |
CN112187648B (en) | Multicast message forwarding method and device | |
WO2017141676A1 (en) | Relay device | |
CN114205282B (en) | SRv6 Policy scheduling method, system, router and controller | |
CN106713130B (en) | A kind of routing table update method, EVPN control equipment and EVPN system | |
CN114221904B (en) | Message forwarding method, device and system | |
CN113630316B (en) | Data transmission method and communication device | |
CN112769738A (en) | DetNet data packet processing method and device | |
CN111211978B (en) | Method and device for distributing expanded segment routing labels | |
CN107086960B (en) | Message transmission method and device | |
CN111181848B (en) | Network fragmentation method, system, router and storage medium | |
CN115242892B (en) | Stream identifier acquisition method, device, equipment and medium | |
CN106921574A (en) | Simple level label switched path | |
CN112558504B (en) | Method, device and system for forwarding critical path information based on OSPF protocol |
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 |