CN101309201A - Route processing method, routing processor and router - Google Patents
Route processing method, routing processor and router Download PDFInfo
- Publication number
- CN101309201A CN101309201A CNA2007101020835A CN200710102083A CN101309201A CN 101309201 A CN101309201 A CN 101309201A CN A2007101020835 A CNA2007101020835 A CN A2007101020835A CN 200710102083 A CN200710102083 A CN 200710102083A CN 101309201 A CN101309201 A CN 101309201A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- unit
- task
- processors
- 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
-
- 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/02—Topology update or discovery
- H04L45/03—Topology update or discovery by updating link state protocols
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention embodiment discloses a route processing method which includes that the connections among the nodes in the network are established; the nodes are processed with task scheduling; the nodes operate the link-state routing protocol, process route computation and obtain the route results according to the scheduled tasks; the route computation results of the nodes are acquired and the route summarization is processed. The invention embodiment also provides a route processor which includes a task scheduling module used for the task scheduling, a protocol operation module used for operating the link-state routing protocol according to the scheduled tasks, computing the routes and obtaining the route computation results and a route summarization module used for summarizing the route computation results. The invention embodiment also provides a router which has multi-route processor frame. The technical proposal provided by the route processing method can realize the extensibility of the link-state routing protocol.
Description
Technical field
The present invention relates to computer networking technology, be specifically related to a kind of route processing method, route processors and router of link-state routing protocol.
Background technology
In the internet, normally realize internet message forwarding by router.What instruct router to make to transmit decision is forwarding information base.This forwarding information base comes from the routing iinformation that different routing protocol provides.The Routing Protocol of router operation can be divided into the Border Gateway Protocol between autonomous system and the Interior Gateway Protocol of autonomous system inside by the application scenario.Wherein, autonomous system is meant the world-wide web by single management mechanism for implementing management strategy.Link-state routing protocol is a current application Interior Gateway Protocol the most widely, mainly contains OSPF OSPF (Open Shortest Path FirstProtocol) and intermediate system to intermediate syst ISIS (Intermediate System to IntermediateSystem Routing Protocol).Link-state routing protocol is based on shortest-path first algorithm, its running is: find and the maintenance agreement by specific neighbours, find router each neighbours on every side, and with its reliable inundation mechanism, the link-local information of each router forms so-called LSD in the link-state routing protocol in diffusion and the collection autonomous system.Like this, the router of each operation link-state routing protocol will soon obtain the panorama information about whole network topological diagram, and reaches an agreement.To this database application shortest-path first algorithm, just can obtain the all-network reachability information of autonomous system, form the routing table of link-state routing protocol, and these routes are loop-free.Then, the routing table of link-state routing protocol is handed down to the overall routing table of router, by the routing iinformation that this overall situation routing table comprehensively obtains from different routing protocol, select optimum route according to certain rule, form the forwarding information base that datum plane instructs message to transmit.
Traditional link-state routing protocol operational mode normally, one or more Routing Protocol (comprising link-state routing protocol) is as an operating system task, operate on the route processors of router control plane, that is to say that agreement operation is handled, route is calculated and functions such as management control all concentrate on the single route processors and carry out.Under this operational mode, the capacity of neighbours' sum that link-state routing protocol can be supported and routing capacity computing capability that depends on this route processors and the physical memory that is equipped with.And along with the network design of the expansion and the flattening of network size, the user wishes that usually neighbours' sum and routing capacity that link-state routing protocol can be supported can improve along with the increase of hardware resources such as route processors, realize the expansion of link-state routing protocol, traditional link-state routing protocol operational mode can't realize the expansion of link-state routing protocol because concentrate on the single route processors.
Summary of the invention
The technical problem that the embodiment of the invention will solve provides a kind of route processing method, route processors and router, can realize the expansion of link-state routing protocol.
The embodiment of the invention provides a kind of route processing method, comprising: set up each internodal connection in the network, each node is carried out task scheduling; Each node is according to the task run link-state routing protocol of described scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating; Obtain the described route result of calculation of each node and go forward side by side walking along the street by gathering.
The embodiment of the invention provides a kind of route processors, comprising: task scheduling modules is used to carry out task scheduling; Agreement operation module is used for the task run link-state routing protocol by scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating; The route summarizing module is used for that route result of calculation is carried out route and gathers.
The embodiment of the invention provides a kind of router, comprises a plurality of route processorss, and described route processors comprises: task scheduling modules is used to carry out the task scheduling between route processors; Agreement operation module is used for the task run link-state routing protocol by scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating; The route summarizing module is used for that route result of calculation is carried out route and gathers.
As can be seen from the above technical solutions, link-state routing protocol operational mode of the prior art is because concentrate on the single route processors, be subjected to the restriction of the disposal ability of route processors own, can't realize the expansion of link-state routing protocol, and embodiment of the invention scheme is: set up each internodal connection in the network, each node is carried out task scheduling; Each node is according to the task run link-state routing protocol of described scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating; Obtain the described route result of calculation of each node and go forward side by side walking along the street by gathering.Because under the operational mode of the embodiment of the invention, the task scheduling of link-state routing protocol, agreement can be carried out and route gather operation to dynamically distribute to each node be on each route processors, so can make full use of the resource of each node, thereby realize the extensibility of link-state routing protocol.
Description of drawings
Fig. 1 is embodiment of the invention link-state routing protocol distributed model figure;
Fig. 2 is an embodiment of the invention route processing method flow chart;
Fig. 3 is for carrying out the flow chart of task scheduling in the embodiment of the invention route processing method;
Fig. 4 is an embodiment of the invention dispatch state machine schematic diagram;
Fig. 5 is an embodiment of the invention routing table state machine diagram;
Fig. 6 is the schematic diagram that establishes a connection between embodiment of the invention node;
Fig. 7 is an active allocating task flow chart in the embodiment of the invention route processing method;
Fig. 8 is a passive allocating task flow chart in the embodiment of the invention route processing method;
Fig. 9 is an application network schematic diagram of embodiment of the invention route processing method;
Figure 10 is relevant information one schematic diagram in the application network of embodiment of the invention route processing method;
Figure 11 is relevant information two schematic diagrames in the application network of embodiment of the invention route processing method;
Figure 12 is relevant information three schematic diagrames in the application network of embodiment of the invention route processing method;
Figure 13 is an embodiment of the invention route processors structural representation;
Figure 14 is an embodiment of the invention route processors task scheduling modules structural representation;
Figure 15 is an embodiment of the invention router topology schematic diagram.
Embodiment
Traditional link-state routing protocol operational mode is because concentrate on the single route processors, be subjected to the restriction of the disposal ability of route processors own, can't realize the expansion of link-state routing protocol, a kind of route processing method that the embodiment of the invention provides, dynamically distribute on a plurality of route processorss by the function that link-state routing protocol is contained, thereby can realize the extensibility of link-state routing protocol.
The multirouting processor operation framework of router generally is made up of two parts: plurality of nodes and the internal communication network between them.These nodes are typically organized as a kind of distributed master slave relation, are host node with certain node promptly, and other nodes are distributed from node.Wherein, each node comprises: route processors is used for moving router control plane tasks such as Routing Protocol; External interface is used for receiving and send route control message by the outer switching network that links to each other with Forwarding plane; Internal interface is used for receiving and send message by the inner exchanging network and finishes intercommunication between each node.
Convenience for describing hereinafter abbreviates route processors as node.
The distributed model of the link-state routing protocol of the embodiment of the invention comprises task scheduling modules, agreement operation module and routing table summarizing module.Wherein, task scheduling modules is used for be responsible for finding and safeguards annexation between each node, and carries out Task Distribution according to the node processing ability; Agreement operation module is used for the link-state routing protocol basic according to the task run that is distributed; The routing table summarizing module is used to be responsible for compiling the local routing table of each node.
The task scheduling algorithm of the embodiment of the invention comprises a dispatch state machine and a routing table state machine.Wherein, the dispatch state machine is divided into the master scheduling state by the decision-making power of Task Distribution with each node state, the backup dispatch state, and from dispatch state.The function of dispatch state machine comprises: set up and safeguard relation between each node of distributed system; Election master scheduling node, backup scheduling node and from scheduling node; Carry out Task Distribution etc.The routing table state machine gathers task executions power by routing table each node state is divided into main summary status, backup summary status and from summary status, and finish the operation that gathers of each local routing table.
Introduce the technical scheme of the embodiment of the invention in detail below in conjunction with accompanying drawing.
Under the scheduling of dispatch state machine, distributed implementation model can be mapped as specific moving model according to concrete scheduling strategy.Fig. 1 has promptly shown a link-state routing protocol distributed model sample.Wherein mark 22 is represented a router, node of mark 33 expressions, and intranodal three circles from top to bottom are three parts under the distributed model: task scheduling modules, agreement operation module and routing table summarizing module.By the scheduling of dispatch state machine, can be by several allocation models.A kind of allocation model is shown in A, under the control of dispatch state machine, finish agreement operation and the Task Distribution of routing table collection work on a plurality of nodes, each node all carry on an agreement the operation and routing table gather, at this moment the routing table summarizing module on each node will only be finished local routing iinformation and gather, and being issued to the overall routing table of router, the overall routing table of router is stored in other internal memories of router.Another kind of allocation model allows the master scheduling node carry out routing table and gathers shown in B, and the master scheduling node is just main simultaneously so gathers node, at this moment needs the main overall routing table that just can be issued to router after node gathers the routing iinformation of each node that gathers.Also have a kind of allocation model shown in C, further under the scheduling of routing table state machine, routing table is gathered operation be distributed on the non-master scheduling node and carry out.The embodiment of the invention will mainly be introduced with pattern shown in the B but be not limited to this.
Seeing also Fig. 2, is embodiment of the invention route processing method flow chart, comprising:
A1, carry out task scheduling;
Before introducing this step content in detail, introduce the process of dispatch state machine earlier.
Fig. 4 has shown the dispatch state machine.It with each node division is: " un-activation " state, and under this state, node does not move link-state routing protocol; " wait " state, node can move link-state routing protocol but not enter into mode of operation; Mode of operation is divided into " master scheduling " by the decision-making power of Task Distribution again, " backup scheduling " and " from scheduling " state.The dispatch state machine is finished following function under the driving of trigger event: set up and safeguard between each node of distributed system and concern; Carry out master scheduling node, backup scheduling node and from the election of scheduling node; Carry out Task Distribution etc.
As shown in Figure 4, if node stops Routing Protocol under any state, then be transitted towards " un-activation " state, after starting Routing Protocol, to " wait " state, start timer by " un-activation " status change, and heartbeat message is broadcasted in beginning on internal communication network.Behind timer expiry, carry out the election of master scheduling node, rule be election " disposal ability " value maximum be the master scheduling node, secondly be the backup scheduling node, remaining is from scheduling node, when " disposal ability " is worth when identical, then compare its inner networking address value, rule generally be election networking address value maximum as the master scheduling node, secondly be the backup scheduling node, remaining is from scheduling node.Backup scheduling node and distribute by the master scheduling node from the task of scheduling node.
B1, set up and Maintenance Point between concern election master scheduling node, backup scheduling node and from scheduling node;
When network system had just started, each node was known each other existence by the periodic broadcasting heartbeat message, and elected master scheduling node and backup scheduling node according to its disposal ability, and all the other are from scheduling node.The information of disposal ability is carried in heartbeat message.After this, only to the master scheduling node jumping message of making up one's mind, the master scheduling node is then at internal network broadcasting heartbeat message from scheduling node.
5 node A, B, C, D and E for example shown in Figure 6 after the configuration order that receives operation OSPF, to " wait " state, start timer by " un-activation " status change, and heartbeat message are broadcasted in beginning on internal communication network.In the form of heartbeat message, with 0-1 bit representation type field, 2-3 bit representation status field, 4-7 bit representation address field, 8-9 bit representation disposal ability territory.Because current each node state all is " wait ", the value of the status field of heartbeat message all is " wait ", and " disposal ability " territory then is the rest processing capacity of node present node.By the broadcasting heartbeat message, each node has all obtained neighbours' information, has constituted following neighbor list.
| Node | State | Disposal ability |
| A | Wait for | 8 |
| B | Wait for | 6 |
| C | Wait for | 3 |
| D | Wait for | 2 |
| E | Wait for | 3 |
The state of node A, B, C, D and E is for waiting for that processing ability value is respectively 8,6,3,2,3 in this table.Behind timer expiry, each node begins to carry out master scheduling node election, rule be from the neighbours' set that obtains, find " disposal ability " value maximum be the master scheduling node, secondly for backing up scheduling node, all the other are from scheduling node.When " disposal ability " is worth when identical, its inner networking address value relatively then, rule generally be election networking address value maximum as the master scheduling node, secondly for backing up scheduling node, remaining is from scheduling node.So node A is elected as the master scheduling node, B is elected as the backup scheduling node, and C, D and E are from scheduling node.Therefore, node A and B are transitted towards " master scheduling " state and " backup scheduling " state respectively, and node C, D and E all are transitted towards " from scheduling " state.After this, A is to inner networking periodic broadcasting heartbeat message, and its status field is " master scheduling ", and B, C, D and E then only send heartbeat message to A, and the B status field is " backup scheduling ", and C, D and E status field are " from scheduling ".
Add fashionablely as new node F, the state of F node is " wait ", and it starts timer, and beginning is to inner Web broadcast heartbeat message.Because B, C, D and E state at this moment is non-" master scheduling ", the state that they will be ignored from F is the heartbeat message of " wait ", and A state this moment is " master scheduling ", and it adds neighbor list with F.On the other hand, because A can the periodic broadcasting status field be the heartbeat message of " master scheduling ", this regular time is the time-out time less than timer, after F receives heartbeat message from A, find that there has been the master scheduling node in internal network, so " discovery master scheduling " incident of generation, node F is transitted towards state " from scheduling " by " wait ", and from then on only sends heartbeat message to A.
B2, master scheduling node carry out Task Distribution;
After the master scheduling node elects out, begin to carry out the original allocation of task by the master scheduling node.Carry out Task Distribution by the dispatch state machine in this step.
According to link-state routing protocol common application scenarios in network, the dispatch state machine can adopt the distribution of executing the task of different fractionation units.Said different fractionation unit is meant a plurality of zones that the multiple virtual private network (VPN) VPN of link-state routing protocol (Virtual private network) example for example, multi-protocols process are connected with Area Border Router in the link-state routing protocol etc.
The many VPN instance of link-state routing protocol are meant the Routing Protocol example that runs under each VPN, and each example is only finished the routing function in this VPN, and are irrelevant with the route example under other VPN.Link-state routing protocol multi-protocols process is meant that each protocol process operates in a part of network separate under the same autonomous system, and promptly so-called agreement routed domain is finished routing function in this independently sub-routed domain, also uncorrelated mutually each other.Area Border Router is that link-state routing protocol is to being connected to the definition of the router in a plurality of zones in the autonomous system simultaneously.Link-state routing protocol is divided into a plurality of zones to whole autonomous system in order to expand the support to the extensive autonomous system of majority amount.These zones are divided into backbone area and non-backbone area simultaneously again.Backbone area must be communicated with physically or in logic, and each non-backbone area must keep being connected with this backbone area.Junction point between zone and the zone is exactly an Area Border Router, and other router then is called Intra-Domain Router.Intra-Domain Router is finished routing function in the one's respective area by the operation shortest path first, Area Border Router then is responsible for routing iinformation in the All Ranges is flooded to other zone with the form of making a summary, to assist Intra-Domain Router to finish interregional routing function, the method for the interregional route of this realization of link-state routing protocol has been used the horizontal split plot design in the distance vector Routing Protocol.Therefore Area Border Router has in fact all moved shortest path first on each zone that is connected, and different zones all is relatively independent network.
Three kinds of irrelevances described above can become the task allocation algorithms of dispatch state machine.When the multizone with Area Border Router was the unit of division, each processing node moved certain specific zone, safeguards the neighborhood in this zone, link-state information that synchronously should the zone.When being distributed Task Distribution unit with many VPN instance or multi-protocols process, each node can move several link-state routing protocol processes, and each process all is an independently link-state routing protocol.In concrete realization, a config option can be provided, allow the user do final selection according to the concrete application scenarios of agreement.
The following content of the embodiment of the invention is that example describes with the ospf protocol of link-state routing protocol, and carries out Task Distribution with a plurality of region allocation units of Area Border Router.
In the relation of determining between processing node, elect the master scheduling node after, the master scheduling node of " master scheduling " state triggers " active tasks distribution " incident when receiving route control message, carry out active tasks batch operation process shown in Figure 7; " backup scheduling " down the backup scheduling node or " from scheduling " state down receiving route when controlling message from scheduling node, triggering " passive Task Distribution " incident is carried out passive Task Distribution operating process shown in Figure 8.
See also Fig. 7, shown active tasks batch operation process comprises:
C1, reception route control message;
C2, judge that whether this message Processing tasks be responsible for by this node, if, change step C3 over to, if not, change step C4 over to;
Whether the master scheduling node can be judged this message Processing tasks and be responsible for by this node by search relevant information in the local interface tabulation.
C3, will handle this route control message;
Whether C4, this message Processing tasks are assigned with, if, change step C6, if not, change step C5;
Whether the master scheduling node can be judged this message Processing tasks and be assigned with by search relevant information in the zone list of task allocation map table.
C5, node of appointment are responsible for this message Processing tasks, enter step C6;
C6, to corresponding node transmission interface information, notify its adding task;
C7, modification interface map list information.
See also Fig. 8, shown passive Task Distribution operating process comprises:
D1, reception route control message;
D2,, judge that whether this message Processing tasks be responsible for by this node, if, change step D3 over to, if not, change step D4 over to.
The backup scheduling node or from scheduling node by local interface tabulation, searching relevant information, can judge this message Processing tasks and whether be responsible for by this node.
D3, will handle this route control message;
D4, abandon this route control message.
Be specifically described below in conjunction with an application network example shown in Figure 9.Fig. 9 comprises area0 Intra-Domain Router RT1, RT2 and area1 Intra-Domain Router RT4, also comprises Area Border Router RT3, comprises that in addition network n1 is to n6.Area Border Router RT3 by three interfaces, is respectively if0, and if1, if2 are connected among 2 area, are respectively area0 and area1.RT3 is made up of three nodes, is respectively A, B and C, and current state is followed successively by " master scheduling ", " backup scheduling " and " from scheduling ", and promptly A, B and C are respectively master scheduling node, backup scheduling node and from scheduling node.
A kind of possible Task Distribution result is: C is responsible for the task of area0, and B is responsible for the task of area1.Concrete operations are as follows: when initial, the data of each node and Forwarding plane as shown in figure 10.Forwarding plane is received the OSPF message from interface if0, and it is chosen the acquiescence mode and broadcast this message to whole distributed system according to interface map list (current is empty), so A, B and C receive the OSPF message that interface if0 sends, it has area0 information.B and C do not find if0 information in the local interface tabulation of oneself, judge this task can't help own responsible, so abandon the OSPF message.A does not at first find if0 information yet in the local interface tabulation of oneself, judge that this task can't help oneself to be responsible for, then, A checks whether this task distributes, its in the zone list of task allocation map table (is empty this moment) is sought area0, but do not find, so judge that this task is also unallocated, then area0 is joined in the zone list of Task Distribution mapping table, and, obtain allocation result like this and be responsible for the area0 task for specifying C by the node C that releases current residual disposal ability maximum in " disposal ability " tactic node queue.A will carry out following operation: the node in the area0 correspondence of the zone list of task allocation map table is inserted C, and it is C that interface if0 corresponding port is set in interface map list, sends message to C, notifies it to add new task if0.So obtain result shown in Figure 11.
In this process, A also is responsible for termly to Forwarding plane passing interface mapping table.As shown in figure 11.Forwarding plane will adopt mode of unicast that message is sent to corresponding node according to the interface in message source and the content of interface map list when receiving the OSPF message.Therefore, when Forwarding plane once more when control plane sends message from interface if0, will directly issue C to message, thereby reduce the processing expenditure on A and the B.
Similarly, when A receives the OSPF message that interface if2 sends, it has area1 information.B still does the processing identical with the front with C.A also does similar processing, adds area1 in the zone list with the Task Distribution mapping table, and releases the Node B of current residual disposal ability maximum in node queue, obtains allocation result and is responsible for the area1 task for specifying B.A carries out following operation for this reason: the node in the area1 correspondence of the zone list of task allocation map table is inserted B, and it is B that interface if2 corresponding port is set in interface map list, sends message to B, notifies it to add new task if2.
When A receives the OSPF message that interface if1 sends, it has area0 information.B still does the processing identical with the front with C.A is owing to find area0 in the zone list of task allocation map table, learn that the area0 task distributed to C, is C so interface if1 corresponding port directly is set in interface map list, sends message to C, notifies it to add new task if1.So obtain the result of Figure 12.
Like this, C and B are assigned to task area0 and area1 respectively, and its interface that contains is respectively if0, if1 and if2.Message from interface if0 and if1 will directly send to node C, will directly send to Node B from the message of interface if2.
Generally, top content description the embodiment of the invention carry out the method for Task Distribution, it is carried out active tasks by node and distributes under " master scheduling " state, under " backup scheduling " or " from scheduling " state, carry out passive Task Distribution, task allocation algorithms is focused on the master scheduling node to be finished, and guarantee that corresponding task can directly send on the corresponding processing node from Forwarding plane, like this, each node will receive only the routing iinformation in the area that oneself is responsible for, and independently carry out route then and calculate.
The master of B3, election and broadcasting routing table gathers node.
The master scheduling node is according to the disposal ability that receives each node that heartbeat message collects, and selects mainly to gather that node, backup gather node and from gathering node, and by inside story it issued each node.
Here adopt the routing table state machine to dispatch.The dispatching algorithm of routing table state machine depends on the algorithm of dispatch state machine.The routing table state machine, as shown in Figure 5, it and dispatch state machine are similar, and with each node division be: " wait " state, node does not enter mode of operation, does not promptly need to carry out the associative operation that routing table gathers.Under mode of operation, each node state is divided into " main gathering ", " backup gathers " and " from gathering " state by the decision-making power of Task Distribution.If node stops Routing Protocol under any state, then be transitted towards " un-activation " state, after starting Routing Protocol, to " wait " state, start timer by " un-activation " status change, and heartbeat message is broadcasted in beginning on internal communication network.Behind timer expiry, carry out the route relation of gathering and determine.
Route gathers and concerns deterministic process, and the routing state that refers to each node is by one of " wait " status change three kinds of states under the mode of operation, and promptly the initialization procedure of routing table state machine is generally synchronous with dispatch state machine initialization procedure.In the master scheduling node election process of dispatch state machine, each node by " wait " status change one of three kinds of states to scheduling, also is the trigger event of routing table state machine as dispatch state machine " timer expiry " incident and " discovery master scheduling " incident of triggering this operation respectively.Correspondingly, by the node of " wait " status change to " master scheduling " state, its routing table state machine also will be by " wait " status change to " main gathering " state in the dispatch state machine.That is to say that the initialization of routing table state machine is identical with the initialization of dispatch state machine, the also responsible routing table of node that acquiescence is carried out master scheduling gathers, and just the master scheduling node also is simultaneously the main node that gathers.
A2, each node operation link-state routing protocol carry out route and calculate, and obtain local routing table;
Each node will be found and the maintenance neighborhood according to the task of being distributed at the local runtime link-state routing protocol, with each neighbours' synchronization link state information, uses shortest-path first algorithm and carries out route calculating, obtains local routing table.
A3, carry out route and gather.
The route that each node is determined by the routing table state machine relation of gathering is carried out route and is gathered.
Generally from gathering node local routing table is issued the main node that gathers by each, the master gathers node and carries out gathering of routing table, obtains summarized results, and transmits portion and gather node to backup.
When coming the operation dispatching state machine with the multizone of link-state routing protocol Area Border Router or link-state routing protocol multi-process mode, because the routing table of each process is all effective in same scope, therefore each local routing table need be gathered the overall routing table of the complete Routing Protocol of formation.Each gathers node to the master and sends local routing table from gathering node, by main gathering forming the overall routing table of Routing Protocol after node compiles all route result of calculations, and is issued to the overall routing table of router.
Though generally give tacit consent to the just main node that gathers of master scheduling node, be responsible for gathering of routing table, but under the scheduling of routing table state machine, it can not be same node with the master scheduling node that the master gathers node yet, be that task scheduling can be carried out at a node, routing table gathers can be in another different node operations.
Also need to prove, if when being thread with the many examples of link-state routing protocol, because effectively, at this moment the routing table that can independently finish separately of each node gathers each protocol instance in VPN scope separately, be equivalent to each node this moment all is main summary status.
Routing table gather some particular requirements that also may consider Routing Protocol, for example when being distributed executable unit, need to consider support to the OSPF virtual link with the ospf area.For the OSPF relay area that has disposed virtual link, its 3 class and 4 class LSA LSA (Link StateAdvertisement) need to upgrade the route result of calculation of backbone area, therefore can calculate in this locality earlier for this two class LSA, become the part of local routing table, send to together and main gather node and gather according to protocol rule, its detailed process depends on the realization of Routing Protocol.
To gathering of each local routing table will forming the overall routing table of Routing Protocol, this moment, link-state routing protocol need be issued to it in overall routing table of router, the routing iinformation that the overall routing table of router comprehensively obtains from different routing protocol, select optimum route according to certain rule, form the forwarding information base that datum plane instructs message to transmit, and be issued to Forwarding plane.
Foregoing describes the route processing method of the embodiment of the invention in detail, and corresponding, the embodiment of the invention provides a kind of route processors.
See also Figure 13, be embodiment of the invention route processors structural representation.This route processors comprises task scheduling modules 100, agreement operation module 200 and route summarizing module 300.
Wherein, task scheduling modules 100 is used for the annexation between responsible discovery and maintenance and other route processorss, and carries out Task Distribution according to the disposal ability of each route processors.
See also Figure 14, the task scheduling modules 100 of route processors comprises that further information unit 1001, scheduling election unit 1002, route gather election unit 1003 and task allocation unit 1004.
Information unit 1001, the disposal ability value information that is used to store route processors self disposal ability value information He obtains other route processorss; Know each other existence by the periodic broadcasting heartbeat message between each route processors, the disposal ability value information carries in heartbeat message, and information unit 1001 obtains the disposal ability value information of other route processorss by heartbeat message.
Scheduling election unit 1002 is used for carrying out according to the disposal ability value information election of self route processors disposal ability value information of information unit 1001 storages and other route processorss of obtaining the route processors of Task Distribution.Election regulation is to find the conduct of processing ability value maximum to carry out the master scheduling route processors of Task Distribution from the neighbours' set that obtains, and secondly is backup scheduling route processors, and all the other be from dispatching route processors.When processing ability value is identical, then compare its inner networking address value.Rule generally be election networking address value maximum as the master scheduling route processors, secondly be backup scheduling route processors, remaining be from dispatching route processors.
Route gathers election unit 1003, is used for disposal ability value information election the carrying out route processors that route gathers according to self disposal ability value information of information unit 1001 storage and other route processorss of obtaining.Election regulation generally also be with the processing ability value maximum gather route processors as carrying out the master that route gathers, secondly for backup gathers route processors, all the other are for from gathering route processors.In general, it is same route processors that the master that the master scheduling route processors of scheduling election unit 1002 elections and route gather 1003 elections of election unit gathers route processors, and to gather route processors can not be same route processors with the master scheduling route processors yet but route gathers the master of election unit 1003 elections.
Task allocation unit 1004 is carried out Task Distribution when being used for route processors as the master scheduling route processors, can assign the task to other route processorss.
The task scheduling modules 100 of route processors further comprises: first timer unit 1005 and dispatch state machine unit 1006.
First timer unit 1005 is used to be provided with regularly.Dispatch state machine unit 1006, be used for the task status of route processors is divided, and the indication route processors is carried out different operating, when route processors enters wait state and after first timer unit 1005 starts regularly, 1006 announcement information unit 1001, dispatch state machine unit obtain the disposal ability value information of other route processorss, after the timing of first timer unit 1005 settings is overtime, dispatch state machine unit 1006 triggers scheduling election unit 1002 and conducts an election, and the indication route processors is elected as and enters the master scheduling state when carrying out Task Distribution, is not elected as to enter the backup dispatch state when carrying out Task Distribution or from dispatch state.
The task scheduling modules 100 of route processors further comprises: second timer unit 1007 and routing table state machine unit 1008.
Second timer unit 1007 is used to be provided with regularly.Routing table state machine unit 1008, be used for the route summary status of route processors is divided, and the indication route processors is carried out different operating, when route processors enters wait state and after second timer unit 1007 starts regularly, routing table state machine unit 1008 announcement information unit 1001 obtain the disposal ability value information of other route processorss, after the timing of second timer unit 1007 settings is overtime, routing table state machine unit 1008 triggering routes gather election unit 1003 and conduct an election, and the indication route processors is elected as and carries out entering main summary status when route gathers, and is not elected as to carry out entering when route gathers the backup summary status or from summary status.
Task allocation unit 1004 in the task scheduling modules 100 of route processors further comprises: judging unit 10041 and processing unit 10042.Judging unit 10041 after being used to receive message, judges according to interface list information whether the message Processing tasks belongs to this route processors and be responsible for; Processing unit 10042 is used for judging when not belonging to this route processors and being responsible at judging unit 10041, specifies the route processors of being responsible for this message Processing tasks, and revises interface map list information.
The embodiment of the invention also provides a kind of router.See also Figure 15, be embodiment of the invention router topology schematic diagram.
Be to contain 3 route processorss 60,70 and 80 with router to illustrate but be not limited to this among Figure 15, router may contain a plurality of route processorss.Each route processors of this router is identical with the route processors that Figure 13 is introduced, and comprises task scheduling modules 100, agreement operation module 200 and route summarizing module 300.
Wherein, task scheduling modules 100 is used for the annexation between responsible discovery and maintenance and other route processorss, and carries out Task Distribution according to the processing ability value of each route processors.Agreement operation module 200 is used for the link-state routing protocol basic according to the task run that is distributed, and carries out route and calculates, and obtains local routing table.Route summarizing module 300 is used for that route result of calculation is carried out route and gathers, and can compile each route processors and carry out the local routing table that route is calculated gained, thereby form the overall routing table of complete Routing Protocol.The task scheduling modules 100 of each route processors comprises that further information unit 1001, scheduling election unit 1002, route gather election unit 1003, task allocation unit 1004, first timer unit 1005, dispatch state machine unit 1006, second timer unit 1007 and routing table state machine unit 1008.Task allocation unit 1004 in the task scheduling modules 100 further comprises judging unit 10041 and processing unit 10042.The function of these unit is identical with the content that the front is introduced, and no longer describes in detail herein.
In sum, link-state routing protocol operational mode of the prior art is because concentrate on the single route processors, be subjected to the restriction of the disposal ability of route processors own, can't realize the expansion of link-state routing protocol, and embodiment of the invention scheme is: set up each internodal connection in the network, each node is carried out task scheduling; Each node is according to the task run link-state routing protocol of described scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating; Obtain the described route result of calculation of each node and go forward side by side walking along the street by gathering.Because under the operational mode of the embodiment of the invention, the task scheduling of link-state routing protocol, agreement can be carried out and route gather operation to dynamically distribute to each node be on each route processors, so can make full use of the resource of each node, thereby realize the expansion of link-state routing protocol.
Further, three functions of link-state routing protocol are distributed on each node dynamically, can have bigger fault-tolerant ability.If certain node of distributed system breaks down, perhaps in the agreement running of certain node, when bigger concussion appears in its network, can isolate influence to its node.
More than a kind of route processing method, route processors and router that the embodiment of the invention provided are described in detail, used specific case herein the principle and the execution mode of the embodiment of the invention are set forth, the explanation of above embodiment just is used to help to understand the method and the core concept thereof of the embodiment of the invention; Simultaneously, for one of ordinary skill in the art, according to the thought of the embodiment of the invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (17)
1, a kind of route processing method is characterized in that, comprising:
Set up each internodal connection in the network, each node is carried out task scheduling;
Each node is according to the task run link-state routing protocol of described scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating;
Obtain the described route result of calculation of each node and go forward side by side walking along the street by gathering.
2, route processing method according to claim 1 is characterized in that, describedly each node is carried out task scheduling is specially:
Determine to carry out the node of Task Distribution and carry out the node that route gathers according to the disposal ability value information of each node;
The task of distributing each node by the described node of determining that carries out Task Distribution.
3, route processing method according to claim 2 is characterized in that:
Described disposal ability value information according to each node is determined to carry out the node of Task Distribution and carries out the node that route gathers to be specially:
Obtain the heartbeat message that carries node processing ability value information of broadcasting in the network, according to described disposal ability value information, the node of election processing ability value maximum is as the node that carries out Task Distribution and carry out the node that route gathers.
4, route processing method according to claim 2 is characterized in that:
The node that described disposal ability value information according to each node is determined to carry out Task Distribution is by the control of dispatch state machine, and control procedure is specially:
Indication enters the node of wait state and broadcast the heartbeat message that carries node status information and disposal ability value information after starting timer, behind timer expiry, triggering determines to carry out the election process of the node of Task Distribution, the node that elects the processing ability value maximum is as the node that carries out Task Distribution, and indicate it to enter the master scheduling state, indicate other nodes to enter backup dispatch state or the node transmission heartbeat message of the node from dispatch state from dispatch state to the master scheduling state according to election results.
5, route processing method according to claim 2 is characterized in that:
The node that the route of determining described disposal ability value information according to each node to carry out gathers is by the control of routing table state machine, and control procedure is specially:
Indication enters the node of wait state and broadcast the heartbeat message that carries node status information and disposal ability value information after starting timer, behind timer expiry, triggering determines to carry out the election process of the node that route gathers, the node that elects the processing ability value maximum is as carrying out the node that route gathers, and indicate it to enter the master scheduling state, indicate other nodes to enter backup summary status or, only send heartbeat message to the node of main summary status from the node of summary status from summary status according to election results.
6, route processing method according to claim 2 is characterized in that, the described node of determining that carries out Task Distribution distributes the task of each node to be specially:
The node that carries out Task Distribution that elects splits the task that unit distributes each node according to difference, the described different a plurality of zones that split multiple virtual private network (VPN) VPN instance, multi-protocols process or Area Border Router connection that unit is a link-state routing protocol.
According to claim 2 or 6 described route processing methods, it is characterized in that 7, the described node of determining that carries out Task Distribution distributes the task of each node to be specially:
After the described node that carries out Task Distribution that elects receives message, according to node under the interface list information judgement message Processing tasks, do not belong to this node and be responsible for if judge, then specify the node of being responsible for this message Processing tasks, and revise interface map list information.
8, route processing method according to claim 2 is characterized in that, describedly obtains the walking along the street of going forward side by side of route result of calculation and is specially by gathering:
Each node will carry out local routing table that route calculates send to described determine carry out the node that route gathers, describedly carry out the node that route gathers and receive the laggard walking along the street of described local routing table by gathering, obtain overall routing table.
9, a kind of route processors is characterized in that, comprising:
Task scheduling modules is used to carry out task scheduling;
Agreement operation module is used for the task run link-state routing protocol by scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating;
The route summarizing module is used for that route result of calculation is carried out route and gathers.
10, route processors according to claim 9 is characterized in that, described task scheduling modules further comprises:
Information unit, the disposal ability information that is used to store route processors self disposal ability information He obtains other route processorss;
Scheduling election unit is used for electing the route processors that carries out Task Distribution according to route processors self the disposal ability information of information unit storage and the disposal ability information of other route processorss that obtain;
Route gathers the election unit, is used for carrying out the route processors that route gathers according to the node processing ability information of information unit storage and the disposal ability information election of other route processorss that obtain;
Task allocation unit is used for allocating task.
11, route processors according to claim 10 is characterized in that, described task scheduling modules further comprises:
The first timer unit is used to be provided with regularly;
Dispatch state machine unit, be used for the task status of route processors is divided, and the indication route processors is carried out different operating, when route processors enter wait state and the first timer unit starting regularly after, announcement information unit, dispatch state machine unit obtains the disposal ability information of other route processorss, after the timing of first timer unit setting is overtime, dispatch state machine unit triggers scheduling election unit conducts an election, and the indication route processors is elected as and enters the master scheduling state when carrying out Task Distribution, is not elected as to enter the backup dispatch state when carrying out Task Distribution or from dispatch state.
12, route processors according to claim 10 is characterized in that, described task scheduling modules further comprises:
The second timer unit is used to be provided with regularly;
The routing table state machine unit, be used for the route summary status of route processors is divided, and the indication route processors is carried out different operating, when route processors enter wait state and the second timer unit starting regularly after, routing table state machine unit announcement information unit obtains the disposal ability information of other route processorss, after the timing of second timer unit setting is overtime, routing table state machine unit triggering route gathers the election unit and conducts an election, and the indication route processors is elected as and carries out entering main summary status when route gathers, and is not elected as to carry out entering when route gathers the backup summary status or from summary status.
13, route processors according to claim 10 is characterized in that, described task allocation unit further comprises:
Judging unit after being used to receive message, judges according to interface list information whether the message Processing tasks belongs to this route processors and be responsible for;
Processing unit is used for specifying the route processors of being responsible for this message Processing tasks when judgment unit judges goes out not belong to this route processors and is responsible for, and revises interface map list information.
14, a kind of router is characterized in that, comprising:
A plurality of route processorss, described route processors comprises:
Task scheduling modules is used to carry out the task scheduling between route processors;
Agreement operation module is used for the task run link-state routing protocol by scheduling, and the walking along the street of going forward side by side obtains route result of calculation by calculating;
The route summarizing module is used for that route result of calculation is carried out route and gathers.
15, router according to claim 14 is characterized in that, the task scheduling modules in the described route processors further comprises:
Information unit, the disposal ability information that is used to store route processors self disposal ability information He obtains other route processorss;
Scheduling election unit is used for electing the route processors that carries out Task Distribution according to route processors self the disposal ability information of information unit storage and the disposal ability information of other route processorss that obtain;
Route gathers the election unit, is used for carrying out the route processors that route gathers according to the node processing ability information of information unit storage and the disposal ability information election of other route processorss that obtain;
Task allocation unit is used for allocating task.
16, router according to claim 15 is characterized in that, the task scheduling modules in the described route processors further comprises:
The first timer unit is used to be provided with regularly;
Dispatch state machine unit, be used for the task status of route processors is divided, and the indication route processors is carried out different operating, when route processors enter wait state and the first timer unit starting regularly after, announcement information unit, dispatch state machine unit obtains the disposal ability information of other route processorss, after the timing of first timer unit setting is overtime, dispatch state machine unit triggers scheduling election unit conducts an election, and the indication route processors is elected as and enters the master scheduling state when carrying out Task Distribution, is not elected as to enter the backup dispatch state when carrying out Task Distribution or from dispatch state;
The second timer unit is used to be provided with regularly;
The routing table state machine unit, be used for the route summary status of route processors is divided, and the indication route processors is carried out different operating, when route processors enter wait state and the second timer unit starting regularly after, routing table state machine unit announcement information unit obtains the disposal ability information of other route processorss, after the timing of second timer unit setting is overtime, routing table state machine unit triggering route gathers the election unit and conducts an election, and the indication route processors is elected as and carries out entering main summary status when route gathers, and is not elected as to carry out entering when route gathers the backup summary status or from summary status.
17, router according to claim 15 is characterized in that, the described task allocation unit of task scheduling modules further comprises in the described route processors:
Judging unit after being used to receive message, judges according to interface list information whether the message Processing tasks belongs to this route processors and be responsible for;
Processing unit is used for specifying the route processors of being responsible for this message Processing tasks when judgment unit judges goes out not belong to this route processors and is responsible for, and revises interface map list information.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101020835A CN101309201B (en) | 2007-05-14 | 2007-05-14 | Route processing method, routing processor and router |
| PCT/CN2008/070898 WO2008138255A1 (en) | 2007-05-14 | 2008-05-07 | Route process method, route processor and router |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101020835A CN101309201B (en) | 2007-05-14 | 2007-05-14 | Route processing method, routing processor and router |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101309201A true CN101309201A (en) | 2008-11-19 |
| CN101309201B CN101309201B (en) | 2012-05-23 |
Family
ID=40001697
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101020835A Expired - Fee Related CN101309201B (en) | 2007-05-14 | 2007-05-14 | Route processing method, routing processor and router |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101309201B (en) |
| WO (1) | WO2008138255A1 (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102130834A (en) * | 2011-03-15 | 2011-07-20 | 杭州华三通信技术有限公司 | Internet protocol (IP) routing method and router |
| CN102932260A (en) * | 2012-10-31 | 2013-02-13 | 福建星网锐捷网络有限公司 | Method, device and system for routing computing |
| CN103873312A (en) * | 2012-12-12 | 2014-06-18 | 中国移动通信集团公司 | Method and system for testing FIB (Forwarding Information base) capacity of IP equipment |
| WO2015149491A1 (en) * | 2014-03-31 | 2015-10-08 | 华为技术有限公司 | Network resource processing device, method and system |
| CN106100961A (en) * | 2016-07-21 | 2016-11-09 | 广州高能计算机科技有限公司 | A kind of Direct Connect Architecture computing cluster system based on infinite bandwidth and construction method |
| CN106952207A (en) * | 2017-03-10 | 2017-07-14 | 深圳市博信诺达经贸咨询有限公司 | Monitor the electoral machinery and system of cloud platform distributed system |
| CN107181628A (en) * | 2017-07-20 | 2017-09-19 | 杭州老板电器股份有限公司 | Two-way wireless communication method, device and terminal |
| CN108710529A (en) * | 2018-04-28 | 2018-10-26 | 四川斐讯信息技术有限公司 | A kind of remote task processing method, system and wireless router |
| CN109981461A (en) * | 2017-12-27 | 2019-07-05 | 华为技术有限公司 | A kind of data transmission method, apparatus and system |
| CN111464442A (en) * | 2019-01-22 | 2020-07-28 | 华为技术有限公司 | Method and device for routing data packet |
| CN113626161A (en) * | 2021-07-09 | 2021-11-09 | 中国科学院信息工程研究所 | Distributed multi-user data scheduling method and system |
| CN114640618A (en) * | 2022-03-15 | 2022-06-17 | 平安国际智慧城市科技股份有限公司 | Cluster routing scheduling method and device, electronic equipment and readable storage medium |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109587061B (en) * | 2018-11-08 | 2022-04-22 | 华为技术有限公司 | Method, device and equipment for processing route |
| CN112468353B (en) * | 2019-09-09 | 2023-11-21 | 华为数字技术（苏州）有限公司 | Network reachability detection method and device |
| CN115190061A (en) * | 2020-06-04 | 2022-10-14 | 华为技术有限公司 | Method, communication device, storage medium and system for processing routing message |
| CN114245288A (en) * | 2021-10-29 | 2022-03-25 | 重庆惠科金渝光电科技有限公司 | Task scheduling method of service equipment, service equipment and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100452797C (en) * | 2005-07-15 | 2009-01-14 | 清华大学 | High-available distributed boundary gateway protocol system based on cluster router structure |
| CN100394742C (en) * | 2006-08-17 | 2008-06-11 | 北京邮电大学 | Monitoring and analyzing system for opening shortest path priority route protocol and working method |
| CN1917464A (en) * | 2006-09-01 | 2007-02-21 | 清华大学 | Distribution type task assignment and computation method based on lower bound to be raised step by step |
| CN100413264C (en) * | 2006-10-20 | 2008-08-20 | 清华大学 | Performance evaluation method for communication mode in sub layer to be adopted to transmission of expandable route system |
-
2007
- 2007-05-14 CN CN2007101020835A patent/CN101309201B/en not_active Expired - Fee Related
-
2008
- 2008-05-07 WO PCT/CN2008/070898 patent/WO2008138255A1/en active Application Filing
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102130834B (en) * | 2011-03-15 | 2014-04-02 | 杭州华三通信技术有限公司 | Internet protocol (IP) routing method and router |
| CN102130834A (en) * | 2011-03-15 | 2011-07-20 | 杭州华三通信技术有限公司 | Internet protocol (IP) routing method and router |
| CN102932260A (en) * | 2012-10-31 | 2013-02-13 | 福建星网锐捷网络有限公司 | Method, device and system for routing computing |
| CN102932260B (en) * | 2012-10-31 | 2016-03-30 | 福建星网锐捷网络有限公司 | Route computing method, equipment and system |
| CN103873312A (en) * | 2012-12-12 | 2014-06-18 | 中国移动通信集团公司 | Method and system for testing FIB (Forwarding Information base) capacity of IP equipment |
| CN103873312B (en) * | 2012-12-12 | 2017-05-31 | 中国移动通信集团公司 | A kind of method of testing and system of IP device forward table capacity |
| US10200287B2 (en) | 2014-03-31 | 2019-02-05 | Huawei Technologies Co., Ltd. | Network resource processing apparatus, method, and system |
| WO2015149491A1 (en) * | 2014-03-31 | 2015-10-08 | 华为技术有限公司 | Network resource processing device, method and system |
| CN106100961A (en) * | 2016-07-21 | 2016-11-09 | 广州高能计算机科技有限公司 | A kind of Direct Connect Architecture computing cluster system based on infinite bandwidth and construction method |
| CN106952207A (en) * | 2017-03-10 | 2017-07-14 | 深圳市博信诺达经贸咨询有限公司 | Monitor the electoral machinery and system of cloud platform distributed system |
| CN107181628A (en) * | 2017-07-20 | 2017-09-19 | 杭州老板电器股份有限公司 | Two-way wireless communication method, device and terminal |
| CN109981461A (en) * | 2017-12-27 | 2019-07-05 | 华为技术有限公司 | A kind of data transmission method, apparatus and system |
| CN109981461B (en) * | 2017-12-27 | 2020-10-09 | 华为技术有限公司 | Data transmission method, device and system |
| CN108710529A (en) * | 2018-04-28 | 2018-10-26 | 四川斐讯信息技术有限公司 | A kind of remote task processing method, system and wireless router |
| CN111464442A (en) * | 2019-01-22 | 2020-07-28 | 华为技术有限公司 | Method and device for routing data packet |
| CN113626161A (en) * | 2021-07-09 | 2021-11-09 | 中国科学院信息工程研究所 | Distributed multi-user data scheduling method and system |
| CN113626161B (en) * | 2021-07-09 | 2023-12-22 | 中国科学院信息工程研究所 | Distributed multi-user data scheduling method and system |
| CN114640618A (en) * | 2022-03-15 | 2022-06-17 | 平安国际智慧城市科技股份有限公司 | Cluster routing scheduling method and device, electronic equipment and readable storage medium |
| CN114640618B (en) * | 2022-03-15 | 2024-03-12 | 平安国际智慧城市科技股份有限公司 | Cluster route scheduling method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2008138255A1 (en) | 2008-11-20 |
| CN101309201B (en) | 2012-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101309201B (en) | Route processing method, routing processor and router | |
| CN108781398B (en) | Method, network and the node that multitask routes in multi-hop heterogeneous wireless network | |
| CN100527745C (en) | A LSA passive collection method under the OSPF full adjacent connection condition | |
| CN100505692C (en) | High performance router BGP routing protocol distribution parallel realizing method | |
| CN102130834B (en) | Internet protocol (IP) routing method and router | |
| CN107196854B (en) | Data plane exception handling method in software defined network | |
| US7366112B2 (en) | Communication network control system, control method, node and program | |
| CN101953125A (en) | Communication network system, communication device, route design device, and failure recovery method | |
| CN108833283B (en) | Software-defined cross-domain multi-path routing planning method | |
| CN106060858B (en) | The method and device of software definition Satellite Networking based on OpenFlow Extended Protocol | |
| CN103051565A (en) | Framework system of grade software defined network software controller and implementation method thereof | |
| CN101163105A (en) | Method of obtaining path information and path computing node | |
| JP2015095176A (en) | Event collection method, information processing device, information processing system, and information processing program | |
| US20110022881A1 (en) | Distributed resource managing system, distributed resource managing method, and distributed resource managing program | |
| CN106713177A (en) | Multi-controller wmSDN networking method | |
| CN106797319A (en) | Network service aware router and its application | |
| CN100486220C (en) | Method for implementing PCE discovery protocol | |
| Ebrahimi et al. | Using clustering via soccer league competition algorithm for optimizing power consumption in wsns (wireless sensor networks) | |
| CN100531144C (en) | Router and routing transmission method | |
| CN101478489B (en) | Method and system for controlling default routing notification by IS-IS protocol | |
| JP2012054731A (en) | Network relay device, network relay system, and network relay method | |
| CN101547188A (en) | System and method for achieving generalized routing protocol of wireless sensor network | |
| CN114338714B (en) | Block synchronization method and device, electronic equipment and storage medium | |
| CN102970388A (en) | Method and system for managing outer net access | |
| CN114338724A (en) | Block synchronization method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120523 Termination date: 20160514 |