CN107888490B - Message forwarding method, routing delay calculation and scheduling device and system - Google Patents
Message forwarding method, routing delay calculation and scheduling device and system Download PDFInfo
- Publication number
- CN107888490B CN107888490B CN201610868133.XA CN201610868133A CN107888490B CN 107888490 B CN107888490 B CN 107888490B CN 201610868133 A CN201610868133 A CN 201610868133A CN 107888490 B CN107888490 B CN 107888490B
- Authority
- CN
- China
- Prior art keywords
- route
- time delay
- equivalent
- node
- forwarding
- 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/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/124—Shortest path evaluation using a combination of 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/22—Alternate routing
-
- 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/302—Route determination based on requested QoS
-
- 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/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message forwarding method, a routing delay calculation and scheduling device and a system, which relate to the technical field of communication, wherein the method comprises the following steps: establishing equivalent routes with the same cost of a plurality of paths between the starting node and the destination node; calculating time delay on a plurality of equivalent routes; and selecting a forwarding route for the message from a plurality of equivalent routes based on the time delay. According to the message forwarding method, the route delay calculation and scheduling device and the network system, the forwarding route is selected from a plurality of equivalent routes based on the delay, the shortest delay path can be found on the basis of the multi-path redundancy technology, the service quality can be distinguished, and differentiated services are provided; the method can guide the low-delay service flow to the lowest delay path, thereby more effectively utilizing resources in an ISP operator network, realizing larger benefits and meeting the low-delay requirements of users.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a packet forwarding method, a routing delay calculation and scheduling apparatus and a system.
Background
In the current large-scale operator ISP network, there are many lines for interconnection between devices, path planning is performed according to the metric values of the routes, and a multi-directional route redundancy design is adopted in the network, resulting in a large number of equivalent routes in the network. AS shown in fig. 1, 3 equivalent routes are established in an AS, one equivalent route can be selected from the 3 equivalent routes to forward a packet sent by a node a to a node B, and traffic flow from the node a to the node B is load-shared to different equivalent routes by using a Hash algorithm.
However, in the current network, a route is planned only according to a Metric value of the route, a large number of equivalent routes are generated by adopting a multi-direction redundancy design principle, the equivalent routes cannot distinguish and forward the services of the message, and the traffic flow in the same direction is scheduled on the equivalent routes by adopting a Hash algorithm, and the algorithm has the uncontrollable characteristic when the Hash algorithm is used for load sharing, namely certain services cannot be artificially assigned to a specific equivalent route, so that low-delay services cannot be distinguished and the quality is guaranteed, the requirement of low-delay service transmission of certain customers cannot be met, and the network resources of an operator cannot be fully utilized.
Disclosure of Invention
In view of this, a technical problem to be solved by the present invention is to provide a message forwarding method, a routing delay calculation and scheduling apparatus and system.
According to an aspect of the present invention, a method for forwarding a packet is provided, including: establishing equivalent routes with the same cost of a plurality of paths between the starting node and the destination node; calculating time delay on a plurality of equivalent routes; and selecting a forwarding route for the message from a plurality of equivalent routes based on the time delay.
Optionally, selecting a forwarding route for the packet from the multiple equivalent routes based on the time delay includes: and determining the forwarding route corresponding to the service quality grade from the equivalent routes according to the service quality grade and based on the time delay.
Optionally, a forwarding route with the minimum time delay is selected from the multiple equivalent routes as a high-quality forwarding route, and the starting node is notified; and when the initial node judges that the service quality grade of the message is a high quality grade, forwarding the message through the high quality forwarding route.
Optionally, sending an RSVP-TE tunnel establishment instruction to the originating node, so that the originating node establishes an RSVP-TE tunnel through the high-quality forwarding route; and the starting node sends the message with high quality grade through the RSVP-TE tunnel.
Optionally, when it is determined that the time delay on the equivalent route exceeds a preset time delay threshold, sending a notification message to the starting node, and notifying the starting node to set the equivalent route to a fault state; and when the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, sending a notification message to the starting node to notify the starting node to set the equivalent route to be in the normal state.
Optionally, the calculating the time delay on the plurality of equivalent routes includes: receiving time delay information sent by a routing node in the whole network after a link time delay test is carried out; and calculating the time delay of each equivalent route according to the topology of the equivalent routes and the time delay information.
Optionally, the routing node encapsulates the delay information in an object identifier OID of a simple network management protocol SNMP and sends the encapsulated delay information.
Optionally, collecting network topology information and link state information; performing off-line calculation based on an SPF algorithm to obtain the plurality of equivalent routes; and sending a message carrying the equivalent routing information to the starting node.
According to another aspect of the present invention, there is provided a routing delay calculating and scheduling apparatus, including: the time delay calculation module is used for calculating time delays on a plurality of equivalent routes between the starting node and the destination node; and the route scheduling module is used for selecting a forwarding route for the message from the plurality of equivalent routes based on the time delay.
Optionally, the route scheduling module is further configured to determine, according to a quality of service class and based on the time delay, the forwarding route corresponding to the quality of service class from the multiple equivalent routes.
Optionally, the route scheduling module is further configured to select a forwarding route with the smallest delay from the multiple equivalent routes as a high-quality forwarding route, and notify the starting node; and when the initial node judges that the service quality grade of the message is a high quality grade, forwarding the message through the high quality forwarding route.
Optionally, the route scheduling module is further configured to send an RSVP-TE tunnel establishment instruction to the originating node, so that the originating node establishes an RSVP-TE tunnel through the high-quality forwarding route; and the starting node sends the high-quality level message through the RSVP-TE tunnel.
Optionally, the route scheduling module is configured to send a notification message to the starting node when it is determined that the time delay on the equivalent route exceeds a preset time delay threshold, and notify the starting node to set the equivalent route to a failure state; and when the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, sending a notification message to the starting node to notify the starting node to set the equivalent route to be in the normal state.
Optionally, the delay calculating module is further configured to receive delay information sent by a routing node in the whole network after performing a link delay test; calculating the time delay of each equivalent route according to the topology of the equivalent routes and the time delay information; and the routing node encapsulates the time delay information in an object identifier OID of a Simple Network Management Protocol (SNMP) and sends the time delay information.
Optionally, the topology management module is configured to collect network topology information and link state information; the path calculation module is used for performing off-line calculation based on an SPF algorithm to obtain the equivalent routes; and the route sending module is used for sending the message carrying the equivalent route information to the initial node.
According to another aspect of the present invention, there is provided a network system, including the routing delay calculating and scheduling apparatus as described above.
According to the message forwarding method, the route delay calculation and scheduling device and the network system, the forwarding route is selected from a plurality of equivalent routes based on the delay, the shortest delay path can be found on the basis of the multi-path redundancy technology, the service quality can be distinguished, and differentiated services are provided; the method can guide the low-delay service flow to the lowest delay path, thereby more effectively utilizing resources in an ISP operator network, realizing larger benefits and meeting the low-delay requirements of users.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic diagram of forwarding a packet through an equivalent route in the prior art;
fig. 2 is a flowchart illustrating an embodiment of a message forwarding method according to the present invention;
fig. 3 is a schematic diagram of message forwarding through an equivalent route in an embodiment of the message forwarding method according to the present invention;
fig. 4 is a block diagram illustrating an embodiment of a routing delay calculating and scheduling apparatus according to the present invention.
Detailed Description
The present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments of the invention are shown. The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. The technical solution of the present invention is described in various aspects below with reference to various figures and embodiments.
Fig. 2 is a flowchart illustrating an embodiment of a packet forwarding method according to the present invention, as shown in fig. 2:
The path cost may include a variety of metric values including the number of routing nodes in the route, bandwidth, etc. To avoid interruption and adverse effects on the customer's traffic due to link outages, Equal Cost Multi Path (ECMP) routing techniques may be employed. The multiple paths which are to the same destination address and have the same path cost form an equivalent path, and when the message to the destination address is forwarded, load sharing can be realized among the next hop paths. After the link of one equivalent path is interrupted, the flow can be immediately forwarded through other equivalent paths, so that the influence of the interruption of the link is minimized.
In the message forwarding method in the embodiment, the forwarding route is selected from the multiple equivalent routes based on the time delay, the shortest time delay path can be found on the basis of the multi-path redundancy technology to guide service forwarding, the service quality can be distinguished, differentiated services are provided, and the requirement of low time delay quality is met.
In one embodiment, a forwarding route corresponding to a quality of service level is determined from a plurality of equivalent routes based on the quality of service level and based on latency. For example, 3 quality of service classes are set, A, B, C from high to low. There are 3 equivalent routes, which are F, G, I in order from small to large according to time delay. Setting the corresponding relation between A and F, B and G and between C and D, sending the corresponding relation to the initial node, distinguishing the service quality in the message forwarding, and providing the routes with different delay quality for forwarding. For example, when the initial node determines that the quality level of the packet is a, the initial node performs routing forwarding through F.
For example, a forwarding route with the minimum delay is selected from the multiple equivalent routes as a high-quality forwarding route, and the starting node is notified. And when the initial node judges that the service quality grade of the message is a high quality grade, the message is forwarded through a high quality forwarding route. As shown in fig. 3, a routing delay calculation and scheduling apparatus may be added at the edge of the network, including a server, a database, and the like, and is used to collect network delay data, plan a lowest delay path based on an equivalent route, and notify the lowest delay path to an initial node, so as to ensure the quality of the low-delay service and meet the quality requirement of the low-delay service.
The route delay calculating and scheduling device sends an instruction for establishing an RSVP-TE (Resource reservation protocol-Traffic Engineering, based on Traffic Engineering extension) tunnel to the starting node, so that the starting node establishes an RSVP-TE tunnel passing through a high-quality forwarding route. And the starting node sends the message with high quality grade through the RSVP-TE tunnel. And the route delay calculation and scheduling device collects the route topology and the delay of the whole network, calculates the lowest delay equivalent path in the equivalent paths, and sends an RSVP Tunnel creation instruction.
For example, the extension of RSVP signaling (request comment document RFC3209) is used to establish a TE tunnel (RSVP-TE or MP L S-TE) in the MP L S forwarding domain, where the TE tunnel is unidirectional and the label switched path L SP path is also unidirectional, as shown in fig. 3, 3 equivalent paths, i.e., equivalent routes, are established in advance based on a metric value, where the 3 equivalent paths are indicated by dotted lines, the sum of the delays of all routing nodes in the 3 equivalent routes is calculated, L in fig. 3 represents a delay value, M represents a metric value, and the metric value includes a bandwidth value, a cost, and the like.
The method comprises the steps of selecting a forwarding route with the minimum time delay from 3 equivalent routes, namely selecting the uppermost equivalent route in the figure 3 as the lowest time delay route, wherein the lowest time delay route is a high-quality forwarding route, informing an initial node, sending an establishment instruction for establishing an RSVP-TE tunnel passing through the high-quality forwarding route to the initial node, wherein the establishment instruction can be an instruction of an internal protocol or an RSVP Path message and the like.
When the time delay on the equivalent route is judged to exceed a preset time delay threshold value, a notification message is sent to the initial node, the initial node is notified to set the equivalent route to be in a fault state, data is sent through the equivalent route temporarily, and the time delay threshold value can be 30 seconds and the like. And when the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, sending a notification message to the initial node, notifying the initial node to set the equivalent route to be in the normal state, and recovering message forwarding.
Receiving time delay information sent by route nodes in the whole network after link time delay test, determining all nodes on a plurality of equivalent routes according to the topology of the equivalent routes, and calculating the time delay on each equivalent route according to the time delay information of all nodes on each equivalent route. And the routing node encapsulates the time delay information in an object identifier OID of a simple network management protocol SNMP and transmits the time delay information.
For example, the routing delay calculation and scheduling apparatus collects the routing topology of the whole network, and the router device performs a link delay test and encapsulates data in the SNMP OID. The routing delay calculation and scheduling device collects delay test data of the router equipment of the whole network, calculates the lowest delay path by combining the topology of the whole network, sends an RSVP Tunnel creation instruction according to the lowest delay path, and guides the low delay service to the lowest delay path for forwarding, thereby ensuring the low delay requirement.
Multiple equal cost paths may be obtained by off-line computation. For example, network topology information and link state information are collected, offline calculation is performed based on algorithms such as SPF, and equivalent routes with the same cost of multiple paths between the start node and the destination node are determined. The SPF algorithm, also known as Dijkstra algorithm, calculates the distance from each router to each destination router using each router as a root, and calculates the topology structure of the routing domain from a unified database. After obtaining a plurality of equivalent routes, sending a message carrying information of the plurality of equivalent routes to the starting node so as to establish a plurality of equivalent paths between the starting node and the destination node.
In the message forwarding method in the embodiment, the forwarding route is selected from the multiple equivalent routes based on the time delay, so that the shortest time delay path can be found on the basis of the multi-path redundancy technology, the service quality can be distinguished, and differentiated services are provided; the existing routing mechanism is improved, the time delay data of the whole network is obtained, the lowest time delay path in the equivalent paths is found according to the time delay data, the relevant instruction is issued, and the low time delay service flow is guided to the lowest time delay path, so that the resources in an ISP operator network are more effectively utilized, benefits are increased, and the low time delay requirement of a user is met.
In one embodiment, as shown in fig. 4, the present invention provides a routing delay calculating and scheduling apparatus 40, including: a delay calculation module 41, a route scheduling module 42, a topology management module 43, a path calculation module 44, a route transmission module 45 and a signaling receiving module 46. The delay calculation module 41 calculates the delay over a plurality of equivalent routes between the originating node and the destination node. The route scheduling module 42 selects a forwarding route for the packet from a plurality of equivalent routes based on the delay.
The route scheduling module 42 determines a forwarding route corresponding to the quality of service class from a plurality of equivalent routes according to the quality of service class and based on the time delay. The route scheduling module 42 selects a forwarding route with the minimum time delay from the multiple equivalent routes as a high-quality forwarding route, and notifies the starting node; when the initial node judges that the service quality grade of the message is a high quality grade, the message is forwarded through a high quality forwarding route.
The route scheduling module 42 sends an RSVP-TE tunnel establishment instruction to the originating node to cause the originating node to establish an RSVP-TE tunnel through the high quality forwarding route, wherein the originating node sends the high quality level message through the RSVP-TE tunnel. When the time delay on the equivalent route is judged to exceed the preset time delay threshold, the route scheduling module 42 sends a notification message to the start node, and notifies the start node to set the equivalent route to the fault state. When the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, the route scheduling module 42 sends a notification message to the start node, and notifies the start node to set the equivalent route to be in the normal state.
The delay calculation module 41 receives delay information sent after the link delay test is performed on the routing nodes in the whole network, and calculates the delay on each equivalent route according to the topology of the plurality of equivalent routes and the delay information. And the routing node encapsulates the time delay information in an object identifier OID of a simple network management protocol SNMP and transmits the time delay information. The topology management module 43 collects network topology information and link state information, and may also process routers or links that have faults, abnormalities, and the like. The path calculation module 43 performs off-line calculation based on the SPF algorithm to obtain a plurality of equivalent routes. The route sending module 45 sends a message carrying a plurality of equivalent route information to the start node. The signaling receiving module 46 may receive various signaling reported by a router, etc., and may also receive signaling sent by a network management system, etc.
In one embodiment, the present invention provides a network system, which includes the routing delay calculating and scheduling apparatus as above.
In the message forwarding method, the route delay calculation and scheduling device and the network system in the embodiments, the forwarding route is selected from multiple equivalent routes based on the delay, so that the shortest delay path can be found on the basis of the multi-path redundancy technology to guide service forwarding, the service quality can be distinguished, and differentiated services are provided; the existing routing mechanism is improved, the time delay data of the whole network is obtained, the lowest time delay path in the equivalent paths is found according to the time delay data, the relevant instruction is issued, and the low time delay service flow is guided to the lowest time delay path, so that the resources in an ISP operator network are more effectively utilized, benefits are increased, and the low time delay requirement of a user is met.
The method and system of the present invention may be implemented in a number of ways. For example, the methods and systems of the present invention may be implemented in software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustrative purposes only, and the steps of the method of the present invention are not limited to the order specifically described above unless specifically indicated otherwise. Furthermore, in some embodiments, the present invention may also be embodied as a program recorded in a recording medium, the program including machine-readable instructions for implementing a method according to the present invention. Thus, the present invention also covers a recording medium storing a program for executing the method according to the present invention.
The description of the present invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to practitioners skilled in this art. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Claims (9)
1. A message forwarding method is characterized by comprising the following steps:
establishing equivalent routes with the same cost of a plurality of paths between the starting node and the destination node;
calculating time delay on a plurality of equivalent routes;
the method comprises the steps that time delay information sent after a route node in the whole network carries out link time delay test is received, and the route node packages the time delay information in an object identifier OID of a Simple Network Management Protocol (SNMP) and sends the time delay information; calculating the time delay of each equivalent route according to the topology of the equivalent routes and the time delay information;
determining a forwarding route corresponding to the service quality grade from the multiple equivalent routes according to the service quality grade and based on the time delay;
selecting a forwarding route with the minimum time delay from the multiple equivalent routes as a high-quality forwarding route, and informing the starting node; and when the initial node judges that the service quality grade of the message is a high quality grade, forwarding the message through the high quality forwarding route.
2. The method of claim 1, further comprising:
sending an RSVP-TE tunnel establishment instruction to the starting node so that the starting node establishes an RSVP-TE tunnel passing through the high-quality forwarding route;
and the starting node sends the message with high quality grade through the RSVP-TE tunnel.
3. The method of claim 1, further comprising:
when the time delay on the equivalent route is judged to exceed a preset time delay threshold value, sending a notification message to the starting node to notify the starting node to set the equivalent route to a fault state; and the number of the first and second electrodes,
and when the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, sending a notification message to the starting node to notify the starting node to set the equivalent route to be in a normal state.
4. The method of claim 1, further comprising:
collecting network topology information and link state information;
performing off-line calculation based on an SPF algorithm to obtain the plurality of equivalent routes;
and sending a message carrying the equivalent routing information to the starting node.
5. A routing delay calculation and scheduling apparatus, comprising:
the time delay calculation module is used for calculating time delays on a plurality of equivalent routes between the starting node and the destination node;
the time delay calculation module is further configured to receive time delay information sent by the routing nodes in the whole network after performing link time delay test; calculating the time delay of each equivalent route according to the topology of the equivalent routes and the time delay information; the routing node packages the time delay information in an object identifier OID of a Simple Network Management Protocol (SNMP) and sends the time delay information;
a route scheduling module, configured to determine, according to a quality of service level and based on the time delay, a forwarding route corresponding to the quality of service level from the multiple equivalent routes;
the route scheduling module is further configured to select a forwarding route with the smallest time delay from the multiple equivalent routes as a high-quality forwarding route, and notify the starting node of the selected forwarding route; and when the initial node judges that the service quality grade of the message is a high quality grade, forwarding the message through the high quality forwarding route.
6. The apparatus of claim 5,
the routing scheduling module is further configured to send an RSVP-TE tunnel establishment instruction to the originating node, so that the originating node establishes an RSVP-TE tunnel that passes through the high-quality forwarding route;
and the starting node sends the high-quality level message through the RSVP-TE tunnel.
7. The apparatus of claim 6,
a route scheduling module, configured to send a notification message to the start node when it is determined that the time delay on the equivalent route exceeds a preset time delay threshold, and notify the start node to set the equivalent route to a fault state; and when the time delay on the equivalent route in the fault state is judged to be lower than the time delay threshold value, sending a notification message to the starting node to notify the starting node to set the equivalent route to be in the normal state.
8. The apparatus of claim 7, further comprising:
the topology management module is used for acquiring network topology information and link state information;
the path calculation module is used for performing off-line calculation based on an SPF algorithm to obtain the equivalent routes;
and the route sending module is used for sending the message carrying the equivalent route information to the initial node.
9. A network system, characterized by:
comprising the routing delay calculation and scheduling apparatus of any of claims 5 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610868133.XA CN107888490B (en) | 2016-09-30 | 2016-09-30 | Message forwarding method, routing delay calculation and scheduling device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610868133.XA CN107888490B (en) | 2016-09-30 | 2016-09-30 | Message forwarding method, routing delay calculation and scheduling device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107888490A CN107888490A (en) | 2018-04-06 |
| CN107888490B true CN107888490B (en) | 2020-07-31 |
Family
ID=61768817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610868133.XA Active CN107888490B (en) | 2016-09-30 | 2016-09-30 | Message forwarding method, routing delay calculation and scheduling device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107888490B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111683011B (en) * | 2019-03-11 | 2022-04-29 | 华为技术有限公司 | Message processing method, device, equipment and system |
| CN110233765B (en) * | 2019-06-23 | 2022-08-12 | 何梓菁 | Low-delay network slicing method and equipment |
| US20220255840A1 (en) * | 2019-07-01 | 2022-08-11 | Nippon Telegraph And Telephone Corporation | Route control device, route control method, program, and network system |
| CN113132250B (en) * | 2019-12-31 | 2023-05-05 | 奇安信科技集团股份有限公司 | Data packet transmission method, device, electronic equipment and medium |
| CN112929276B (en) * | 2021-01-25 | 2022-07-08 | 中国联合网络通信集团有限公司 | Path adjusting method, device and system |
| CN114501161B (en) * | 2022-04-11 | 2022-08-02 | 中兴通讯股份有限公司 | Audio and video system, access method, route forwarding method and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1798096A (en) * | 2004-12-28 | 2006-07-05 | 杭州华为三康技术有限公司 | Method and device for carrying out flux management under multiple exits on routes or exchanges |
| CN101478479A (en) * | 2008-12-31 | 2009-07-08 | 华为技术有限公司 | User access method, apparatus and system |
| CN102801614A (en) * | 2012-07-17 | 2012-11-28 | 杭州华三通信技术有限公司 | Convergence method for equivalent routing and network device |
| CN104283807A (en) * | 2014-09-17 | 2015-01-14 | 杭州华三通信技术有限公司 | TE tunnel building method and device |
-
2016
- 2016-09-30 CN CN201610868133.XA patent/CN107888490B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1798096A (en) * | 2004-12-28 | 2006-07-05 | 杭州华为三康技术有限公司 | Method and device for carrying out flux management under multiple exits on routes or exchanges |
| CN101478479A (en) * | 2008-12-31 | 2009-07-08 | 华为技术有限公司 | User access method, apparatus and system |
| CN102801614A (en) * | 2012-07-17 | 2012-11-28 | 杭州华三通信技术有限公司 | Convergence method for equivalent routing and network device |
| CN104283807A (en) * | 2014-09-17 | 2015-01-14 | 杭州华三通信技术有限公司 | TE tunnel building method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107888490A (en) | 2018-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107888490B (en) | Message forwarding method, routing delay calculation and scheduling device and system | |
| US9647944B2 (en) | Segment routing based wide area network orchestration in a network environment | |
| KR101685855B1 (en) | System, method and apparatus for signaling and responding to ero expansion failure in inter domain te lsp | |
| JP4960443B2 (en) | Multi-domain route calculation method and system | |
| US7689693B2 (en) | Primary/restoration path calculation in mesh networks based on multiple-cost criteria | |
| US8867333B2 (en) | Restoration path calculation considering shared-risk link groups in mesh networks | |
| US7545736B2 (en) | Restoration path calculation in mesh networks | |
| US7451340B2 (en) | Connection set-up extension for restoration path establishment in mesh networks | |
| US8296407B2 (en) | Calculation, representation, and maintenance of sharing information in mesh networks | |
| US9571381B2 (en) | System and method for inter-domain RSVP-TE LSP load balancing | |
| JP5135748B2 (en) | Transmission apparatus and path setting method | |
| US8929204B2 (en) | Reliability as an interdomain service | |
| KR20140088206A (en) | Service assurance using network measurement triggers | |
| CN101640637A (en) | Resource reservation protocol tunnel management method based on flow rate engineering and system thereof | |
| CN113542120B (en) | Path selection method and device and computer readable storage medium | |
| Hasan et al. | Development of FRR mechanism by adopting SDN notion | |
| Oh et al. | Fault restoration and spare capacity allocation with QoS constraints for MPLS networks | |
| US7702810B1 (en) | Detecting a label-switched path outage using adjacency information | |
| Suhaimy et al. | Analysis of MPLS-TP network for different applications | |
| Ajiardiawan et al. | Performance analysis of segment routing on MPLS L3VPN using PNETLAB | |
| CN102316008B (en) | Method and device for optimizing resources | |
| Xia | Research on signaling mechanism based on convergence network | |
| Nagarajan et al. | A fault‐tolerant MPLS‐based control and communication network for the Lucent LambdaRouter | |
| YOON | Protection algorithms for bandwidth guaranteed connections in MPLS networks | |
| JP6017036B6 (en) | System, method and apparatus for signaling and responding to ERO extension failure in inter-domain TE LSP |
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 |