WO2008138255A1 - Procédé de traitement d'acheminement, processeur d'acheminement et routeur - Google Patents

Procédé de traitement d'acheminement, processeur d'acheminement et routeur Download PDF

Info

Publication number
WO2008138255A1
WO2008138255A1 PCT/CN2008/070898 CN2008070898W WO2008138255A1 WO 2008138255 A1 WO2008138255 A1 WO 2008138255A1 CN 2008070898 W CN2008070898 W CN 2008070898W WO 2008138255 A1 WO2008138255 A1 WO 2008138255A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
route
routing
task
scheduling
Prior art date
Application number
PCT/CN2008/070898
Other languages
English (en)
Chinese (zh)
Inventor
Yuanbo Zhu
Kui Zhang
Original Assignee
Huawei Technologies Co., Ltd.
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co., Ltd., Tsinghua University filed Critical Huawei Technologies Co., Ltd.
Publication of WO2008138255A1 publication Critical patent/WO2008138255A1/fr

Links

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

Definitions

  • the router that forwards the Internet message is usually the router that forwards the Internet message, and the router that directs the forwarding decision is the forwarding information base.
  • This forwarding information store stores routing information provided by different routing protocols.
  • the routing protocol running by the router can be divided into the border gateway protocol between the autonomous systems and the internal gateway protocol within the autonomous system according to the application.
  • an autonomous system refers to an internet network in which a management mechanism is implemented by a single management organization.
  • the link state routing protocol is the most widely used internal gateway protocol, the system to the Intermediate System to Intermediate System Routing Protocol (ISS).
  • the link state routing protocol is based on the shortest path first algorithm.
  • the running process is: discovering and maintaining protocols through specific neighbors, discovering neighbors around the router, and spreading and collecting the autonomous system with its reliable flooding mechanism.
  • the local link information of each router forms a so-called link state database in the link state routing protocol.
  • each router running the link state routing protocol will soon obtain panoramic information about the entire network topology and agree.
  • the shortest path first algorithm By applying the shortest path first algorithm to the link state database, all network reachability information of the autonomous system can be obtained, and a routing table of the link state routing protocol is formed, and these routes are loop-free. Then, the routing table of the link state routing protocol is sent to the global routing table of the router, and the routing information obtained from different routing protocols is synthesized by the global routing table, and the optimal route is selected according to certain rules to form a data plane guide. Forwarding information library forwarded by the text.
  • the traditional link state routing protocol operation mode is usually one or more routing protocols (including the link state routing protocol) as an operating system task, running on the routing processor of the router control plane, that is, the protocol running processing, Functions such as route calculation and management control are concentrated on a single route processor.
  • the total number of neighbors that the link state routing protocol can support The number and routing capacity depend on the computing power of the routing processor and the capacity of the physical memory that is provisioned.
  • the user With the expansion of the network and the flattened network design, the user usually hopes that the total number of neighbors and the routing capacity supported by the link state routing protocol can be improved with the increase of hardware resources such as the routing processor, and the link state is realized.
  • Extension of the routing protocol the traditional link state routing protocol operating mode cannot be extended by the link state routing protocol because it is concentrated on a single routing processor.
  • Embodiments of the present invention provide a route processing method, a route processor, and a router, which can implement extension of a link state routing protocol.
  • the embodiment of the invention provides a route processing method, including: establishing and maintaining a connection between nodes in a network, performing task scheduling on the node; the node runs a link state routing protocol according to the scheduled task, and performs route calculation to obtain a route. Calculating the result; obtaining the route calculation result of the node and performing route summarization.
  • the embodiment of the present invention provides a router, including a plurality of route processors, where the route processor includes: a task scheduling module, configured to perform task scheduling between routing processors; and a protocol running module, configured to perform tasks according to the scheduling
  • the link state routing protocol is run, and the route calculation is performed to obtain the route calculation result.
  • the route summary module is configured to perform route summarization on the route calculation result.
  • the operation mode of the embodiment of the present invention can dynamically distribute the task scheduling, protocol execution, and route summary operations of the link state routing protocol to each node, that is, each route processor, so that the resources of each node can be fully utilized, thereby realizing The scalability of the link state routing protocol.
  • DRAWINGS 1 is a distributed model diagram of a link state routing protocol according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a routing processing method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of performing task scheduling in a route processing method according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a scheduling state machine according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a state machine of a routing table according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of establishing a connection relationship between nodes according to an embodiment of the present invention.
  • Figure ⁇ is a flowchart of an active allocation task in a routing processing method according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of an application network of a routing processing method according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of related information in an application network of a routing processing method according to an embodiment of the present invention
  • FIG. 11 is a schematic diagram of related information in an application network according to a routing processing method according to an embodiment of the present invention
  • 3 is a schematic diagram of related information in an application network
  • FIG. 13 is a schematic structural diagram of a routing processor according to an embodiment of the present invention
  • FIG. 14 is a schematic structural diagram of a task scheduling module of a routing processor according to an embodiment of the present invention.
  • FIG. 15 is a schematic structural diagram of a router according to an embodiment of the present invention.
  • routing processor is hereinafter referred to simply as a node.
  • the distributed model of the link state routing protocol in the embodiment of the present invention includes a task scheduling module, a protocol running module, and a routing table summary module.
  • the task scheduling module is configured to discover and maintain each The connection relationship between the nodes, and the task allocation according to the processing capability of the node;
  • the protocol running module is configured to run the link state routing protocol according to the task assigned by the scheduling module, perform route calculation, obtain a route calculation result, and generate a local routing table;
  • the routing table summary module is configured to perform route summarization on the route calculation result, that is, it is used to collect the local routing table of each node.
  • the task scheduling algorithm of the embodiment of the present invention includes a scheduling state machine and a routing table state machine.
  • the scheduling state machine divides the state of each node into a main scheduling state, a backup scheduling state, and a slave scheduling state according to a decision right assigned by the task.
  • the functions of the scheduling state machine include: establishing and maintaining relationships between nodes of the distributed system; electing the primary scheduling node, the backup scheduling node, and the secondary scheduling node; performing task assignment.
  • the routing table state machine divides the state of each node into a primary summary state, a backup summary state, and a summary state according to the execution right of the routing table summary task, and completes the summary operation of each local routing table.
  • the distributed implementation model can be mapped to a specific running model according to a specific scheduling policy.
  • Figure 1 shows an example of a distributed model of a link state routing protocol.
  • the tag 22 indicates a router, and the tag 33 indicates a node.
  • the three circles from top to bottom in the node are the three components under the distributed model: the task scheduling module, the protocol running module, and the routing table summary module.
  • An allocation mode as shown in A, under the control of the scheduling state machine, completes the task assignment of protocol running and routing table summary work on multiple nodes, each node performs protocol running and routing table summarization, then each node The routing table summary module will only complete the local routing information summary and send it to the router's global routing table.
  • the router's global routing table is stored in the router's other memory.
  • Another allocation mode as shown in B, allows the primary scheduling node to perform routing table summarization. Then the primary scheduling node is also the primary summary node. In this case, the primary summary node needs to summarize the routing information of each node before delivering it to the router. Global routing table.
  • the embodiment of the present invention will be mainly described in the mode shown by B, but is not limited thereto.
  • FIG. 2 it is a flowchart of a routing processing method according to an embodiment of the present invention, including:
  • FIG 4 shows the scheduling state machine.
  • the scheduling state machine is somewhat similar to the interface state machine with the OSPF protocol. Each node will execute this state machine.
  • This state machine defines the following states: "inactive" state, in which the node does not run the link state routing protocol; in the "waiting" state, the node can run the link state routing protocol but does not enter the working mode; The mode, and the decision rights assigned by the task are divided into the "main scheduling", "backup scheduling” and "slave scheduling” states.
  • the scheduling state machine performs the following functions driven by the trigger event: Establish and maintain the relationship between the nodes of the distributed system; perform election of the primary scheduling node, the backup scheduling node, and the secondary scheduling node; perform task assignment.
  • the various arrows in Figure 4 mark the possible state transition process when the node is running the state machine. Depending on the nature of the triggering event, each node may change its state or may remain in its current state. But there will always be a consistent election result between all nodes.
  • the node stops the routing protocol in any state it changes to the "inactive" state.
  • the routing protocol When the routing protocol is started, it changes from the "inactive" state to the "waiting" state, starts the timer, and starts.
  • the heartbeat message is broadcast on the internal communication network.
  • the main scheduling node After the timer expires, the main scheduling node is elected.
  • the rule is to elect the main scheduling node with the highest processing power value, followed by the backup scheduling node, and the rest are slave scheduling nodes. When the processing power values are the same, Comparing the internal network address values, the rule is generally that the election network address value is the largest as the primary scheduling node, followed by the backup scheduling node, and the rest are the secondary scheduling nodes.
  • the tasks of the backup scheduling node and the slave scheduling node are allocated by the primary scheduling node.
  • Bl establishing and maintaining relationships between nodes, electing a primary scheduling node, a backup scheduling node, and a secondary scheduling node;
  • each node learns the existence of each other by periodically broadcasting heartbeat messages, and elects the primary scheduling node and the backup scheduling node according to its processing capability, and the rest are slave scheduling nodes.
  • the processing capability information is carried in the heartbeat message.
  • the scheduling node sends a heartbeat message only to the primary scheduling node, and the primary scheduling node broadcasts a heartbeat message on the internal network.
  • the five nodes A, B, C, D, and E shown in Figure 6 change from the "inactive" state to the "waiting" state after receiving the configuration command to run OSPF, start the timer, and start internally.
  • a heartbeat message is broadcast on the communication network.
  • the type field is represented by 0 - 1 bits
  • the 2 - 3 bits represent the status field
  • 4 - 7 bits represent the address field
  • 8 - 9 bits represent the processing capability field. Since the current state of each node is "waiting", the value of the state field of the heartbeat message is "waiting", and the "processing capability" field is the node. The remaining processing power of the previous node.
  • each node obtains the neighbor's information and constitutes the following neighbor list.
  • each node starts the election of the primary scheduling node.
  • the rule is to find the primary scheduling node with the highest processing power value from the obtained neighbor set, followed by the backup scheduling node, and the rest are slave scheduling nodes.
  • the "processing power" value is the same, the internal network address value is compared.
  • the rule is generally that the election network address value is the largest as the primary scheduling node, the second is the backup scheduling node, and the rest is the secondary scheduling node.
  • node A is elected as the master scheduling node
  • B is elected as the backup scheduling node
  • C, D, and E are slave scheduling nodes.
  • nodes A and B transition to the "master scheduling” state and the “backup scheduling” state, respectively, and nodes C, D, and E all transition to the "slave scheduling” state. Thereafter, A periodically broadcasts a heartbeat message to the internal network, whose status field is “main scheduling”, and ⁇ C, D, and E only send heartbeat messages to A, and the B-state field is "backup scheduling", C, D, and E.
  • the status field is "From Schedule”.
  • the main scheduling node performs task assignment
  • the primary scheduling node After the primary scheduling node is elected, the primary scheduling node starts the initial assignment of tasks. In this step, the task is assigned by the scheduling state machine.
  • the scheduling state machine can adopt no The same split unit is used to perform task assignment.
  • the different split units refer to one of a virtual private network instance such as a link state routing protocol, one of a multi-protocol process, or an area border router in a link state routing protocol. One of a plurality of regions, etc.
  • the link state routing protocol multi-VPN instance refers to the routing protocol instance running under each VPN. Each instance only performs the routing function in the VPN, and has nothing to do with the routing instances in other VPNs.
  • Link state routing protocol Multi-protocol process means that each protocol process runs on a part of the same independent network under the same autonomous system, the so-called protocol routing domain. The routing function is completed in this independent sub-routing domain, and they are mutually unrelated.
  • a zone border router is a link state routing protocol that defines a router that is simultaneously connected to multiple zones within an autonomous system. The link state routing protocol divides the entire autonomous system into multiple regions in order to extend support for a large number of Autonomous Systems. These areas are simultaneously divided into backbone areas and non-backbone areas.
  • the backbone area must be physically or logically connected, and each non-backbone area must be connected to this backbone area.
  • the junction between the area and the area is the area border router, and the other routers are called the intra-area routers.
  • the routers in the area complete the routing function in the area by running the shortest path algorithm, and the area border routers are responsible for flooding the routing information in all areas to other areas in the form of digest to help the routers in the area complete the inter-area routing function.
  • Road State Routing Protocol This method of implementing inter-area routing borrows the horizontal splitting method in the distance vector routing protocol. Therefore, the area border router actually runs the shortest path algorithm on each of the connected areas, and the different areas are relatively independent networks.
  • the three kinds of irrelevance described above can be the task allocation algorithm of the scheduling state machine.
  • each processing node runs a specific area, maintains neighbor relationships in the area, and synchronizes link state information of the area.
  • each node can run several link-state routing protocol processes, each of which is an independent link-state routing protocol.
  • a configuration option can be provided to enable the user to make a final choice according to the specific application scenario of the protocol.
  • the following describes the OSPF protocol of the link state routing protocol as an example, and performs task allocation by using multiple area allocation units of the area border router.
  • the primary scheduling node in the "main scheduling” state triggers the "active task allocation” event when receiving the routing control message, and executes the main operation shown in FIG.
  • the task assignment operation process when the backup scheduling node under the “backup scheduling” or the slave scheduling node in the “scheduled” state receives the routing control message, the "passive task assignment” event is triggered, and the passive operation shown in FIG. 8 is performed. Task assignment process.
  • the active task assignment operation process includes:
  • step C2 determining whether the message processing task is responsible for the node, if yes, proceeding to step C3, if no, proceeding to step C4;
  • the master scheduling node can determine whether the packet processing task is responsible for the node.
  • step C4 whether the message processing task has been assigned, if yes, go to step C6, if no, go to step C5;
  • the main scheduling node can find out whether the packet processing task has been allocated by searching for related information in the area list of the task allocation mapping table.
  • step C5 designating a node to be responsible for the packet processing task, and proceeding to step C6;
  • step D2. Determine whether the message processing task is responsible for the node. If yes, go to step D3. If no, go to step D4.
  • C is responsible for the task of areaO
  • B is responsible for the tasks of areal.
  • the specific operations are as follows: Initially, the data of each node and the forwarding plane is as shown in FIG.
  • the forwarding plane receives the OSPF packet from the interface i «). According to the interface mapping table (currently empty), it selects the default mode to broadcast the packet to the entire distributed system, so A, B and C both receive the interface i « ) OSPF packets sent with areaO information. B and C do not find the i «) information in their local interface list, and judge that the task is not responsible for themselves, so the OSPF packet is discarded. A first does not find the ifO information in the list of its own local interface, and judges that the task is not responsible for itself.
  • A checks whether the task has been allocated. It searches for the areaO in the area list of the task allocation mapping table (this time is empty). , but not found, and then judge that the task has not been assigned, then add areaO to the area list of the task allocation mapping table, and push out the node C with the largest remaining processing capacity in the node queue arranged in the order of "processing power". This results in the assignment result for the specified C responsible for the areaO task.
  • A will perform the following operations: Fill in C corresponding to the areaO of the area list of the task allocation mapping table, set the port corresponding to interface ifO to C in the interface mapping table, send a message to C, and notify it to join the new task i «) .
  • the result shown in Fig. 11 is obtained.
  • A is also responsible for periodically passing the interface mapping table to the forwarding plane.
  • the forwarding plane When receiving the OSPF packet, the forwarding plane sends the packet to the corresponding node in unicast mode according to the interface and the interface mapping table. Therefore, when the forwarding plane sends the message from the interface i «) to the control plane again, the message is sent directly to C, which reduces the processing overhead on A and B.
  • a receives an OSPF packet from interface if2 it has areal information. B and C still do the same processing as before. A also performs similar processing. Adds the area list of the task allocation mapping table to the areal, and pushes the node B with the largest remaining processing capacity in the node queue, and obtains the allocation result as the designated B responsible for the areal task. A performs the following operations for this: The node corresponding to the areal of the area list of the task allocation mapping table is filled in B, and the port corresponding to the interface if2 is set to B in the interface mapping table, and a message is sent to B to notify it to join the new task if2. When A receives an OSPF packet from the interface ifl, it carries the areaO information.
  • the result of Fig. 12 is thus obtained.
  • C and B are assigned to tasks areaO and areal respectively, and the interfaces they contain are i «), ifl, and if2. Messages from interfaces i «) and ifl are sent directly to node C, and messages from interface if2 are sent directly to node B.
  • the above description describes a method for task assignment in the embodiment of the present invention, which performs active task assignment in a "master scheduling” state, and performs passive task assignment in a "backup scheduling” or “slave scheduling” state.
  • the task assignment algorithm is centralized to the main scheduling node to complete, and the corresponding task is directly sent from the forwarding plane to the corresponding processing node, so that each node will only receive the routing information in the area that it is responsible for, and then independently route. Calculation.
  • the primary scheduling node selects the primary summary node, the backup summary node, and the secondary summary node according to the processing capabilities of each node collected by the heartbeat message, and sends it to each node through an internal message.
  • the routing table state machine is used for scheduling.
  • the scheduling algorithm of the routing table state machine depends on the algorithm of the scheduling state machine.
  • the routing table state machine as shown in Figure 5, is similar to the scheduling state machine, and divides each node into: "waiting" state, the node does not enter the working mode, that is, the related operations of the routing table summary are not required. In the working mode, the decision status of the task assignment is divided into the "main summary", "backup summary” and "from summary” status. If the node stops the routing protocol in any state, it transitions to the "inactive" state. When the routing protocol is started, it changes from the "inactive" state to the "waiting" state, starts the timer, and starts broadcasting on the internal communication network. Heartbeat message. After the timer expires, the route summary relationship is determined.
  • the routing summary relationship determining process refers to one of the three states in which the routing state of each node transitions from the "waiting" state to the working mode, that is, the initialization process of the routing table state machine is generally synchronized with the scheduling state machine initialization process.
  • each node transitions from the "waiting" state to one of the three states of scheduling, as the scheduling state machine "timer timeout” event triggering the operation and "discovering the main scheduling"
  • the event is also a trigger event for the routing table state machine.
  • the routing table state machine that transitions from the "waiting" state to the "master scheduling” state, the routing table state machine will also be The "Wait" state transitions to the "Main Summary” state. That is to say, the initialization of the routing table state machine is the same as the initialization of the scheduling state machine.
  • the node that performs the primary scheduling by default is also responsible for the routing table summary, that is, the primary scheduling node is also the primary summary node.
  • Each node runs a link state routing protocol, performs route calculation, and obtains a local routing table.
  • Each node runs a link state routing protocol locally according to the assigned task, discovers and maintains the neighbor relationship, and synchronizes the link state with each neighbor.
  • Information applying the shortest path first algorithm for routing calculation, and obtaining a local routing table.
  • Each node performs route summarization according to the route summary relationship determined by the routing table state machine.
  • each slave summary node routes the route to the primary summary node, and the primary summary node performs summary of the routing table to obtain the summary result, and delivers a copy to the backup summary node.
  • each local routing table needs to be A global routing table that aggregates to form a complete routing protocol.
  • Each of the slave routing nodes sends a local routing table to the primary summary node, and the primary summary node aggregates all the routing calculation results to form a global routing table of the routing protocol, and delivers the routing table to the global routing table of the router.
  • the primary summary node may also be the same node as the primary scheduling node, that is, the task scheduling may be performed at one node.
  • the routing table summary can be run on a different node.
  • each node can independently complete the summary of the respective routing tables, which is equivalent to Each node is a master summary state.
  • the summary of the routing table may also consider some specific requirements of the routing protocol. For example, when the OSPF area is a distributed execution unit, support for the OSPF virtual link needs to be considered. For the OSPF trunk area configured with the virtual link, the Link State Advertisement (LSA) of the Type 3 and Type 4 link status needs to update the route calculation result of the backbone area. Therefore, the two types of LSAs can be calculated locally before. A part of the local routing table is sent together to the main summary node for aggregation according to the protocol rules, and the specific process depends on the implementation of the routing protocol.
  • LSA Link State Advertisement
  • the summary of each local routing table will form a global routing table of the routing protocol, and the link state routing at this time
  • the protocol needs to be sent to the global routing table of the router.
  • the global routing table of the router integrates the routing information obtained from different routing protocols, and selects the optimal route according to certain rules to form a forwarding information base for the data plane to guide the packet forwarding. And sent to the forwarding plane.
  • the embodiment of the present invention provides a routing processor.
  • the route processor includes a task scheduling module 100, a protocol execution module 200, and a route summary module 300.
  • the task scheduling module 100 is configured to discover and maintain a connection relationship with other routing processors, and perform task allocation according to processing capabilities of each routing processor.
  • the protocol running module 200 is configured to run a basic link state routing protocol according to the assigned task, perform route calculation, and obtain a route calculation result, that is, a local routing table.
  • the route summary module 300 is configured to collect a local routing table obtained by routing calculation by each route processor, to obtain a global routing table of the complete routing protocol.
  • the scheduling election unit 1002 is configured to elect a routing processor for performing task allocation according to the self-routing processor processing capability value information stored by the information unit 1001 and the acquired processing capability value information of other routing processors.
  • the election rule is to find the main scheduling route processor with the highest processing capacity value for task assignment from the obtained neighbor set, followed by the backup scheduling route processor, and the rest is the slave routing processor. When the processing power values are the same, the internal network address values are compared.
  • the rule is generally that the election network address value is the largest as the primary scheduling route processor, followed by the backup scheduling route processor, and the rest is the slave scheduling route processor.
  • the task allocating unit 1004 is configured to perform task allocation when the routing processor is used as the main scheduling route processor, and the task can be assigned to other routing processors.
  • the task scheduling module 100 of the routing processor further includes: a first timer unit 1005 and a scheduling state machine unit 1006.
  • the task scheduling module 100 of the routing processor further includes: a second timer unit 1007 and a routing table state machine unit 1008.
  • the second timer unit 1007 is configured to set the timing.
  • the routing table state machine unit 1008 is configured to divide the route summary state of the route processor, and instruct the route processor to perform different operations.
  • the routing table The state machine unit 1008 notifies the information unit 1001 to acquire the processing capability value information of the other route processors.
  • the routing table state machine unit 1008 triggers the route summary election unit 1003 to perform the election and indicates the route.
  • the processor is elected to enter the primary summary state when performing route summarization, and is not elected to perform backup summary status or summary status when performing route summarization.
  • the task assignment unit 1004 in the task scheduling module 100 of the route processor further includes: a determination unit 10041 and a processing unit 10042.
  • the determining unit 10041 is configured to determine, according to the interface list information, whether the packet processing task belongs to the local routing processor, and the processing unit 10042 is configured to: when the determining unit 10041 determines that the routing processor is not responsible for the routing processor, The routing processor responsible for the packet processing task and modifying the interface mapping table information.
  • the embodiment of the invention further provides a router. Please refer to FIG. 15, which is a schematic structural diagram of a router according to an embodiment of the present invention.
  • the router contains three routing processors 60, 70, and 80, but is not limited thereto.
  • the router may contain multiple routing processors.
  • the routing processors of the router are the same as the routing processors described in FIG. 13, and include a task scheduling module 100, a protocol running module 200, and a routing summary module 300.
  • the task scheduling module 100 is configured to discover and maintain a connection relationship with other routing processors, and perform task allocation according to processing capability values of the routing processors.
  • the protocol running module 200 is configured to run a basic link state routing protocol according to the assigned task, perform route calculation, and obtain a local routing table.
  • the route summary module 300 is configured to perform route summarization on the route calculation result, and may collect a local routing table obtained by routing calculation by each route processor, thereby forming a global routing table of the complete routing protocol.
  • the task scheduling module 100 of each routing processor further includes an information unit 1001, a scheduling election unit 1002, a route summary election unit 1003, a task allocation unit 1004, a first timer unit 1005, a scheduling state machine unit 1006, and a second timer unit 1007. And routing table state machine unit 1008.
  • the task assignment unit 1004 in the task scheduling module 100 further includes a decision unit 10041 and a processing unit 10042. The functions of these units are the same as those described above and will not be described in detail here.
  • the link state routing protocol operating mode in the prior art is concentrated on a single routing processor, and is limited by the processing capability of the routing processor itself, and cannot implement the extension of the link state routing protocol, and the implementation of the present invention
  • the example solution is: establishing a connection between nodes in the network, performing task scheduling on each node; each node runs a link state routing protocol according to the scheduled task, and performs route calculation to obtain a route calculation result; The routing calculation results are summarized and route summarization is performed.
  • the operation mode of the embodiment of the present invention can dynamically distribute the task scheduling, protocol execution, and route summary operations of the link state routing protocol to each node, that is, each route processor, so that the resources of each node can be fully utilized, thereby realizing An extension of the link state routing protocol.
  • the three functions of the link state routing protocol are dynamically distributed to each node, which can have greater fault tolerance. If a node of a distributed system fails, or a node's protocol runs during a large oscillation, it can isolate the impact on its nodes.

