CN103281247A - Universal routing method and universal routing system of data center network - Google Patents
Universal routing method and universal routing system of data center network Download PDFInfo
- Publication number
- CN103281247A CN103281247A CN2013101690086A CN201310169008A CN103281247A CN 103281247 A CN103281247 A CN 103281247A CN 2013101690086 A CN2013101690086 A CN 2013101690086A CN 201310169008 A CN201310169008 A CN 201310169008A CN 103281247 A CN103281247 A CN 103281247A
- Authority
- CN
- China
- Prior art keywords
- router
- link
- list
- routing
- network
- 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.)
- Granted
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
Abstract
The invention relates to a universal routing method and a universal routing system for a data center network. The method comprises the following steps of performing link and neighbor detection, namely detecting a connected link and a neighbor router adjacent to a router and storing detection results into an adjacent equipment list; performing equipment training, namely broadcasting the router per se, learning other routers in the network and storing results into a full-network equipment list; performing link failure deduction, namely deducing the neighbor router and associated link failure according to the learnt routers and storing results into the adjacent equipment list and a full-network link fault list; performing link failure training, broadcasting the link failure of the router per se, learning other link failures in the network and storing results into the full-network link fault list; constructing a base routing list and an elusion routing list; and inquiring the routing lists. Compared with the prior art, the universal routing method and the universal routing system provided by the invention are simpler and more efficient and have better fault handling capability.
Description
Technical field
The present invention relates to a kind of method for routing and system, be specially a kind of general method for routing and system of data center network.
Background technology
Data center is the center that provides of the various application services of enterprise, is the center of data operation, exchange and storage.It combines advanced network technology and memory technology, has carried the service request 80% or more and memory data output in the network, serves and operation platform for the health running of client's business system provides.
Along with the expansion day by day of data center's scale, existing tree network topology framework inevitably the bandwidth bottleneck problem can occur at the network core layer, causes network in the decline of aspect overall performances such as transmission delay, efficiency of transmission.In order to solve network core layer bandwidth communication performance bottleneck problem, multiple new network topology structure has been proposed at present, such as fat tree (Fat-tree) structure, the fat tree network topology structure of multiple-limb, switch type matrixing network structure (MatrixDCN) and BCube network configuration etc., and at these network configurations different method for routing has been proposed.
Large-scale data center in the future can be made up of a plurality of heterogeneous networks, and each network can adopt different network configurations, and the multiple network structure co-exists in the data center.Consider economy, each router in the network preferably can be supported various network architectures and Routing Protocol, can support multiple Routing Protocols such as RIP, OSPF just as present router.Because the difference between the above-mentioned network architecture and the method for routing thereof is very big, therefore compatible very poor between these method for routing support a large amount of development of these method for routing needs simultaneously.In addition, these method for routing are being handled aspect the network failure all more complicated, and efficient is relatively low.
Summary of the invention
The present invention generally has regular these characteristics of topological structure according to data center network, has proposed a general Route Method And Route System, is called fault and evades method for routing and fault scale route system.Fault evades method for routing and system goes for various data center network with rule topology, is applied to the router of data center network or has above the switch of routing function.This method for routing and system have solved the problem of poor compatibility between the method for routing of present various types of data center network.
The technical solution adopted for the present invention to solve the technical problems is: the general method for routing of data center network comprises following steps:
Step 1) link and neighbours detect step, and router sends and receive hello packet, the link that detection connects and the neighbor router of adjacency; Router-A is received the hello packet that router B sends over from port, and then router-A can know that router B is its adjacent device, and can know that the link that port connects is active link; Detected adjacent device and active link are kept in the adjacent device table;
Step 2) equipment training step, each router sends by devices advertise message (DA) oneself with broadcast mode; When receiving a DA message, at first relatively whether the whole network equipment table has comprised this router, if do not comprise this router, then this router is inserted into the whole network equipment table, and this message is forwarded to all of the port except inbound port; If comprised this router, then directly abandon this message.
Step 3) link failure derivation step, according to study to router derive neighbor router and associated faulty link, the result is saved in adjacent device table and the total network links bug list;
Step 4) link failure training step, router are encapsulated into the link failure of oneself in the link fault announcing message and broadcast away, and according to other link failures in the message learning network that receives, the result is saved in its total network links bug list;
Step 5) basis of formation routing table and fault routing table;
The step 6) table of query and routing;
Described step 3) further comprises: position encoded in its IP address each router, and then judge whether adjacency of two routers according to the IP address of router; Derive all by relatively whole network equipment table and adjacent device table and can not survey neighbor router, can not survey neighbor router for each, and then can infer that this can not be surveyed and have a faulty link between neighbor router and the current router.
Described step 4) further comprises: when receiving a link fault announcing message, at first relatively whether the total network links bug list has comprised this link failure; If do not comprise this link failure, then this link failure is inserted into the total network links bug list, and this message is forwarded to all of the port except inbound port; If comprised this link failure, then directly abandon this message.
Described step 5) further comprises:
Basis of formation routing table step, the rule topology structure of utilizing network to have is obtained under the situation of full mesh topology information not needing, and calculates the path that arrives the required process of any destination address of network, again in conjunction with the adjacent device table, constructs basic routing table;
Make up fault routing table step, utilize the total network links bug list, the network topology structure of binding rule calculates all route entrys through faulty link of place router, forms and evades routing table.
Described step 6) further comprises: at first inquire about basic routing table with the destination address that sends packet as querying condition, adopt the principle of long coupling, inquire one group of route entry that satisfies the coupling destination address, form candidate's route list; With the destination address that sends packet as querying condition inquiry evade routing table, the route entry on all couplings (being not limited to grow most coupling, as long as coupling goes up) composition is evaded route list; Candidate's route list deducts evades route list and forms and can use route list; Select any address as next jumping this packet to be sent in the route list from using, if can use route list for empty, then abandon this packet.
A kind of general route system of data center network is characterized in that comprising:
Link and neighbor router detect step block, and router sends and receive hello packet, the link that detection connects and the neighbor router of adjacency; Router-A is received the hello packet that router B sends over from port, and then router-A can know that router B is its adjacent device, and can know that the link that port connects is active link; Detected adjacent device and active link are kept in the adjacent device table;
The equipment training module, each router sends by devices advertise message (DA) oneself with broadcast mode; When receiving a DA message, at first relatively whether the whole network equipment table has comprised this router, if do not comprise this router, then this router is inserted into the whole network equipment table, and this message is forwarded to all of the port except inbound port; If comprised this router, then directly abandon this message.
The link failure derivation module, according to study to router derive neighbor router and associated faulty link, the result is saved in adjacent device table and the total network links bug list;
Link failure training module, router are encapsulated into the link failure of oneself in the link fault announcing message and broadcast away, and according to other link failures in the message learning network that receives, the result is saved in the total network links bug list;
Basis of formation router table means and fault router table means;
The table of query and routing module;
Described link failure derivation module, position encoded in its IP address each router, and then judge whether adjacency of two routers according to the IP address of router; Derive all by relatively whole network equipment table and adjacent device table and can not survey neighbor router, can not survey neighbor router for each, and then can infer that this can not be surveyed and have a faulty link between neighbor router and the current router.
Described link failure training module, when receiving a link fault announcing message, at first relatively whether the total network links bug list has comprised this link failure; If do not comprise this link failure, then this link failure is inserted into the total network links bug list, and this message is forwarded to all of the port except inbound port; If comprised this link failure, then directly abandon this message.
Described basis of formation router table means, the rule topology structure of utilizing network to have is obtained under the situation of full mesh topology information not needing, and calculates the path that arrives the required process of any destination address of network, in conjunction with the adjacent device table, construct basic routing table again.
Described structure fault router table means is utilized the total network links bug list, and the network topology structure of binding rule calculates all route entrys through faulty link of place router, forms and evades routing table.Utilization is evaded routing table the routed path that comprises faulty link is excluded from candidate's routed path that basic router table means is calculated;
Described table of query and routing module is at first inquired about basic routing table with the destination address that sends packet as querying condition, adopts the principle of long coupling, inquires one group of route entry that satisfies the coupling destination address, forms candidate's route list; With the destination address that sends packet as querying condition inquiry evade routing table, the route entry on all couplings is formed and is evaded route list; Candidate's route list deducts evades route list and forms and can use route list; Select any address as next jumping this packet to be sent in the route list from using, if can use route list for empty, then abandon this packet.
The key data structure tabulation
Fault evades method for routing and system need safeguard following a plurality of tables of data at each router:
The adjacent device table: be used for storing the neighbor router of place router and associated link, main list item comprises device id, IP address of equipment, port numbers, Link State and update time.
The whole network equipment table: be used for storing the all-router in the whole network, main list item comprises device id, IP address of equipment, device type, equipment state and update time.
The total network links bug list: be used for storing all link failures in the whole network, main list item comprises the IP address of numbering, router one, IP address and the update time of router two.
The basis routing table: be used for storing candidate's route route, main list item comprises purpose subnet address/subnet mask, next hop address, affiliated interface and timestamp.
Evade routing table: be used for storing the route route that need evade, main list item comprises purpose subnet address/subnet mask, next hop address, affiliated interface and timestamp.
Main protocol massages tabulation
Fault evades method for routing and system need send following protocol massages between router:
Hello packet: be used for learning between the adjacent router syntople and associated link, main field comprises Routing Protocol version number, type of message, router id, router IP and timestamp.
Devices advertise message (DA): router is by this message other router advertisements self in the network.Main field comprises Routing Protocol version number, type of message, type of message, router id, router IP and timestamp.
Link fault announcing (LFA): be used between router, announcing new detected link failure.Main field comprises the IP address of Routing Protocol version number, type of message, router one, IP address, malfunction and the timestamp of router two.
In terms of existing technologies, the fault that the present invention proposes evades method for routing and system is more simple, efficiently, and possesses good troubleshooting capability.
Description of drawings
Fig. 1 is method for routing overall framework of the present invention;
Fig. 2 is the fat tree network of being made up of 4 port switch that the present invention gives an example.
Embodiment
When considered in conjunction with the accompanying drawings, by the reference following detailed, can more completely understand the present invention better and learn wherein many attendant advantages easily, but accompanying drawing described herein is used to provide further understanding of the present invention, constitute a part of the present invention.
Because fault proposed by the invention is evaded method for routing and system is applicable to any data center network with rule topology structure, here we are how the example explanation uses the present invention with a kind of new types of data central site network structure-fat tree structure (Fat-tree).
Fat tree adopts the layer-3 switch with routing function to carry out networking, and this network configuration is divided into 4 layers, and top layer is core layer, and the second layer is convergence-level, and the 3rd layer of marginal layer, the bottom are server layers.In the fat tree structure, one group of k/2 polymer layer switch and one group of k/2 marginal layer switch constitute an independently pod, total total k pod in the network.Among each pod, the switch of polymer layer and marginal layer interconnects in twos, the residue k/2 of each a marginal layer switch port is used for connecting the k/2 station server, and the residue k/2 of each a polymer layer switch port connects k/2 platform core layer switch (k2/4 platform altogether) successively.Fat tree structure schematic diagram when Fig. 2 has provided k=4.
In fat tree structure, we adopt following addressing scheme to be each switch and IP address of server-assignment:
The IP address of convergence switch is set to: 10.pod.0.id.Wherein pod is the numbering of place pod, from left to right is respectively 1 to N.Id is the numbering of convergence switch in pod, from left to right is respectively 1 to N/2.
The IP address of edge switch is set to: 10.pod.id.1.Wherein pod is similarly the numbering of place pod, and id is the numbering of edge switch in pod, from left to right is respectively 1 to N/2.
The IP address of core switch is set to: 10.0.i.j.I represents that with j this switch is j core switch that is used for being connected i convergence switch among each pod, and i and j span are 1 to N/2.
The IP address of server is set to: 10.pod.switch.id.Pod is the numbering of this server place pod, the numbering of the edge switch that switch connects for this server, server under the same edge switch is formed a subnet, id represents the numbering of this server in the subnet of place, value from 2 to N/2+1.
Fault is evaded method for routing and each switch of system requirements and will be disposed a fault and evade method for routing route parts, these parts by link and neighbours' detection module, equipment training module, link failure derivation module, link failure training module, basis of formation router table means, make up evade router table means, the table of query and routing module amounts to 7 modules and constitutes.Wherein the course of work of link and neighbours' detection module, equipment training module, link failure derivation module, link failure training module is being perfectly clear that summary of the invention is partly explained, below we illustrate the basis of formation router table means, make up the course of work of evading router table means and table of query and routing module by example.
The course of work of basis of formation router table means
Utilize the systematicness of topology, each switch knows how to transmit packet.When edge switch is received a packet, judge at first whether the destination address of this packet is positioned at this switch place subnet.If then directly by two layers of exchange packet is sent to destination node.Otherwise this switch is transmitted to any one convergence switch in this pod to packet.When convergence switch was received a packet, whether this switch at first destination address of judgment data bag was positioned at its place pod.If switch is transmitted packet to corresponding edge switch.Otherwise switch is transmitted packet to any one core switch that links to each other.If core switch is received a packet, this switch then is forwarded to packet the convergence switch in the purpose pod.
Above-mentioned forwarding strategy is easy to express by basic routing table.The basic routing table of edge switch (such as 10.1.1.1) is made up of following clauses and subclauses:
Destination/Mask Next Hop
10.0.0.0/255.0.0.0 10.1.0.1
10.0.0.0/255.0.0.0 10.1.0.2
The basic routing table of convergence switch (such as 10.1.0.1) is made up of following clauses and subclauses:
The basic routing table of core switch (such as 10.0.1.1) is made up of following clauses and subclauses:
Structure is evaded the router table means course of work
The position of evading the route entry of routing table and link failure is relevant.In fat tree, link can be divided three classes according to its position: the link between (1) server and the edge switch; (2) link between edge switch and the convergence switch; (3) link between convergence switch and the core switch.The link occurs fault of the first kind only can have influence on the communication of associated server, to the not influence of routing table of switch.Discuss below second and the link occurs fault of the third type to the influence of routing table:
1) link occurs fault between edge switch and the convergence switch
Suppose edge switch 10.1.2.1(A) and convergence switch 10.1.0.1(B) between link fault has taken place, may can be divided into three kinds of situations through the communication of this link:
Source node is positioned at A place subnet, and destination node is positioned at all communications of other subnets.This situation only can have influence on the routing table of A.Because this link is the direct connected link of node A, when node A detects between A and the B after the link down, A only need be in basic routing table is next hop address that all route entrys deletions of B get final product, and need not add route entry in evading routing table.
Destination node is positioned at A place subnet, and source node is positioned at the communication of A place other subnets of pod.This situation can have influence on the route of all edge switch except A in the pod of A place.After a certain edge switch (being assumed to be 10.1.1.1) training is to A to the B link down, need evade clauses and subclauses of increase in the routing table at it:
Destination/Mask Next Hop
10.1.2.0/255.255.255.0 10.1.0.1
Destination node is A place subnet, and source node is positioned at the communication of other pod.This situation can have influence on the route of all edge switch in other pod.When a certain edge switch (being assumed to be 10.3.1.1) training after the link down between A and the B, because all will inevitably increase clauses and subclauses so 10.3.1.1 need evade at it through the link between A and the B through the route that 10.3.0.1 arrives A in the routing table:
Destination/Mask Next Hop
10.1.2.0/255.255.255.0 10.3.0.1
2) link failure between convergence switch and the core switch
Suppose convergence switch 10.1.0.1(A) and core switch 10.0.1.2(B) between link fault has taken place, may be divided into 2 kinds of situations through the communication of this link:
Source node is positioned at A place pod1, and destination node is positioned at the communication of other pod.Only can have influence on the route of A in this case.Because this link is the direct connected link of node A, after node A detected link down between A and the B, A only need be in basic routing table was next hop address that all route entrys deletions of B get final product, and need not add route entry in evading routing table.
Destination node is positioned at A place pod1, and source node is positioned at the communication of other pod.Can have influence on the route of convergence switch in other pod in this case.After this link down is arrived in a certain convergence switch (such as 10.3.0.1) training, because all will inevitably pass through this link through 10.0.1.2 to the route of A place pod1, so need evading at it, 10.3.0.1 increases clauses and subclauses in the routing table:
Destination/Mask Next Hop
10.1.0.0/255.255.0.0 10.0.1.2
The routing decision process
Fault is evaded method for routing and is carried out routing decision by inquiring about basic routing table and evading routing table.We are with 10.3.1.3 (source node) and 10.1.2.2(destination node) between communication process be the routing decision process that example explanation fault is evaded method for routing.Suppose: fault has taken place in the link of node 10.3.1.1 and 10.3.0.2 and node 10.1.0.1 and 10.0.1.2.Routing procedure is as follows:
Step1: source node 10.3.1.3 sends packet to his default route 10.3.1.1.
Step2: node 10.3.1.1 carries out route.
The calculated candidate route list
Node 10.3.1.1 inquires about its basic routing table, matches following route entry:
Destination/Mask Next Hop
10.0.0.0/255.0.0.0 10.3.0.1
Its candidate's route list={ 10.3.0.1}
Route list is evaded in calculating
Because the routing table of evading of this node is sky, therefore evade route list also for empty.
Calculating can be used route list
Therefore candidate's route list deducts evades route list for can use route list:
Can use route list={ 10.3.0.1}
Transmit packet to node 10.3.0.1
Step3: the routing procedure of node 10.3.0.1
The calculated candidate route list
Node 10.3.0.1 inquires about its basic routing table, matches following route entry:
Destination/Mask Next Hop
10.1.0.0/255.255.0.0 10.0.1.1
10.1.0.0/255.255.0.0 10.0.1.2
Candidate's route list={ 10.0.1.1,10.0.1.2}
Route list is evaded in calculating
Node 10.3.0.1 inquires about it and evades routing table, matches following route entry:
Destination/Mask Next Hop
10.1.0.0/255.255.0.0 10.0.1.2
Evade route list={ 10.0.1.2}
Calculating can be used route list
Therefore candidate's route list deducts evades route list for can use route list:
Can use route list={ 10.0.1.1}
Transmit packet to node 10.0.1.1
Step4: node 10.0.1.1 transmits packet to 10.1.0.1 by table of query and routing.
Step5: node 10.1.0.1 transmits packet to 10.1.2.1 by table of query and routing.
Step6: node 10.1.2.1 transmits packet to destination node 10.1.2.2 by two layers of exchange.
Used specific embodiment herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, part in specific embodiments and applications all can change.In sum, this description should not be construed as limitation of the present invention.
Claims (10)
1. the general method for routing of a data center network is characterized in that comprising following steps:
Step 1) link and neighbours detect step, and router sends and receive hello packet, the link that detection connects and the neighbor router of adjacency; Router-A is received the hello packet that router B sends over from port, and then router-A can know that router B is its adjacent device, and can know that the link that port connects is active link; Detected adjacent device and active link are kept in the adjacent device table;
Step 2) equipment training step, router sends with broadcast mode by the devices advertise message own; When receiving a devices advertise message, at first relatively whether the whole network equipment table has comprised this router, if do not comprise this router, then this router is inserted into the whole network equipment table, and this message is forwarded to all of the port except inbound port; If comprised this router, then directly abandon this message;
Step 3) link failure derivation step, according to study to router derive neighbor router and associated link failure, the result is saved in adjacent device table and the total network links bug list;
Step 4) link failure training step, router are encapsulated into the link failure of oneself in the link fault announcing message and broadcast away, and according to other link failures in the message learning network that receives, the result is saved in the total network links bug list;
Step 5) basis of formation routing table and evade routing table;
The step 6) table of query and routing.
2. the general method for routing of a kind of data center network according to claim 1, it is characterized in that, described step 3) further comprises: position encoded in its IP address each router, and then judge whether adjacency of two routers according to the IP address of router; Derive all by relatively whole network equipment table and adjacent device table and can not survey neighbor router, can not survey neighbor router for each, and then infer that this can not be surveyed and have a faulty link between neighbor router and the current router.
3. the general method for routing of a kind of data center network according to claim 1 is characterized in that, described step 4) further comprises: when receiving a link fault announcing message, at first relatively whether the total network links bug list has comprised this link failure; If do not comprise this link failure, then this link failure is inserted into the total network links bug list, and this message is forwarded to all of the port except inbound port; If comprised this link failure, then directly abandon this message.
4. the general method for routing of a kind of data center network according to claim 1 is characterized in that, described step 5) further comprises:
Basis of formation routing table step, the rule topology structure of utilizing network to have is obtained under the situation of full mesh topology information not needing, and calculates the path that arrives the required process of any destination address of network, again in conjunction with the adjacent device table, constructs basic routing table;
Structure is evaded the routing table step, utilizes the total network links bug list, and the network topology structure of binding rule calculates all route entrys through faulty link of place router, forms and evades routing table.
5. the general method for routing of a kind of data center network according to claim 1, it is characterized in that, described step 6) further comprises: at first inquire about basic routing table with the destination address that sends packet as querying condition, adopt the principle of long coupling, inquire one group of route entry that satisfies the coupling destination address, form candidate's route list; With the destination address that sends packet as querying condition inquiry evade routing table, the route entry on all couplings is formed and is evaded route list; Candidate's route list deducts evades route list and forms and can use route list; Select any address as next jumping this packet to be sent in the route list from using; If can use route list for empty, then abandon this packet.
6. the general route system of a data center network is characterized in that comprising:
Link and neighbours' detection module, router send and receive hello packet, detect the link that connects and the neighbor router of adjacency, and testing result is saved in the adjacent device table;
The equipment training module, router sends with broadcast mode by the devices advertise message own; When receiving a devices advertise message, at first relatively whether the whole network equipment table has comprised this router, if do not comprise this router, then this router is inserted into the whole network equipment table, and this message is forwarded to all of the port except inbound port; If comprised this router, then directly abandon this message;
The link failure derivation module, according to study to router derive neighbor router and associated faulty link, the result is saved in adjacent device table and the total network links bug list;
The link failure training module, router is encapsulated into a link road fault notification message to the link failure of oneself and broadcasts away, and according to other link failures in the message learning network that receives, the result is saved in the total network links bug list;
Basis of formation router table means and fault router table means;
The table of query and routing module.
7. the general route system of a kind of data center network according to claim 6, it is characterized in that, described link failure derivation module further comprises: position encoded in its IP address each router, and then judge whether adjacency of two routers according to the IP address of router; Derive all by relatively whole network equipment table and adjacent device table and can not survey neighbor router, can not survey neighbor router for each, and then infer that this can not be surveyed and have a faulty link between neighbor router and the current router.
8. the general route system of a kind of data center network according to claim 6, it is characterized in that, described link failure derivation module further comprises: when receiving a link fault announcing message, at first relatively whether the total network links bug list has comprised this link failure; If do not comprise this link failure, then this link failure is inserted into the total network links bug list, and this message is forwarded to all of the port except inbound port; If comprised this link failure, then directly abandon this message.
9. the general route system of a kind of data center network according to claim 6 is characterized in that:
The basis of formation router table means, the rule topology structure of utilizing network to have is obtained under the situation of full mesh topology information not needing, and calculates the path that arrives the required process of any destination address of network, again in conjunction with the adjacent device table, constructs basic routing table;
Make up the fault router table means, utilize the total network links bug list, the network topology structure of binding rule calculates all route entrys through faulty link of place router, forms and evades routing table.
10. the general route system of a kind of data center network according to claim 6, it is characterized in that, described table of query and routing module further comprises: at first inquire about basic routing table with the destination address that sends packet as querying condition, adopt the principle of long coupling, inquire one group of route entry that satisfies the coupling destination address, form candidate's route list; With the destination address that sends packet as querying condition inquiry evade routing table, the route entry on all couplings is formed and is evaded route list; Candidate's route list deducts evades route list and forms and can use route list; Select any address as next jumping this packet to be sent in the route list from using; If can use route list for empty, then abandon this packet.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310169008.6A CN103281247B (en) | 2013-05-09 | 2013-05-09 | The general method for routing of a kind of data center network and system |
| PCT/CN2014/077071 WO2014180332A1 (en) | 2013-05-09 | 2014-05-08 | Universal routing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310169008.6A CN103281247B (en) | 2013-05-09 | 2013-05-09 | The general method for routing of a kind of data center network and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103281247A true CN103281247A (en) | 2013-09-04 |
| CN103281247B CN103281247B (en) | 2016-06-15 |
Family
ID=49063701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310169008.6A Active CN103281247B (en) | 2013-05-09 | 2013-05-09 | The general method for routing of a kind of data center network and system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103281247B (en) |
| WO (1) | WO2014180332A1 (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103997462A (en) * | 2014-05-19 | 2014-08-20 | 清华大学 | Multicast strategy routing scheme based on convex hull convergence algorithm |
| WO2014180332A1 (en) * | 2013-05-09 | 2014-11-13 | 中兴通讯股份有限公司 | Universal routing method and system |
| CN105282036A (en) * | 2014-06-18 | 2016-01-27 | 深圳市中兴微电子技术有限公司 | Routing node and route exchange method and system |
| CN107547279A (en) * | 2017-09-08 | 2018-01-05 | 江门市知了科技有限公司 | A kind of system and method for automatically processing network failure |
| CN108429686A (en) * | 2018-01-25 | 2018-08-21 | 北京交通大学 | A kind of method for routing of rule-based topological structure network |
| WO2018219103A1 (en) * | 2017-05-31 | 2018-12-06 | 华为技术有限公司 | Method and device for determining link state |
| CN109862077A (en) * | 2019-01-03 | 2019-06-07 | 南京海兴电网技术有限公司 | Based on Internet of Things communication with container technique with electrical equipment management method |
| CN111510365A (en) * | 2020-03-31 | 2020-08-07 | 杭州博联智能科技股份有限公司 | Wi-Fi data packet-based device bridging cloud method, device and medium |
| CN112272143A (en) * | 2020-12-12 | 2021-01-26 | 广东睿江云计算股份有限公司 | Route learning and forwarding method |
| CN113347095A (en) * | 2021-08-02 | 2021-09-03 | 中国人民解放军国防科技大学 | Evasion routing path selection method and device based on segmented routing technology |
| CN113518034A (en) * | 2021-05-07 | 2021-10-19 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
| CN113706739A (en) * | 2021-07-09 | 2021-11-26 | 中联重科土方机械有限公司 | Remote fault diagnosis processing method, platform and system |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515986B (en) * | 2015-12-02 | 2018-09-14 | 北京锦鸿希电信息技术股份有限公司 | Train Communication Network data processing method and system |
| CN105391590B (en) * | 2015-12-26 | 2018-06-19 | 深圳职业技术学院 | The method and system of System Routing Table under a kind of automatic acquisition NUMA architecture |
| CN107241307B (en) * | 2017-04-26 | 2023-08-08 | 北京立思辰计算机技术有限公司 | Self-learning network isolation safety device and method based on message content |
| CN115225561B (en) * | 2022-08-15 | 2022-12-06 | 南京邮电大学 | Route optimization method and system based on graph structure characteristics |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101309525A (en) * | 2008-06-30 | 2008-11-19 | 中兴通讯股份有限公司 | Route recovery method according to failure positioning in automatic exchange optical network |
| CN102202333A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Routing method of wireless ad hoc network used for small satellite constellation communication |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281247B (en) * | 2013-05-09 | 2016-06-15 | 北京交通大学 | The general method for routing of a kind of data center network and system |
-
2013
- 2013-05-09 CN CN201310169008.6A patent/CN103281247B/en active Active
-
2014
- 2014-05-08 WO PCT/CN2014/077071 patent/WO2014180332A1/en active Application Filing
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101309525A (en) * | 2008-06-30 | 2008-11-19 | 中兴通讯股份有限公司 | Route recovery method according to failure positioning in automatic exchange optical network |
| CN102202333A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Routing method of wireless ad hoc network used for small satellite constellation communication |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014180332A1 (en) * | 2013-05-09 | 2014-11-13 | 中兴通讯股份有限公司 | Universal routing method and system |
| CN103997462B (en) * | 2014-05-19 | 2017-04-19 | 清华大学 | Multicast strategy routing scheme based on convex hull convergence algorithm |
| CN103997462A (en) * | 2014-05-19 | 2014-08-20 | 清华大学 | Multicast strategy routing scheme based on convex hull convergence algorithm |
| CN105282036A (en) * | 2014-06-18 | 2016-01-27 | 深圳市中兴微电子技术有限公司 | Routing node and route exchange method and system |
| US11245615B2 (en) | 2017-05-31 | 2022-02-08 | Huawei Technologies Co., Ltd. | Method for determining link state, and device |
| WO2018219103A1 (en) * | 2017-05-31 | 2018-12-06 | 华为技术有限公司 | Method and device for determining link state |
| CN108989204A (en) * | 2017-05-31 | 2018-12-11 | 华为技术有限公司 | A kind of link state determines method and apparatus |
| CN107547279A (en) * | 2017-09-08 | 2018-01-05 | 江门市知了科技有限公司 | A kind of system and method for automatically processing network failure |
| CN108429686A (en) * | 2018-01-25 | 2018-08-21 | 北京交通大学 | A kind of method for routing of rule-based topological structure network |
| CN108429686B (en) * | 2018-01-25 | 2020-07-07 | 北京交通大学 | Routing method based on regular topological structure network |
| CN109862077A (en) * | 2019-01-03 | 2019-06-07 | 南京海兴电网技术有限公司 | Based on Internet of Things communication with container technique with electrical equipment management method |
| CN111510365A (en) * | 2020-03-31 | 2020-08-07 | 杭州博联智能科技股份有限公司 | Wi-Fi data packet-based device bridging cloud method, device and medium |
| CN112272143A (en) * | 2020-12-12 | 2021-01-26 | 广东睿江云计算股份有限公司 | Route learning and forwarding method |
| CN112272143B (en) * | 2020-12-12 | 2021-03-30 | 广东睿江云计算股份有限公司 | Route learning and forwarding method |
| CN113518034A (en) * | 2021-05-07 | 2021-10-19 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
| CN113518034B (en) * | 2021-05-07 | 2023-08-15 | 中国移动通信集团陕西有限公司 | Method, device, equipment and storage medium for route detection |
| CN113706739A (en) * | 2021-07-09 | 2021-11-26 | 中联重科土方机械有限公司 | Remote fault diagnosis processing method, platform and system |
| CN113347095A (en) * | 2021-08-02 | 2021-09-03 | 中国人民解放军国防科技大学 | Evasion routing path selection method and device based on segmented routing technology |
| CN113347095B (en) * | 2021-08-02 | 2021-11-05 | 中国人民解放军国防科技大学 | Evasion routing path selection method and device based on segmented routing technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103281247B (en) | 2016-06-15 |
| WO2014180332A1 (en) | 2014-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103281247A (en) | Universal routing method and universal routing system of data center network | |
| US10673741B2 (en) | Control device discovery in networks having separate control and forwarding devices | |
| CN101883048B (en) | Routing method of multi-dimensional network | |
| CN102368727B (en) | Crossed IP network TRILL network communication method, system thereof and devices | |
| CN102037685B (en) | IP forwarding across a link state protocol controlled Ethernet network | |
| CN101897151B (en) | IP network and performance monitoring using Ethernet OAM | |
| CN104283789B (en) | Route convergent method and system | |
| CN103873373A (en) | Multicast data message forwarding method and equipment | |
| CN104378297A (en) | Message forwarding method and device | |
| CN103166876A (en) | Transmission method for data among OpenFlow network domains and device | |
| CN102413061A (en) | Message transmission method and equipment | |
| CN102255757B (en) | Link switching method and device | |
| CN102932254A (en) | Message forwarding method and device | |
| CN105812259A (en) | Packet forwarding method and device | |
| CN106131919B (en) | A kind of synchronous method of non-stop layer self-organized network topology | |
| CN103765808A (en) | Utility communication method and system | |
| CN102185772B (en) | Method for routing data centre network system | |
| CN102780615B (en) | Link backup method and routing forwarding device | |
| CN102055665A (en) | OSPF point-to-multipoint over broadcast or NBMA mode | |
| CN102957589A (en) | Method, network node and system for service data transmission | |
| JP2013026829A (en) | Transmission system and control method of transmission system | |
| CN101588303A (en) | A kind of link status notice information interaction method and OSPF equipment | |
| CN102984070A (en) | Method for realizing data forwarding through unnumbered interface of Ethernet | |
| CN102238057A (en) | Ethernet-tree realization method, system, device and network equipment | |
| CN109716823B (en) | Outdoor lighting network as an emergency connection infrastructure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: ZTE CORPORATION Effective date: 20140107 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Sun Yantao Inventor after: Liu Qiang Inventor after: Cheng Jing Inventor after: Liu Bin Inventor after: Song Xiaoli Inventor after: Wang Lingqiang Inventor before: Sun Yantao Inventor before: Liu Qiang Inventor before: Cheng Jing |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: SUN YANTAO LIU QIANG CHENG JING TO: SUN YANTAO LIU QIANG CHENG JING LIU BIN SONG XIAOLI WANG LINGQIANG |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20140107 Address after: 100044 Beijing city Haidian District Xizhimen Shangyuan Village No. 3 Applicant after: Beijing Jiaotong University Applicant after: ZTE Corporation Address before: 100044 Beijing city Haidian District Xizhimen Shangyuan Village No. 3 Applicant before: Beijing Jiaotong University |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |