CN109639600B - Tunnel speed limiting method and device - Google Patents
Tunnel speed limiting method and deviceDownload PDFInfo
- Publication number
- CN109639600B CN109639600BCN201910072837.XACN201910072837ACN109639600BCN 109639600 BCN109639600 BCN 109639600BCN 201910072837 ACN201910072837 ACN 201910072837ACN 109639600 BCN109639600 BCN 109639600B
- Authority
- CN
- China
- Prior art keywords
- tunnel
- node
- lsp
- lsp tunnel
- table entry
- 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
- 238000000034methodMethods0.000titleclaimsabstractdescription36
- 239000003550markerSubstances0.000claims1
- 230000006855networkingEffects0.000abstractdescription8
- 230000000875corresponding effectEffects0.000description40
- 238000004590computer programMethods0.000description12
- 238000004891communicationMethods0.000description9
- 238000010586diagramMethods0.000description7
- 230000006870functionEffects0.000description6
- 230000008520organizationEffects0.000description4
- 230000008569processEffects0.000description4
- 230000009471actionEffects0.000description1
- 238000005516engineering processMethods0.000description1
- 238000012986modificationMethods0.000description1
- 230000004048modificationEffects0.000description1
- 238000003672processing methodMethods0.000description1
- 230000001960triggered effectEffects0.000description1
Images
Classifications
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/825—Involving tunnels, e.g. 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/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/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
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method and an apparatus for limiting a tunnel speed.
Background
Currently, for TE (Traffic Engineering) tunnels, resources can be dynamically allocated when the environment changes, and the Traffic is not interrupted. Since the user cannot initially determine how much bandwidth the service provider is required to provide when using the bandwidth, but is more willing to pay for the bandwidth already used from the user's perspective, the service provider can provide the bandwidth to the user by a dynamic allocation method in order to avoid as much as possible that the bandwidth provided exceeds the user's demand. However, when the service provider dynamically allocates bandwidth resources to the user, bandwidth guarantees are not provided to the user without limitation due to the continuous increase of the user traffic, so that an upper limit of the available bandwidth of the user needs to be set while the user is provided with a dynamically adjusted bandwidth, and the bandwidth provided to the user is guaranteed not to exceed the set upper limit of the bandwidth, so that bandwidth resources are reasonably provided to more other users.
Disclosure of Invention
In view of this, the present disclosure provides a method and an apparatus for limiting a tunnel speed to solve the problem in the prior art that the tunnel speed cannot be limited under the condition of iterative routing.
Specifically, the present disclosure is realized by the following technical solutions:
the present disclosure provides a method for limiting a tunnel speed, which is applied to a routing device of a TE tunnel start node, and the method includes:
acquiring queue number resources distributed to any TE tunnel on the routing equipment based on the speed limit;
searching an appointed LSP tunnel node of the TE tunnel iteration according to a pre-established corresponding relation of the LSP tunnel node of the TE tunnel iteration;
acquiring an output interface table entry corresponding to the specified LSP tunnel node;
and configuring the acquired queue number resource to an output interface table entry corresponding to the specified LSP tunnel node so that the specified LSP tunnel node limits the speed according to the queue number resource configured in the output interface table entry.
Based on the same conception, the invention also provides a device for limiting the speed of the tunnel, which is applied to the routing equipment of the initial node of the TE tunnel, and the device comprises:
a resource obtaining unit, configured to obtain a queue number resource allocated to any TE tunnel on the routing device based on the speed limit;
a node searching unit, which searches the specified LSP tunnel node of the TE tunnel iteration according to the pre-established corresponding relation of the LSP tunnel nodes of the TE tunnel iteration;
a table entry obtaining unit, configured to obtain an egress interface table entry corresponding to the specified LSP tunnel node;
and the resource configuration unit is used for respectively configuring the acquired queue number resources to the output interface table entry corresponding to the specified LSP tunnel node so that the specified LSP tunnel node limits the speed according to the queue number resources configured in the output interface table entry.
Based on the same concept, the present disclosure also provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements any step of the above method for limiting a tunnel speed.
Based on the same concept, the present disclosure also provides a computer device comprising a memory, a processor, a communication interface, and a communication bus; the memory, the processor and the communication interface are communicated with each other through the communication bus;
the memory is used for storing a computer program;
the processor is used for executing the computer program stored in the memory, and any step of the tunnel speed limiting method is realized when the processor executes the computer program.
Therefore, the method can obtain the output interface table entry corresponding to the corresponding designated LSP tunnel node after obtaining the queue number resource of any TE tunnel by pre-establishing the corresponding relation of the LSP tunnel nodes of the TE tunnel iteration, and then respectively issue the queue number resource to the output interface table entry corresponding to the designated LSP tunnel node, so that the designated LSP tunnel node carries out speed limitation according to the queue number resource in the output interface table entry, thereby realizing the effective utilization of bandwidth resources under the TE tunnel in the networking environment of the routing iteration and ensuring the effectiveness of the TM speed limitation function of the flow.
Drawings
Fig. 1 is a schematic diagram illustrating an organization of a non-iterative routing forwarding entry in an exemplary embodiment of the present disclosure;
FIG. 2-1 is a schematic diagram of an iterative routing networking in an exemplary embodiment of the present disclosure;
fig. 2-2 is a schematic view illustrating an iterative routing forwarding entry organization according to an exemplary embodiment of the present disclosure;
FIG. 3 is a process flow diagram of a method of limiting a tunnel speed in an exemplary embodiment of the disclosure;
FIG. 4 is a relationship diagram of a next hop node of an iterative route in an exemplary embodiment of the disclosure;
FIG. 5 is a logical block diagram of an apparatus for speed restriction of a tunnel according to an exemplary embodiment of the present disclosure;
FIG. 6 is a logical block diagram of a computer device in an exemplary embodiment of the present disclosure.
Detailed Description
Please refer to fig. 1, which is a schematic diagram illustrating a non-iterative routing forwarding table entry organization, wherein when an LR (Line Rate, speed limit) is configured below a TE tunnel, the TE applies for a queue number FLOWID resource, and the hardware speed limit of the tunnel is implemented based on the queue, that is, the forwarding traffic Rate entering the queue is limited by the size of the FLOWID resource.
In a specific implementation process, the FLOWID resource is issued to an OUTLIF table (output interface table) of the tunnel of the TE, and various attributes configured based on the output port are recorded in the OUTLIF table. The FIB (Forwarding Information Base) table of the Traffic is directly associated with the OUTLIF table of the TE, and obtains the value of the flow to perform TM (Traffic Management) speed limitation.
However, when an LSP (Label Switched Path) based on LDP (Label Distribution Protocol) iterates to a TE tunnel for packet forwarding, a networking structure is as shown in fig. 2-1, where TE tunnels carried on routing devices RT-1, RT-2, RT-3, RT-4, RT-5, and RT-6 are used for implementing VPN routing by the iterated LSP tunnel. The iterative routing forwarding table entry is shown in fig. 2-2, where the FIB table is directly associated with the OUTLIF table entry of the LSP for forwarding, and the LR cannot cause the TE tunnel of the MPLS to perform corresponding action processing, so that the LSP that actually performs forwarding cannot sense the FLOWID resource applied by the TE tunnel, and therefore the corresponding flag bit in the OUTLIF table of the LSP is invalid, and further cannot acquire queue information for limiting the speed, and therefore cannot meet the requirement of the service provider for setting the upper limit of the user bandwidth.
In order to solve the problems existing in the prior art, the present disclosure provides a method and a device for limiting speed of a tunnel, which can obtain an egress interface table entry corresponding to a specified LSP tunnel node after obtaining a queue number resource of any TE tunnel by creating a corresponding relationship of a TE tunnel iteration LSP tunnel node in advance, and then issue the queue number resource to the egress interface table entry corresponding to the specified LSP tunnel node, so that the specified LSP tunnel node limits speed according to the queue number resource in the egress interface table entry, thereby achieving effective utilization of bandwidth resources under the TE tunnel in a networking environment of route iteration and ensuring validity of a TM speed limit function of traffic.
Referring to fig. 3, a flowchart of a method for limiting a tunnel speed according to an exemplary embodiment of the present disclosure is shown, where the method is applied to a routing device of a TE tunnel start node, for example, an RT-1 device in fig. 2-1. The method comprises the following steps:
301, acquiring a queue number resource configured for any TE tunnel on the routing device based on the speed limit;
in this embodiment, when the LR speed limit is configured on the TE tunnel, the routing device located at the originating node of the TE tunnel may apply for a queue number (FLOWID) resource configured for the TE tunnel based on the LR. Because one routing device TE may carry multiple TE tunnels, the routing device may be triggered to acquire the queue number resource of each TE tunnel carried on the routing device at a limited speed, and because the processing methods of the queue number resource of each TE tunnel are the same, the routing device in this embodiment only takes the acquisition of the queue number resource of any TE tunnel as an example for explanation.
as an embodiment, the routing device may obtain a tag value (e.g., token value) of the TE tunnel through an interface index of the TE tunnel; and then searching the designated LSP tunnel node corresponding to the label value in the LSP tunnel node corresponding relationship of the TE tunnel iteration according to the label value of the TE tunnel.
As an embodiment, when the routing device searches for a next-hop node of an LSP tunnel node, if the next-hop of the LSP tunnel node iterates to the TE tunnel, a correspondence between the TE tunnel and the LSP tunnel node may be created.
Specifically, a hash chain table with the tag value of the TE tunnel as an index may be constructed in advance, so that by constructing a hash chain table with the tag value of the TE tunnel as an index, the tag values of different TE tunnels are used for indexing the hash chain tables of different TE tunnels on the routing device; if the next hop of the LSP tunnel node is iterated to the TE tunnel, searching a hash chain table corresponding to the TE tunnel according to the label value of the TE tunnel; and then, creating a hash node corresponding to the LSP tunnel node in the hash chain table, and establishing a corresponding relation between the TE tunnel and the LSP tunnel node, wherein the corresponding relation comprises a mark value of the LSP tunnel node. The organization relationship between TE tunnels and iterated LSP tunnel nodes is shown in fig. 4, where the left side of the list is a plurality of TE tunnels carried on the routing device, such as TE1, TE2, and TE3 … … TEn, and the right side of the list is a head node of an LSP tunnel iterated by each TE tunnel, for example, when an LSP tunnel node iterated by a TE1 tunnel includes LSP11, LSP12, and LSP13, list entries corresponding to TE1 include LSP11, LSP12, and LSP13, and list entries of other TEs are the same, which is not described herein again.
as an embodiment, the routing device may obtain the label value of the specified LSP tunnel node, and search for an egress interface entry corresponding to the label value of the specified LSP tunnel node according to a correspondence between the label value of the LSP tunnel node and the egress interface entry that is stored in advance.
Andstep 304, respectively issuing the acquired queue number resources to the output interface table entry corresponding to the specified LSP tunnel node, so that the specified LSP tunnel node limits the speed according to the queue number resources in the output interface table entry.
In this embodiment, the routing device may configure the obtained queue number resource to an egress interface table entry corresponding to the specified LSP tunnel node, so that the specified LSP tunnel node performs speed limitation according to the queue number resource in the egress interface table entry, thereby implementing the speed limitation function of all LSPs iterated to the TE tunnel. Therefore, the method and the device can ensure the availability of the TM speed limit function of the traffic under the routing iterative networking.
In the prior art, because the forwarding layer can directly set an interface table according to the information issued by the LDP protocol, the iterated TE cannot sense the LDP information. Meanwhile, one TE tunnel may be iterated by multiple LSPs, and the TE cannot distinguish which LSP is iterated under the current networking environment. The method and the device can enable the LSP tunnel node to acquire the bandwidth resource configuration under the TE tunnel by storing the corresponding relation between the LSP tunnel node and the iterative TE tunnel and send the bandwidth resource configuration to the interface output table of the LSP tunnel node, thereby enabling the LSP to carry out queue speed limitation through the queue number.
Based on the same conception, the disclosure also provides a tunnel speed limiting device, which can be realized by software, or by hardware or a combination of the software and the hardware. Taking software implementation as an example, the tunnel speed limiting device disclosed by the invention is used as a logical device and is formed by reading a corresponding computer program instruction in a memory and then running the computer program instruction through a CPU of the device where the tunnel speed limiting device is located.
Referring to fig. 5, a tunnel speed limiting apparatus 500 according to an exemplary embodiment of the present disclosure is applied to a routing device of a TE tunnel start node, and the apparatus includes:
a resource obtaining unit 501, configured to obtain a queue number resource allocated to any TE tunnel on the routing device based on the speed limit;
a node searching unit 502, which searches for an assigned LSP tunnel node of the TE tunnel iteration according to a pre-created correspondence of LSP tunnel nodes of the TE tunnel iteration;
a table entry obtaining unit 503, configured to obtain an egress interface table entry corresponding to the specified LSP tunnel node;
a resource configuration unit 504, configured to configure the obtained queue number resources to the egress interface table entry corresponding to the specified LSP tunnel node, so that the specified LSP tunnel node performs speed limitation according to the queue number resources in the egress interface table entry.
As an embodiment, the node searching unit 502 is configured to obtain a tag value of the TE tunnel through an interface index of the TE tunnel; and searching the appointed LSP tunnel node of the TE tunnel iteration according to the label value of the TE tunnel in the corresponding relation of the LSP tunnel node of the TE tunnel iteration.
As an embodiment, the apparatus further comprises:
a relationship creating unit 505, configured to create a corresponding relationship between the TE tunnel and the LSP tunnel node if a next hop of the LSP tunnel node iterates to the TE tunnel.
As an embodiment, the relationship creating unit 505 is specifically configured to pre-construct a hash chain table using a tag value of the TE tunnel as an index; and if the next hop of the LSP tunnel node is iterated to the TE tunnel, searching a hash chain table corresponding to the TE tunnel according to the tag value of the TE tunnel, and creating a hash node corresponding to the LSP tunnel node in the hash chain table.
As an embodiment, the entry obtaining unit 503 is configured to obtain a label value of the specified LSP tunnel node; and searching an output interface table entry corresponding to the label value of the specified LSP tunnel node according to the corresponding relation between the label value of the prestored LSP tunnel node and the output interface table entry.
Based on the same concept, the present disclosure also provides a computer apparatus, as shown in fig. 6, including amemory 61, aprocessor 62, acommunication interface 63, and acommunication bus 64; wherein, thememory 61, theprocessor 62 and thecommunication interface 63 communicate with each other through thecommunication bus 64;
thememory 61 is used for storing computer programs;
theprocessor 62 is configured to execute the computer program stored in thememory 61, and when theprocessor 62 executes the computer program, any step of the method for limiting a tunnel speed provided by the embodiment of the present disclosure is implemented.
The present disclosure further provides a computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, any step of the method for limiting a tunnel speed provided by the embodiment of the present disclosure is implemented.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for embodiments of the computer device and the computer-readable storage medium, since they are substantially similar to the method embodiments, the description is relatively simple, and in relation to what is described in the partial description of the method embodiments.
In summary, the present disclosure may create a correspondence relationship between LSP tunnel nodes of a TE tunnel iteration in advance, after obtaining a queue number resource of any TE tunnel, obtain an egress interface table entry corresponding to a specified LSP tunnel node, and then configure the queue number resource to the egress interface table entry corresponding to the specified LSP tunnel node, so that the specified LSP tunnel node performs speed limitation according to the queue number resource in the egress interface table entry, thereby implementing effective utilization of bandwidth resources under the TE tunnel in a networking environment of a routing iteration, and ensuring effectiveness of a TM speed limitation function of traffic.
The implementation process of the functions and actions of each unit in the above device is specifically described in the implementation process of the corresponding step in the above method, and is not described herein again.
For the device embodiment, since it basically corresponds to the method embodiment, reference may be made to the partial description of the method embodiment for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A method for limiting tunnel speed is characterized in that the method is applied to a routing device of a traffic engineering TE tunnel starting node, and the method comprises the following steps:
acquiring queue number resources distributed to any TE tunnel on the routing equipment based on the speed limit;
searching an appointed LSP tunnel node of the TE tunnel iteration according to a pre-established corresponding relation of the LSP tunnel node of the TE tunnel iteration;
acquiring an output interface table entry corresponding to the specified LSP tunnel node;
and configuring the acquired queue number resource to an output interface table entry corresponding to the specified LSP tunnel node so that the specified LSP tunnel node limits the speed according to the queue number resource configured in the output interface table entry.
2. The method according to claim 1, wherein finding the designated LSP tunnel node of the TE tunnel iteration according to the pre-created correspondence of LSP tunnel nodes of the TE tunnel iteration comprises:
acquiring a marking value of the TE tunnel through an interface index of the TE tunnel;
and searching the appointed LSP tunnel node of the TE tunnel iteration according to the label value of the TE tunnel in the corresponding relation of the LSP tunnel node of the TE tunnel iteration.
3. The method of claim 1, further comprising:
and if the next hop of the LSP tunnel node is iterated to the TE tunnel, establishing a corresponding relation between the TE tunnel and the LSP tunnel node.
4. The method of claim 3, wherein creating the correspondence between the TE tunnel and the LSP tunnel node if a next hop of the LSP tunnel node iterates to the TE tunnel comprises:
a Hash chain table taking the mark value of the TE tunnel as an index is constructed in advance;
and if the next hop of the LSP tunnel node is iterated to the TE tunnel, searching a hash chain table corresponding to the TE tunnel according to the tag value of the TE tunnel, and creating a hash node corresponding to the LSP tunnel node in the hash chain table.
5. The method according to claim 1, wherein obtaining an egress interface entry corresponding to the specified LSP tunnel node includes:
acquiring a marking value corresponding to the designated LSP tunnel node;
and searching an output interface table entry corresponding to the mark value of the specified LSP tunnel node according to the corresponding relation between the mark value of the prestored LSP tunnel node and the output interface table entry.
6. A device for limiting speed of a tunnel, wherein the device is applied to a routing device of a TE tunnel start node, and the device comprises:
a resource obtaining unit, configured to obtain a queue number resource allocated to any TE tunnel on the routing device based on the speed limit;
a node searching unit, which searches the appointed LSP tunnel node of the TE tunnel iteration according to the pre-established corresponding relation of the LSP tunnel node of the TE tunnel iteration;
a table entry obtaining unit, configured to obtain an egress interface table entry corresponding to the specified LSP tunnel node;
and the resource configuration unit is used for respectively configuring the acquired queue number resources to the output interface table entry corresponding to the specified LSP tunnel node so that the specified LSP tunnel node limits the speed according to the queue number resources configured in the output interface table entry.
7. The apparatus of claim 6,
the node searching unit is used for acquiring a marking value of the TE tunnel through an interface index of the TE tunnel; and searching the appointed LSP tunnel node of the TE tunnel iteration according to the label value of the TE tunnel in the corresponding relation of the LSP tunnel node of the TE tunnel iteration.
8. The apparatus of claim 6, further comprising:
and the relationship creating unit is used for creating the corresponding relationship between the TE tunnel and the LSP tunnel node if the next hop of the LSP tunnel node iterates to the TE tunnel.
9. The apparatus of claim 8,
the relation creating unit is specifically used for constructing a hash chain table taking the mark value of the TE tunnel as an index in advance; and if the next hop of the LSP tunnel node is iterated to the TE tunnel, searching a hash chain table corresponding to the TE tunnel according to the tag value of the TE tunnel, and creating a hash node corresponding to the LSP tunnel node in the hash chain table.
10. The apparatus of claim 6,
the table entry obtaining unit is configured to obtain a marker value corresponding to the specified LSP tunnel node; and searching an output interface table entry corresponding to the mark value of the specified LSP tunnel node according to the corresponding relation between the mark value of the prestored LSP tunnel node and the output interface table entry.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910072837.XACN109639600B (en) | 2019-01-25 | 2019-01-25 | Tunnel speed limiting method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910072837.XACN109639600B (en) | 2019-01-25 | 2019-01-25 | Tunnel speed limiting method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109639600A CN109639600A (en) | 2019-04-16 |
| CN109639600Btrue CN109639600B (en) | 2022-07-01 |
Family
ID=66063716
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910072837.XAActiveCN109639600B (en) | 2019-01-25 | 2019-01-25 | Tunnel speed limiting method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639600B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117880172B (en)* | 2024-03-12 | 2024-07-30 | 南京邮电大学 | A method to simplify the number of SR nodes based on SHA-256 hash algorithm |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7123587B1 (en)* | 2000-11-22 | 2006-10-17 | Nortel Networks Limited | System, device and method for limiting tunnel traffic in an information communication network |
| CN102136957A (en)* | 2010-01-25 | 2011-07-27 | 华为技术有限公司 | Label switched path monitoring realization method, device and system |
| CN103841022A (en)* | 2014-03-12 | 2014-06-04 | 华为技术有限公司 | Method and device for building tunnel |
| CN104980347A (en)* | 2014-04-04 | 2015-10-14 | 华为技术有限公司 | Tunnel establishing method and tunnel establishing device |
| CN107306222A (en)* | 2016-04-25 | 2017-10-31 | 华为技术有限公司 | The method and apparatus that traffic engineering tunnel on label switched path is set up |
| CN107483338A (en)* | 2016-06-08 | 2017-12-15 | 华为技术有限公司 | A method, device and system for determining cross-domain label switching path tunnels |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7995461B2 (en)* | 2005-08-24 | 2011-08-09 | Cisco Technology, Inc. | Efficient constrained shortest path first optimization technique |
- 2019
- 2019-01-25CNCN201910072837.XApatent/CN109639600B/enactiveActive
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7123587B1 (en)* | 2000-11-22 | 2006-10-17 | Nortel Networks Limited | System, device and method for limiting tunnel traffic in an information communication network |
| CN102136957A (en)* | 2010-01-25 | 2011-07-27 | 华为技术有限公司 | Label switched path monitoring realization method, device and system |
| CN103841022A (en)* | 2014-03-12 | 2014-06-04 | 华为技术有限公司 | Method and device for building tunnel |
| CN104980347A (en)* | 2014-04-04 | 2015-10-14 | 华为技术有限公司 | Tunnel establishing method and tunnel establishing device |
| CN107306222A (en)* | 2016-04-25 | 2017-10-31 | 华为技术有限公司 | The method and apparatus that traffic engineering tunnel on label switched path is set up |
| CN107483338A (en)* | 2016-06-08 | 2017-12-15 | 华为技术有限公司 | A method, device and system for determining cross-domain label switching path tunnels |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109639600A (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Secondnet: a data center network virtualization architecture with bandwidth guarantees | |
| CN105706044B (en) | Rank-based job retention scheduler | |
| US9009319B2 (en) | Optimizing allocation of on-demand resources using performance | |
| US8856386B2 (en) | Cloud resource placement using placement pivot in physical topology | |
| EP3499812A1 (en) | Multi-threaded route processing | |
| CN108401492B (en) | A mixed resource-based routing method, device and server | |
| WO2018036172A1 (en) | Service scheduling method and device, and service issuing method and device | |
| CN104885421A (en) | Apparatus for a high performance and highly available multi-controllers in a single SDN/OpenFlow network | |
| CN109450793B (en) | Method and device for scheduling service traffic | |
| CN114157600A (en) | Method, equipment and system for forwarding message | |
| Kodialam et al. | Online multicast routing with bandwidth guarantees: a new approach using multicast network flow | |
| CN110611616A (en) | Traffic scheduling method, system, device and medium based on Radius server | |
| US11909632B2 (en) | Distributed label assignment for labeled routing protocol routes | |
| CN111654438A (en) | A method, controller and system for establishing a forwarding path in a network | |
| WO2022166465A1 (en) | Message processing method and related apparatus | |
| US7649904B1 (en) | Seamless split-horizon flooding of layer two (L2) network traffic on non-native and mixed architectures | |
| WO2017088495A1 (en) | Method and apparatus for acquiring routing information | |
| WO2021179718A1 (en) | Message transmission method and apparatus, and network device | |
| CN109672621B (en) | Method and equipment for selecting transmission path for VPN service | |
| US10230621B2 (en) | Varying a per-hop-bandwidth constraint in multi-path label switched paths | |
| Lin et al. | Hierarchical CORD for NFV datacenters: resource allocation with cost-latency tradeoff | |
| CN111654559B (en) | Container data transmission method and device | |
| CN109639600B (en) | Tunnel speed limiting method and device | |
| Masti et al. | Vna: An enhanced algorithm for virtual network embedding | |
| Cattelan et al. | Iterative design space exploration for networks requiring performance guarantees |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right | Effective date of registration:20230625 Address after:310052 11th Floor, 466 Changhe Road, Binjiang District, Hangzhou City, Zhejiang Province Patentee after:H3C INFORMATION TECHNOLOGY Co.,Ltd. Address before:310052 Changhe Road, Binjiang District, Hangzhou, Zhejiang Province, No. 466 Patentee before:NEW H3C TECHNOLOGIES Co.,Ltd. |