Abstract

L'invention concerne un procédé de traitement d'acheminement, un processeur d'acheminement et un routeur. Le procédé de traitement d'acheminement consiste en: l'établissement et l'entretien de la connexion entre chaque noeud du réseau, l'ordonnancement de la tâche de chaque noeud; chaque noeud exécute le protocole d'acheminement d'état de liaison conformément à la tâche ordonnancée, et calcule l'acheminement, obtient le résultat calculé de l'acheminement; obtention du résultat calculé de l'acheminement de chaque noeud et agrégation de l'acheminement. Le processeur d'acheminement comprend: le module d'ordonnancement de tâches, permettant l'ordonnancement de la tâche; le module d'exécution de protocole, permettant l'exécution du protocole d'acheminement d'état de liaison conformément à la tâche ordonnancée, le calcul de l'acheminement, et l'obtention du résultat calculé de l'acheminement; le module d'agrégation d'acheminement, permettant l'agrégation du résultat calculé de l'acheminement. Le routeur comprend une pluralité de processeurs d'acheminement.
PCT/CN2008/070898 2007-05-14 2008-05-07 Procédé de traitement d'acheminement, processeur d'acheminement et routeur WO2008138255A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007101020835A CN101309201B (zh) 2007-05-14 2007-05-14 路由处理方法、路由处理器及路由器
CN200710102083.5 2007-05-14

