CN102088409A - Multi-next-hop route implementation method - Google Patents
Multi-next-hop route implementation method Download PDFInfo
- Publication number
- CN102088409A CN102088409A CN2011100005389A CN201110000538A CN102088409A CN 102088409 A CN102088409 A CN 102088409A CN 2011100005389 A CN2011100005389 A CN 2011100005389A CN 201110000538 A CN201110000538 A CN 201110000538A CN 102088409 A CN102088409 A CN 102088409A
- Authority
- CN
- China
- Prior art keywords
- node
- equivalence class
- network
- polymerization
- weights
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a multi-next-hop route implementation method; the method is implemented by means of an aggregation equivalent class distribution graph constructing algorithm of network nodes and a multi-next-hop route generation algorithm based on aggregation equivalent classes; in the aggregation equivalent classes distribution graph constructing algorithm of network nodes, the network nodes are aggregated to different aggregation equivalent classes according to distance factors, an aggregation equivalent class distribution graph of target nodes is established according to the weights of the equivalent classes; in the multi-next-hop route generation algorithm based on the aggregation equivalent classes, packs are restricted to adopt a weight reducing direction as a flow direction between different aggregation equivalent classes so as to ensure multiple next-hop routes between different aggregation equivalent classes; and when an available chain exists in the same aggregation equivalent class, a strict sequence among nodes is determined according to an order that the nodes are added into the shortest path tree (SPT). By utilizing the novel multi-next-hop route implementation method provided by the invention, the defects of the SPT mechanism and the graph theory encoding mechanism are fundamentally eliminated.
Description
(1), technical field: the present invention relates to a kind of route implementing method, particularly relate to a kind of multi-next-hop route implementing method.
(2), background technology: next jumps routing algorithm the list that route generally adopts in the current internet domain, no matter is to adopt distance vector mechanism, or Link State mechanism all is based on SPF (SPF, Shortest Path First) principle.Be that each node spends according to the path to the destination, next jumps into the row transmission to choose optimum.Single next jumping routing algorithm always tends to choose the strongest node of disposal ability and link, is difficult to make full use of Internet resources, often causes concentrating of transmission path, and easily the initiation transmission is congested when the flow request is big.
For addressing the above problem, people have proposed the solution thinking of multipath route.Current multi-path routing algorithm mainly is divided into two big classes, and a class is connection-oriented source route algorithm, calculates and safeguards that several complete paths are used for the parallel transmission data, balanced subnetwork flow.Great majority based on service quality (Quality of Service, QoS) demand and based on multiprotocol label switching (Multi-protocol Label Switching, MPLS) multi-path routing algorithm of technology all belongs to this type of.These algorithms are directed to often and satisfy specific demand, rely on the support of special technique, bigger calculating is generally all arranged and safeguard cost; And it has changed the existing nothing connection mode of operation based on the service of doing one's best of IP network layer, shortage universality.
Another kind of multi-path routing algorithm is by the expansion to existing single next jumping routing algorithm, allow each node that a plurality of next available jumping are all arranged to the destination, thereby can produce a large amount of parallel transmission paths to the destination, we claim that this type of routing algorithm is the multi-next-hop routing algorithm.The multi-next-hop route does not have with present IP network layer and is connected the mode of operation compatibility of doing one's best, and is less to existing routing mechanism change, is easier to Project Realization with respect to source route algorithm.Existing multi-next-hop routing algorithm is mainly realized based on two kinds of mechanism: mechanism and graph theory coding shortest path tree SPT(Shortest Path Tree).
(1) SPT mechanism
Based on the multi-next-hop routing algorithm of SPT mechanism by relaxing the restriction of only selecting shortest path, allow each node to choose hypo-optimal route and carry out transfer of data, promptly all distance to destinations can both be as next available jumping than own near neighbours, thereby produces many transmission paths.
MDVA (Multipath Distance Vector Algorithm) based on this Mechanism Design is first multipath distance vector algorithm, utilize the optimal distance of DBF algorithm computation to the destination, adopt diffusion to calculate " counting down to infinite " problem of solution, satisfy assurance multi-next-hop route directed graph loop free under the precondition of acyclic inequality, thereby realizing the multi-next-hop route.MPDA (Multipath Partial Dissemination Algorithm) is a link-state algorithm, upgrade exchange by backfence Link State and reach synchronous, the single-hop scope that only is diffused into synchronously between the router is different from broadcast algorithm and may be diffused into whole network.MPATH is the hybrid algorithm that combines distance vector and Link State, finds the path by precursor node rather than descendant node information.Also having the researcher to propose the QMPDA algorithm, is the reinforcement of MPDA algorithm.QMPDA has considered network failure and topology change, and the solution of supporting the different stage service is provided.
(2) graph theory coding
In addition, the researcher has also proposed a kind of multi-next-hop routing algorithm of uniqueness, and this algorithm has adopted the thought of st coding in the graph theory.For two connected graph G, (s t) is limit among the G, then can be in polynomial time, and finding with the source node is starting point s, destination node is the st coding of terminal point t.By the st encryption algorithm, give numbering of all nodes in the network, make the numbering minimum of s, the numbering maximum of t, except that s, t, all the other nodes all have a numbering at least than own big neighbours and the own little neighbours of numbering ratio, then can be according to producing the multi-next-hop route to the regulation of the big node for data forwarding grouping of numbering from numbering little node, and the realization multi-next-hop is parallel to be transmitted.It is starting point with a that Fig. 1 is one, and e is the st coding route schematic diagram of terminal point, wherein,
s=a,
t=e.
The thought that produces the multi-next-hop route based on the multi-next-hop routing algorithm of SPT mechanism is more directly perceived, easy to understand and realization, and can provide a plurality of next jumping for intermediate node, but under this mechanism, for a class message that arrives same outlet, link can't obtain utilizing between the equidistant neighbor node of calculating gained.
The method that produces route based on the multi-next-hop routing algorithm of st coding has the innovation part than other algorithms, related notion but it places one's entire reliance upon in the graph theory, when calculating path, do not consider the resource difference between actual node and link, resulting transmission path possibility performance is abominable, still lack practicality at present, remain to be further developed.
(3), summary of the invention:
The technical problem to be solved in the present invention is: overcome the defective of prior art, a kind of novel multi-next-hop route implementing method is provided, this method has fundamentally been eliminated the encode defective of these two kinds of mechanism of shortest path tree SPT mechanism and graph theory.
Technical scheme of the present invention:
A kind of multi-next-hop route implementing method, by network node polymerization equivalence class distribution map make up algorithm and
Multi-next-hop route generating algorithm based on the polymerization equivalence class realizes; Make up in the algorithm at network node polymerization equivalence class distribution map, network node is polymerized to different equivalence classes according to distance factor, and sets up the polymerization equivalence class distribution map of destination node according to the weights of equivalence class; In multi-next-hop route generating algorithm based on the polymerization equivalence class, be grouped between the different polymerization equivalence classes by constraint and reduce direction as the flow direction with weights, thereby determine between the different equivalence classes many next jump routes; In that but identical equivalence class is inner when having line link, the order that adds shortest path tree according to node is determined the strict sequence between the node, makes that all links all can participate in message transmissions in the network, improves the resource utilization of network.
Make up in the algorithm at network node polymerization equivalence class distribution map, the foundation of network node polymerization equivalence class distribution map is divided into following step:
The first step: from network topological diagram, select certain node as destination node and its weights are set is 0, other network nodes are polymerized to different equivalence classes and give weights according to distance factor, wherein distance definition is the cost that network node arrives destination node, according to the definition of SPF algorithm, cost c=10
8/ B, B are bandwidth;
Second step: determine level between the different equivalence classes according to the weights of polymerization equivalence class, finally obtain the network node polymerization equivalence class distribution map of relative this node of other nodes in the network, this network node polymerization equivalence class distribution map retrains other nodes send the flow direction from grouping to this node;
The 3rd step: all nodes are set up network node polymerization equivalence class distribution map respectively in the traverses network;
The 4th step: the all-network node polymerization equivalence class distribution map that obtains is converged at each node, and each node just can obtain stream of packets with respect to all nodes of network others to constraint, thereby can carry out routing according to the flow direction of dividing into groups.
Multi-next-hop route generating algorithm purpose based on the polymerization equivalence class is by obtaining the optimum of neighbor advertisement
Polymerization equivalence class routing iinformation calculates optional next jumping route table items as much as possible at each destination at each node.Concrete grammar is to adopt the optimum polymerization equivalence class information that compares between the neighbor node to distinguish the upstream and downstream relation of neighbor node and present node, concern the multi-next-hop loop free of setting up from the source node to the destination node by directed graph by the upstream and downstream between definite all nodes, and then generate the multi-next-hop route table items.
Flow process based on the multi-next-hop route generating algorithm of polymerization equivalence class is:
Step a. is with the announcement that floods of polymerization equivalence class distribution map and the sequence number that adds shortest path tree;
When step b. receives flooded packets when each node, search the equivalence class weights summary sheet of this node at this destination address and judge;
If the corresponding equivalence class weights of this node of step c are 0, then this node is a fringe node, transfers network by the grouping destination address, forwards step g then to;
If steps d. the corresponding equivalence class weights non-0 of this node, then search the equivalence class weights node littler or equal with the equivalence class weights of this node than the equivalence class weights of this node in neighbor node, the node that the equivalence class weights are littler than the equivalence class weights of this node is jumped route as next;
Step e. judges the node that whether exists the equivalence class weights to equate with the equivalence class weights of this node in the neighbor node; In this way, forward step f to; As not being to forward step g to;
Step f. is the sequence number of this node and this neighbor node relatively, and the less node of sequence number adds router to also as feasible next jumping;
Step g. finish.
The node that permission selects weights to equate may cause route loop as next jumping route of transmitting grouping,
Therefore must adopt suitable loop avoidance mechanism.Concrete grammar is: can use for reference the network code principle, by each Egress node in the network, move respectively with from as the shortest path tree search algorithm of root the time, draw a spanning tree in the network; In search procedure, the order that adds set according to node is finished simultaneously to the equivalence class sequence number assignment of all nodes in the network with respect to self; In order to reach the consistency of network range sequence number, the sequence number table that each Egress node all needs oneself is calculated carries out the whole network and floods, and is notified to the all-network node.
Beneficial effect of the present invention:
1, in the multi-next-hop route generating algorithm based on the polymerization equivalence class of the present invention, allows to select weights
The node that equates as next that transmit grouping jump route be in order to prevent some node because and lack communication path between the littler layering of weights and cause dividing into groups to send to destination node, and adopt this strategy can improve the equalization characteristic of offered load on the whole, help reducing the packet loss of network.
2, the multi-next-hop route generating algorithm based on the polymerization equivalence class of the present invention such as had both found at cost
Multipath has been found the multipath that cost does not wait again, does not have disjoint restriction between the path simultaneously, has fully excavated the idling-resource in the network and has participated in acyclic parallel transmission, has significantly reduced the congested risk of bottleneck link in the network.
3, the multi-next-hop route generating algorithm based on the polymerization equivalence class carried of the present invention is simple, the traffic is low; This algorithm makes the transmission direction of message obtain standard, has fundamentally avoided the generation of network intermediate ring road, simultaneously, but all line links all participate in the data forwarding process, for route provides a large amount of available resources, provide the basis for realizing the whole network load balancing.
(4), description of drawings:
Fig. 1 is graph theory st coding schematic diagram;
Fig. 2 is a network topological diagram;
Fig. 3 is for node a being next jumping path profile of list of destination node;
Fig. 4 is for being the polymerization equivalence class distribution map (not considering the link transmission direction of identical equivalence class inside) of destination node with node a;
Fig. 5 generates figure (not considering the link transmission direction of identical equivalence class inside) for the acyclic multi-next-hop route of polymerization equivalence class;
Fig. 6 generates figure (after having considered the link transmission direction of identical equivalence class inside) for the acyclic multi-next-hop route of polymerization equivalence class.
(5), embodiment:
A kind of multi-next-hop route implementing method, by network node polymerization equivalence class distribution map make up algorithm and
Multi-next-hop route generating algorithm based on the polymerization equivalence class realizes; Make up in the algorithm at network node polymerization equivalence class distribution map, network node is polymerized to different equivalence classes according to distance factor, and sets up the polymerization equivalence class distribution map of destination node according to the weights of equivalence class; In multi-next-hop route generating algorithm based on the polymerization equivalence class, be grouped between the different polymerization equivalence classes by constraint and reduce direction as the flow direction with weights, thereby determine between the different equivalence classes many next jump routes; In that but identical equivalence class is inner when having line link, the order that adds shortest path tree according to node is determined the strict sequence between the node, makes that all links all can participate in message transmissions in the network, improves the resource utilization of network.
Make up in the algorithm at network node polymerization equivalence class distribution map, the foundation of network node polymerization equivalence class distribution map is divided into following step:
The first step: from network topological diagram, select certain node as destination node and its weights are set is 0, other network nodes are polymerized to different equivalence classes and give weights according to distance factor, wherein distance definition is the cost that network node arrives destination node, according to the definition of SPF algorithm, cost c=10
8/ B, B are bandwidth;
Second step: determine level between the different equivalence classes according to the weights of polymerization equivalence class, finally obtain the network node polymerization equivalence class distribution map of relative this node of other nodes in the network, this network node polymerization equivalence class distribution map retrains other nodes send the flow direction from grouping to this node;
The 3rd step: all nodes are set up network node polymerization equivalence class distribution map respectively in the traverses network;
The 4th step: the all-network node polymerization equivalence class distribution map that obtains is converged at each node, and each node just can obtain stream of packets with respect to all nodes of network others to constraint, thereby can carry out routing according to the flow direction of dividing into groups.
Multi-next-hop route generating algorithm purpose based on the polymerization equivalence class is by obtaining the optimum of neighbor advertisement
Polymerization equivalence class routing iinformation calculates optional next jumping route table items as much as possible at each destination at each node.Concrete grammar is to adopt the optimum polymerization equivalence class information that compares between the neighbor node to distinguish the upstream and downstream relation of neighbor node and present node, concern the multi-next-hop loop free of setting up from the source node to the destination node by directed graph by the upstream and downstream between definite all nodes, and then generate the multi-next-hop route table items.
Flow process based on the multi-next-hop route generating algorithm of polymerization equivalence class is:
Step a. is with the announcement that floods of polymerization equivalence class distribution map and the sequence number that adds shortest path tree;
When step b. receives flooded packets when each node, search the equivalence class weights summary sheet of this node at this destination address and judge;
If the corresponding equivalence class weights of this node of step c are 0, then this node is a fringe node, transfers network by the grouping destination address, forwards step g then to;
If steps d. the corresponding equivalence class weights non-0 of this node, then search the equivalence class weights node littler or equal with the equivalence class weights of this node than the equivalence class weights of this node in neighbor node, the node that the equivalence class weights are littler than the equivalence class weights of this node is jumped route as next;
Step e. judges the node that whether exists the equivalence class weights to equate with the equivalence class weights of this node in the neighbor node; In this way, forward step f to; As not being to forward step g to;
Step f. is the sequence number of this node and this neighbor node relatively, and the less node of sequence number adds router to also as feasible next jumping;
Step g. finish.
The node that permission selects weights to equate may cause route loop as next jumping route of transmitting grouping,
Therefore must adopt suitable loop avoidance mechanism.Concrete grammar is: can use for reference the network code principle, by each Egress node in the network, move respectively with from as the shortest path tree search algorithm of root the time, draw a spanning tree in the network; In search procedure, the order that adds set according to node is finished simultaneously to the equivalence class sequence number assignment of all nodes in the network with respect to self; In order to reach the consistency of network range sequence number, the sequence number table that each Egress node all needs oneself is calculated carries out the whole network and floods, and is notified to the all-network node.
Further specify technical scheme of the present invention below in conjunction with concrete example:
Referring to the network topology of Fig. 2, circle is represented router, and curve is represented link, supposes that link bandwidth is identical, and then link cost is only relevant with the jumping figure of distance destination, following example with node a as outlet.
Referring to Fig. 3, be next the jumping routing diagram of list that adopts the SPF algorithm computation to obtain.As can be seen, the flow in the network is comparatively concentrated, under heavy traffic condition, be easy to generate congested, but and also have this moment a large amount of line links to be in idle.
Referring to Fig. 4, be to adopt polymerization equivalence class distribution map of the present invention to make up the route direction figure that algorithm obtains.Provided the polymerization equivalence class distribution map of given network topology lower network node, the network node that wherein belongs to the same polymeric equivalence class is by an annulus series connection.The polymerization equivalence class distribution map of node a is the center of circle with a, and all the other nodes increase direction with polymerization equivalence class loop wire according to weights and outwards distribute, and is the direction routing that the message of purpose will reduce according to weights with a, obtain many next jump routing iinformations.
Referring to Fig. 5, be the multi-next-hop routing diagram of not considering to wait link transmission direction between the weights.Execute the equivalence class weights relatively after, on the link between adjacent node, arrow shows that data flow to the low node of weights from the high node of equivalence class weights.Also comprised parallel link among Fig. 5, as i-g, d-b.
Referring to Fig. 6, be the final route figure that adopts multi-next-hop route implementing scheme of the present invention to obtain.As can be seen, but all line links of same polymeric equivalence class inside have all participated in message transmissions, as b-c, and f-g, d-e, f-e, d-h.So far, all links all can participate in message transmissions in the network, have improved the resource utilization of network.
The multi-next-hop assignment algorithm that the present invention proposes, be based on general SPF algorithm, current all core routers are all supported the SPF algorithm, link transmission direction between the identical equivalence class is determined by the order that node adds shortest path tree, also provide in the lump by this process, so the multi-next-hop routing algorithm that the present invention proposes can not produce extra amount of calculation.
Claims (4)
1. multi-next-hop route implementing method is characterized in that: make up algorithm and realize based on the multi-next-hop route generating algorithm of polymerization equivalence class by network node polymerization equivalence class distribution map; Make up in the algorithm at network node polymerization equivalence class distribution map, network node is polymerized to different equivalence classes according to distance factor, and sets up the polymerization equivalence class distribution map of destination node according to the weights of equivalence class; In multi-next-hop route generating algorithm based on the polymerization equivalence class, be grouped between the different polymerization equivalence classes by constraint and reduce direction as the flow direction with weights, thereby determine between the different equivalence classes many next jump routes; In that but identical equivalence class is inner when having line link, the order that adds shortest path tree according to node is determined the strict sequence between the node, makes that all links all can participate in message transmissions in the network, improves the resource utilization of network.
2. multi-next-hop route implementing method according to claim 1 is characterized in that: make up in the algorithm at network node polymerization equivalence class distribution map, the foundation of network node polymerization equivalence class distribution map is divided into following step:
The first step: from network topological diagram, select certain node as destination node and its weights are set is 0, other network nodes are polymerized to different equivalence classes and give weights according to distance factor, wherein distance definition is the cost that network node arrives destination node, according to the definition of SPF algorithm, cost c=10
8/ B, B are bandwidth;
Second step: determine level between the different equivalence classes according to the weights of polymerization equivalence class, finally obtain the network node polymerization equivalence class distribution map of relative this node of other nodes in the network, this network node polymerization equivalence class distribution map retrains other nodes send the flow direction from grouping to this node;
The 3rd step: all nodes are set up network node polymerization equivalence class distribution map respectively in the traverses network;
The 4th step: the all-network node polymerization equivalence class distribution map that obtains is converged at each node, and each node just can obtain stream of packets with respect to all nodes of network others to constraint, thereby can carry out routing according to the flow direction of dividing into groups.
3. multi-next-hop route implementing method according to claim 1 is characterized in that: the flow process of described multi-next-hop route generating algorithm based on the polymerization equivalence class is:
Step a. is with the announcement that floods of polymerization equivalence class distribution map and the sequence number that adds shortest path tree;
When step b. receives flooded packets when each node, search the equivalence class weights summary sheet of this node at this destination address and judge;
If the corresponding equivalence class weights of this node of step c are 0, then this node is a fringe node, transfers network by the grouping destination address, forwards step g then to;
If steps d. the corresponding equivalence class weights non-0 of this node, then search the equivalence class weights node littler or equal with the equivalence class weights of this node than the equivalence class weights of this node in neighbor node, the node that the equivalence class weights are littler than the equivalence class weights of this node is jumped route as next;
Step e. judges the node that whether exists the equivalence class weights to equate with the equivalence class weights of this node in the neighbor node; In this way, forward step f to; As not being to forward step g to;
Step f. is the sequence number of this node and this neighbor node relatively, and the less node of sequence number adds router to also as feasible next jumping;
Step g. finish.
4. multi-next-hop route implementing method according to claim 3 is characterized in that: by each Egress node in the network, move respectively with from as the shortest path tree search algorithm of root the time, draw a spanning tree in the network; In search procedure, the order that adds set according to node is finished simultaneously to the equivalence class sequence number assignment of all nodes in the network with respect to self; In order to reach the consistency of network range sequence number, the sequence number table that each Egress node all needs oneself is calculated carries out the whole network and floods, and is notified to the all-network node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100005389A CN102088409A (en) | 2011-01-04 | 2011-01-04 | Multi-next-hop route implementation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100005389A CN102088409A (en) | 2011-01-04 | 2011-01-04 | Multi-next-hop route implementation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102088409A true CN102088409A (en) | 2011-06-08 |
Family
ID=44100029
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100005389A Pending CN102088409A (en) | 2011-01-04 | 2011-01-04 | Multi-next-hop route implementation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102088409A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106953683A (en) * | 2017-04-13 | 2017-07-14 | 重庆金美通信有限责任公司 | The routing mechanism and implementation method of a kind of extensive dynamic group net for being suitably based on MF TDMA satellite channels |
| CN107770061A (en) * | 2016-08-16 | 2018-03-06 | 华为技术有限公司 | The method and forwarding unit to E-Packet |
| CN108809828A (en) * | 2018-05-23 | 2018-11-13 | 国网江苏省电力有限公司苏州供电分公司 | A kind of power communication network route method of load flow and business risk joint equalization |
| CN114422379A (en) * | 2022-01-20 | 2022-04-29 | 昕锐至成(江苏)光电科技有限公司 | Analysis method for multi-platform equipment wireless networking |
| CN114531446A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Data distribution method, device and system based on P2P |
-
2011
- 2011-01-04 CN CN2011100005389A patent/CN102088409A/en active Pending
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107770061A (en) * | 2016-08-16 | 2018-03-06 | 华为技术有限公司 | The method and forwarding unit to E-Packet |
| CN106953683A (en) * | 2017-04-13 | 2017-07-14 | 重庆金美通信有限责任公司 | The routing mechanism and implementation method of a kind of extensive dynamic group net for being suitably based on MF TDMA satellite channels |
| CN108809828A (en) * | 2018-05-23 | 2018-11-13 | 国网江苏省电力有限公司苏州供电分公司 | A kind of power communication network route method of load flow and business risk joint equalization |
| CN108809828B (en) * | 2018-05-23 | 2021-02-26 | 国网江苏省电力有限公司苏州供电分公司 | Power communication network routing method for joint balance of load flow and business risk |
| CN114531446A (en) * | 2020-10-31 | 2022-05-24 | 华为技术有限公司 | Data distribution method, device and system based on P2P |
| CN114531446B (en) * | 2020-10-31 | 2023-04-18 | 华为技术有限公司 | Data distribution method, device and system based on P2P |
| CN114422379A (en) * | 2022-01-20 | 2022-04-29 | 昕锐至成(江苏)光电科技有限公司 | Analysis method for multi-platform equipment wireless networking |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5385984B2 (en) | How to calculate multicast routes | |
| US20110176416A1 (en) | Method for Discovering Multiple Routes in Sensor Networks | |
| CN104871490B (en) | The multipath communication device of energy ecology and its method for distributing business for improving energy ecology can be improved | |
| Tekaya et al. | Multipath routing mechanism with load balancing in ad hoc network | |
| CN104038417A (en) | Service Instance Applied To Mpls Networks | |
| CN102088409A (en) | Multi-next-hop route implementation method | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| JP2019122040A (en) | Network source reuse and routing mechanism defining multi-source by software | |
| CN105472484B (en) | A kind of electric power backbone Optical Transmission Network OTN radio frequency channel proportional routing Wavelength allocation method | |
| CN107426097A (en) | A kind of intra-area routes guard method based on increment SPF | |
| Zadin et al. | Maintaining path stability with node failure in mobile ad hoc networks | |
| WO2003096632A1 (en) | Distribution scheme for distributing information in a network | |
| CN101110765A (en) | Method for supporting multiple service quality based on OSPF protocol | |
| CN101483591B (en) | Route implementing method and route generating apparatus | |
| CN101977159A (en) | Management method of bandwidth resources of narrow band network | |
| Menth et al. | Robust IP link costs for multilayer resilience | |
| CN115460129B (en) | Quantum key distribution routing method based on OSPF protocol | |
| CN101702686B (en) | Method for implementing multiple next hopping routers, device and system thereof | |
| Giorgetti et al. | Impact of intra-domain information in GMPLS-based WSONs with hierarchical PCE | |
| Santhi et al. | Performance evaluation of different routing protocols to minimize congestion in heterogeneous network | |
| CN102685004A (en) | Method for implementing traffic engineering in GMPLS/OBS (generalized multi-protocol label switching/optical burst switching) network | |
| Alma'aitah et al. | Energy-efficient and QoS-aware multi-path geographic routing protocol for WMSN | |
| Al Mtawa et al. | Disjoint-Path Segment Routing: Network Reliability Perspective | |
| Adibi | MPLS implementation in mobile ad-hoc networks (MANETs) | |
| CN102710499A (en) | Multi-publish-source external routing slave next-hop selection method and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110608 |