Publications (1)

Publication Number Publication Date
WO2008138255A1 true WO2008138255A1 (fr) 2008-11-20

Family

ID=40001697

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/070898 WO2008138255A1 (fr) 2007-05-14 2008-05-07 Procédé de traitement d'acheminement, processeur d'acheminement et routeur

Country Status (2)

Country Link
CN (1) CN101309201B (fr)
WO (1) WO2008138255A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103905337A (zh) * 2014-03-31 2014-07-02 华为技术有限公司 一种网络资源的处理装置、方法和系统
CN112468353A (zh) * 2019-09-09 2021-03-09 华为数字技术（苏州）有限公司 一种网络可达性检测方法及装置
CN113765781A (zh) * 2020-06-04 2021-12-07 华为技术有限公司 处理路由报文的方法、通信设备、存储介质及系统
EP3863244A4 (fr) * 2018-11-08 2021-12-22 Huawei Technologies Co., Ltd. Procédé de traitement de chemin, appareil et dispositif
CN114245288A (zh) * 2021-10-29 2022-03-25 重庆惠科金渝光电科技有限公司 一种服务设备的任务调度方法、服务设备及存储介质

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102130834B (zh) * 2011-03-15 2014-04-02 杭州华三通信技术有限公司 一种ip路由方法和路由器
CN102932260B (zh) * 2012-10-31 2016-03-30 福建星网锐捷网络有限公司 路由计算方法、设备及系统
CN103873312B (zh) * 2012-12-12 2017-05-31 中国移动通信集团公司 一种ip设备转发表容量的测试方法和系统
CN106100961A (zh) * 2016-07-21 2016-11-09 广州高能计算机科技有限公司 一种基于无限带宽的直连架构计算集群系统及构建方法
CN106952207A (zh) * 2017-03-10 2017-07-14 深圳市博信诺达经贸咨询有限公司 监控云平台分布式系统的选举方法及系统
CN107181628B (zh) * 2017-07-20 2020-05-05 杭州老板电器股份有限公司 双向无线通信方法、装置和终端
CN109981461B (zh) * 2017-12-27 2020-10-09 华为技术有限公司 一种数据传输方法、装置及系统
CN108710529A (zh) * 2018-04-28 2018-10-26 四川斐讯信息技术有限公司 一种远程任务处理方法、系统及无线路由器
CN111464442B (zh) * 2019-01-22 2022-11-18 华为技术有限公司 对数据包进行路由的方法和装置
CN113626161B (zh) * 2021-07-09 2023-12-22 中国科学院信息工程研究所 一种分布式多用户的数据调度方法及系统
CN114640618B (zh) * 2022-03-15 2024-03-12 平安国际智慧城市科技股份有限公司 集群路由调度方法、装置、电子设备及可读存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1719831A (zh) * 2005-07-15 2006-01-11 清华大学 基于集群路由器结构的高可用分布式边界网关协议系统
CN1917464A (zh) * 2006-09-01 2007-02-21 清华大学 基于逐步提升下界的分布式任务分配与计算方法
CN1960283A (zh) * 2006-10-20 2007-05-09 清华大学 可扩展路由器系统传输适配子层通信模式的性能评价方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100394742C (zh) * 2006-08-17 2008-06-11 北京邮电大学 开放最短路径优先路由协议的监测与分析系统及工作方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1719831A (zh) * 2005-07-15 2006-01-11 清华大学 基于集群路由器结构的高可用分布式边界网关协议系统
CN1917464A (zh) * 2006-09-01 2007-02-21 清华大学 基于逐步提升下界的分布式任务分配与计算方法
CN1960283A (zh) * 2006-10-20 2007-05-09 清华大学 可扩展路由器系统传输适配子层通信模式的性能评价方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ZHANG X. ET AL.: "Distributed BGP protocaol system Architecture", JOURNAL OF UNIVERSITY OF DEFENCE TECHINOLOGY, vol. 28, no. 3, 30 June 2006 (2006-06-30) *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103905337A (zh) * 2014-03-31 2014-07-02 华为技术有限公司 一种网络资源的处理装置、方法和系统
CN103905337B (zh) * 2014-03-31 2018-01-23 华为技术有限公司 一种网络资源的处理装置、方法和系统
US10200287B2 (en) 2014-03-31 2019-02-05 Huawei Technologies Co., Ltd. Network resource processing apparatus, method, and system
EP3863244A4 (fr) * 2018-11-08 2021-12-22 Huawei Technologies Co., Ltd. Procédé de traitement de chemin, appareil et dispositif
CN112468353A (zh) * 2019-09-09 2021-03-09 华为数字技术（苏州）有限公司 一种网络可达性检测方法及装置
CN112468353B (zh) * 2019-09-09 2023-11-21 华为数字技术（苏州）有限公司 一种网络可达性检测方法及装置
CN113765781A (zh) * 2020-06-04 2021-12-07 华为技术有限公司 处理路由报文的方法、通信设备、存储介质及系统
CN113765781B (zh) * 2020-06-04 2022-07-12 华为技术有限公司 处理路由报文的方法、通信设备、存储介质及系统
CN114245288A (zh) * 2021-10-29 2022-03-25 重庆惠科金渝光电科技有限公司 一种服务设备的任务调度方法、服务设备及存储介质

Also Published As

Publication number Publication date
CN101309201A (zh) 2008-11-19
CN101309201B (zh) 2012-05-23

Similar Documents

Publication Publication Date Title
WO2008138255A1 (fr) Procédé de traitement d'acheminement, processeur d'acheminement et routeur
US11861419B2 (en) Asynchronous object manager in a network routing environment
US10263889B2 (en) Data forwarding method, device, and system in software-defined networking
US6985959B1 (en) Constraint route dissemination using distributed route exchanges
EP2962431B1 (fr) Arbre maximal dans des commutateurs matriciels
US9210070B2 (en) Implementing multiple portals into an RBRIDGE network
US7859992B2 (en) Router redundancy in data communication networks
US7835303B2 (en) Packet-switched network topology tracking method and system
CN102055665B (zh) 广播上或nbma上的ospf点到多点模式
JP6072278B2 (ja) 仮想シャーシシステム制御プロトコル
JP2022533238A (ja) Ｔｓｎ内のコントローラ間の通信のための方法、装置、およびシステム
US10447652B2 (en) High availability bridging between layer 2 networks
US20130151445A1 (en) Method and System for Survival of Data Plane Through a Total Control Plane Failure
WO2015058705A1 (fr) Procédé et appareil de distribution de données
CN111083061B (zh) 一种确定组播流的df的方法、设备及系统
US8625407B2 (en) Highly available virtual packet network device
CN103825826A (zh) 一种动态路由的实现方法和装置
JP6109954B2 (ja) 仮想シャーシシステムにおけるパススルーモードのためのシステムおよび方法
US20070280276A1 (en) Method and apparatus for managing client layer communications services
WO2021004213A1 (fr) Procédé et appareil pour déterminer une étiquette de chemin de réseau de fusion, support de stockage et dispositif électronique
JP2006019867A (ja) 経路計算システム
WO2012155351A1 (fr) Procédé et dispositif de réseau destinés à générer des entrées de redirection de tunnellisation

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08734253

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08734253

Country of ref document: EP

Kind code of ref document: A1