CN100452797C - High-available distributed boundary gateway protocol system based on cluster router structure - Google Patents
High-available distributed boundary gateway protocol system based on cluster router structure Download PDFInfo
- Publication number
- CN100452797C CN100452797C CNB2005100121929A CN200510012192A CN100452797C CN 100452797 C CN100452797 C CN 100452797C CN B2005100121929 A CNB2005100121929 A CN B2005100121929A CN 200510012192 A CN200510012192 A CN 200510012192A CN 100452797 C CN100452797 C CN 100452797C
- Authority
- CN
- China
- Prior art keywords
- node
- peer
- main controlled
- message
- route
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a high-available distributed boundary gateway protocol system based on a cluster router structure, which belongs to the structure field of the route protocol system. The present invention is characterized in that a node selected as a main control node, another node used as a spare node of the main control node, a connection node and at least two slave nodes are arranged in the cluster router structure. The present invention makes use of the spare node of the main control node so that the system has no single failure node, which enhances the reliability of the system; the present invention makes use of the reasonable allocation of partitioning algorithm so that each slave node has balance load, which enhances the performance of the whole BGP system; thus, the present invention realizes the quick processing to BGP messages and the reliable service of the BGP.
Description
Technical field
High-available distributed boundary gateway protocol system based on cluster router structure belongs to Routing Protocol system configuration field, relates in particular to binode redundancy technique and multinode distributed computing system.
Background technology
The develop rapidly of Internet is all had higher requirement to computing capability, transfer capability and the port density of the network equipment.Single routing node has its obstacle that is difficult to go beyond at aspects such as reliability, performance extensibility, scale extensibility and service extensibilities, can not satisfy Internet development need of future generation.The core router technology is experiencing huge variation, is representative with T bit core router, but router architecture towards router troop, distributed propagation direction development.
The router hardware architecture develops into distributed parallel processing mode under the cluster topology from centralized control, and the development of router software technology then relatively lags behind.In traditional router, all Routing Protocols, the computing function that routing policy is relevant can only be moved on individual node, and other nodes are just as backup node, and inreal realization software systems can be expanded and be high available.
Border Gateway Protocol (BGP) is as procotol between the Internet territory, and the route of being responsible between autonomous territory can reach the mutual of information.Connect mutually between the bgp protocol peer-to-peer, by sending the variation of routing update (UPDATE) message notifying routing iinformation.The priority of the policy calculation routing iinformation of each BGP entity basis oneself, and select optimum route.
The bgp protocol performance of Internet core router control plane is faced with new challenges.At present the bgp routing table capacity of the key node of Internet presents the trend that linear growth and exponential increase replace, under big capacity routing table condition, router need consume more memory space, and it is slack-off to cause routing update to handle, and increases the computing cost of bgp protocol.Tradition one process central controlled BGP is implemented in the growth requirement that can't satisfy following Internet on neighbours' scale of reliability, routing list capacity, route computing capability and support.
The present invention makes full use of Distributed Calculation resource and the storage capacity that cluster topology router hardware platform is provided, designed rational partitioning algorithm, BGP is realized being distributed to each node parallel running, make the computational load and the memory consumption of each node obtain equilibrium, thereby improve the whole efficiency of BGP system.Simultaneously, the single failpoint that may exist in the system is realized redundancy backup, reach the purpose that improves the total system reliability.
Summary of the invention
The objective of the invention is to overcome the deficiency of computing capability, storage capacity and reliability that traditional single node BGP realizes, a kind of high-available distributed BGP implementation based on cluster router structure is provided.
The technical solution adopted for the present invention to solve the technical problems is: as shown in Figure 1, in cluster topology, a node is a connected node, and a node is as main controlled node, and another node is the backup node of main controlled node, and other nodes conducts are from node.Connected node is responsible for and being connected of exterior I nternet, and externally transmits data between Internet and the internal node.Main controlled node is in charge of from node and with peer-to-peer and is connected, and according to partitioning algorithm, routing update (UPDATE) message of peer-to-peer is distributed to from node processing, from node the UPDATE message is resolved the back and calculates route.
Form by two parts based on the high-available distributed BGP of cluster router structure system: main controlled node subsystem and from the node subsystem.The main controlled node subsystem operates on the main controlled node, realize and connect peer-to-peer connect, to from the management of node and the distribution of load, simultaneously, important information is sent to backup node; Operate in from node from the node subsystem, be used to resolve UPDATE message and route and calculate.
By the centralized control of main controlled node, make distributed BGP system be convenient to management, by backup, make system not have single failpoint to main controlled node, improved the reliability of system; By the reasonable distribution of partitioning algorithm, make respectively from the load balancing of node, improved the performance of whole BGP system.
The invention is characterized in: in cluster router structure, choose a node as main controlled node, another node is the backup node of main controlled node, constitutes the main controlled node subsystem; A connected node; Other nodes constitute from the node subsystem as from node; Main controlled node, form described high-available distributed boundary gateway protocol system by the high speed switching network based on cluster router structure from node and connected node, described system transmission control protocol Network Based connects by connected node and peer-to-peer, and described peer-to-peer is meant the boundary gateway protocol system with described system interaction protocol information; Wherein,
A. the main controlled node subsystem operates on the described main controlled node, is responsible for following task: connect with described peer-to-peer; According to partitioning algorithm the route updating packet that is loaded with routing update message that receives from peer-to-peer is sent to accordingly from node processing, described routing update message is with " UPDATE message " expression; Receive respectively the local optimum route after the node UPDATE Message Processing and therefrom select global optimum's route; Give described peer-to-peer with the UPDATE message announcement; Management sends to described backup node from node and important messages;
On described main controlled node, safeguard following database:
Global optimum's route data information bank: preserve the router global optimum routing iinformation that route calculates;
From node database: preserve work the distributed BGP system from node ID, each is responsible for situation from the work of node, and main controlled node and from the communication operation backup of node, described BGP system refers to boundary gateway protocol system;
Output routing information base: preserve the routing update information that sends to peer-to-peer;
On described main controlled node, disposed following software module:
(1) distributed partitioning algorithm module
After described BGP system and new peer-to-peer connected, what main controlled node was selected the load minimum handled the UPDATE message of new peer-to-peer from node;
(2) from the node administration module
This module comprises following each submodule:
(2.1) add submodule from node
Newly added node is by administrator configurations ID and main controlled node ID, when new node adds Cluster, send the message announcement main controlled node immediately, main controlled node is responded this message, confirm the adding of new node, and the information of new node joined from the nodal information storehouse, described Cluster is a cluster router structure;
(2.2) withdraw from submodule from node
The information from node is withdrawed from main controlled node deletion from the nodal information storehouse, and according to partitioning algorithm this peer-to-peer of handling from node redistribute to other from node processing;
(2.3) from the node state monitoring submodule
Periodically all send apply for information from node to main controlled node to other, and that receives apply for information replys message from node to main controlled node, and that does not reply message will be considered to fault from node;
(2.4) from the node failure processing sub
Main controlled node finds that by condition monitoring certain breaks down from node, main controlled node deletion from the nodal information storehouse this from the information of node, and according to partitioning algorithm this peer-to-peer of handling from node redistribute to other from node processing;
(3) with the peer-to-peer module that connects
This module realizes and being connected of peer-to-peer successively according to the following steps:
Step 3-1: startup is connected with peer-to-peer;
Step 3-2: start TCP and connect;
Step 3-3: set up BGP and connect, carry out according to the following steps;
Step 3-3-1: send the message of inquiring that is used for setting up the bgp peer connection to peer-to-peer, be called OPEN message;
Step 3-3-2: after receiving the OPEN message of peer-to-peer, reply the notice message that keeps BGP to connect to peer-to-peer and be called KEEPALIVE message, wait for the KEEPALIVE message of peer-to-peer simultaneously, connection status is set to OpenConfirm;
Step 3-3-3: receive the KEEPALIVE message of peer-to-peer, finish and being connected of peer-to-peer, connection status is set to Established;
Step 3-4: main controlled node according to described allocation algorithm select the load minimum from node, by this UPDATE message from this peer-to-peer of node processing;
(4) treatments B GP message module
This module realizes Message Processing according to the following steps:
Step 4-1: main controlled node calls TCP socket and reads function and obtain BGP message;
Step 4-2: main controlled node is handled different types of messages:
Step 4-2-1: handle OPEN message
From OPEN message, read the value in version number, autonomous territory number, time-out time, four territories of BGP identifier, and checked respectively;
Judge the neighbor node whether OPEN message be provided with from the keeper according to autonomous territory number and BGP identifier: if not, then send the failure message of representing with NOTIFICATION and be connected with the peer-to-peer interruption; If then carry out following detection;
Carry out collision detection according to the connection collision detection of bgp protocol definition: just send failure message being connected with interruption and this peer-to-peer if conflict is arranged and need close this connections; If there is not conflict, just carry out following the detection;
Whether correct: if incorrect, send failure message and connect with interruption to this peer-to-peer if detecting version number; If correct, just carry out following the detection;
Detect time-out time and whether be zero or less than 3 seconds: if not, failure message sent to interrupt and being connected of this peer-to-peer; Otherwise, just carry out following the detection;
Time-out time value in the OPEN message that the time-out time of this router bgp of comparison entity setting is put and received, to be worth the little time-out time value as this connection, the value that the notice message timer that keeps the BGP connection is set is 1/3rd of a described connection time-out time value;
Send the notice message that keeps BGP to connect and confirm to receive OPEN message to this peer-to-peer, connection status is set to the OpenConfirm state;
Step 4-2-2: handle the notice message that keeps BGP to connect
When connection status was the OpenConfirm state, main controlled node became connection status the Established state and sends the notice message that maintenance BGP connects to peer-to-peer;
When connection status is the Established state, increase the notice message count pick up that keeps BGP to connect, replacement time-out time timer;
Step 4-2-3: handle the routing update message that receives from peer-to-peer
After main controlled node is received routing update message, routing update message is sent to accordingly from node; Below doing, check from node;
Whole attribute length is conducted a survey,,, abandon this routing update message by failure message announcement peer-to-peer if surpass specific length;
If comprise unavailable route in the routing update message, check whether this route length is correct, if surpass setting, send failure message and abandon this routing update message to peer-to-peer; Otherwise, this unavailable route is carried out syntax check, if wrong, just abandon this routing update message; If correct, the value of just obtaining unavailable route deposits in the variable;
If comprise available route in the routing update message, then check the length of this route, if surpass setting, send failure message and abandon this routing update message to peer-to-peer; Otherwise, each territory of the path attribute of this available route is checked, if wrong, just abandon this routing update message; If correct, the value of just obtaining each territory of routing property deposits in the structure variable;
For unavailable route, this route of deletion from the input routing information base starts distributed BGP route and calculates;
For available route, upgrade the input routing information base, the storing path attribute starts distributed BGP route and calculates;
Step 4-2-4: handling failure message
Main controlled node obtains the value in each territory in this failure message, shows error message, and disconnection is connected with the fault peer-to-peer; Then, the processing of notifying this peer-to-peer UPDATE message comprises route that the fault peer-to-peer is issued and all relevant informations of routing property from knot removal;
(5) binode redundancy backup module
Main controlled node and backup node form the hardware environment of binode backup, but the hardware detection mechanism that does not provide mutual software and hardware to lose efficacy between the node, and they realize the status monitoring of two-shipper by the heartbeat algorithm; Main controlled node and backup node all move the main controlled node subsystem, and when the main controlled node operate as normal, backup node can only receive the backup messages of main controlled node, and the Backup Data in the backup messages is backuped in the corresponding database; When main controlled node broke down, backup node was taken over the work of main controlled node;
For realizing this failover, the method that has adopted is to carry out checkpoint (CheckPoint) state backup, carries out the state rollback then and recovers; This module realizes according to the following steps:
The state-detection of step 1. binode backup
Main controlled node timed sending query messages is given backup node, and backup node is replied message; When main controlled node can not receive the answer message of backup node, just think the backup node fault, at this moment main controlled node will can not send backup messages to backup node; When backup node can not be received the query messages of main controlled node, just think that main controlled node breaks down, at this moment backup node will carry out state rollback recovery, take over the work of main controlled node;
The backup of step 2. state
In the main controlled node module, need the state information of backup can be divided into two classes, a class is: the state information that communication is relevant comprises main controlled node and communication information from node; Another kind ofly be: use relevant status data, comprise in the output route, these cluster routers of global optimum's route, this bgp protocol of configuration parameters such as the IP address of other bgp peer that connects with this bgp protocol and autonomous system number ASN, these cluster routers from node;
For the relevant status data of communication, any once-through operation all may relate to the state variation from node, so their state backup must be accomplished the backup of small grain size, main controlled node each time with after node carries out communication, carry out corresponding state backup; When main controlled node with from the node communication time, main controlled node backups to the communication data read-write operation in the backup node simultaneously, what comprise read-write operation in the read-write operation of backup reads and writes data, data length, and the result that returns of operation;
And for using relevant status data, data volume is big, and the backup granularity is bigger, and main controlled node sends to backup node to these application-dependent data every one time;
The rollback of step 3. state recovers
When main controlled node breaks down, backup node is taken over main controlled node work, at this moment using relevant status data has been kept in the associated databases of backup node, main controlled node subsystem on the backup node can directly use these status datas to start, repeat the communication data read-write operation then, but the communication data read-write operation is not to carry out actual data read-write operation, but returns corresponding data and result from the read-write operation of backup;
B. from the node subsystem, be responsible for routing update message and handle, the local optimum Route Selection also will cooperate main controlled node to carry out global optimum's Route Selection; Should distributed BGP route calculating sub module only be arranged from the node subsystem, according to the following steps to finish from the task of node subsystem:
(1) priority is calculated
When from node to the UPDATE packet parsing after, finding has available route, triggers priority computational process; In priority computational process, locking input routing information base according to pre-set strategy, calculates a priority to new available route or alternative route; After calculating is finished, untie the input routing information base, trigger routing procedure;
(2) Route Selection
In distributed BGP system, Route Selection was divided into for two steps to be finished, and the first step is to select the local optimum route from node, and second step was that main controlled node is selected global optimum's route;
After priority computational process is finished, at first activate from the node Route Selection; From node routing procedure locking input routing information base, from all routes identical, select a highest route of priority with new available route destination, if the route of preserving in the route of selecting and the local optimum routing information base is identical, finish routing procedure; Otherwise, upgrade the local optimum information bank, untie the input routing information base, the distributed message mechanism by system sends to main controlled node to this routing iinformation simultaneously, activates main controlled node overall situation routing procedure;
In store all local optimum routes on the main controlled node from node, when receiving one during from new route that node sends, locking global optimum routing information base, from all routes identical, select a highest route of priority with new available route destination, upgrade global optimum's routing information base, untie global optimum's routing information base, trigger the route distribution process;
(3) route distribution
The route distribution process is routed selection course and activates, the renewal route of global optimum's routing information base is packaged in the UPDATE message, send to each and the bgp peer that this bgp protocol connects, in the output routing information base of each peer-to-peer, write down the route that sends simultaneously;
Proposed by the invention based on the high-available distributed BGP of cluster router structure system, the traditional single node BGP systematic function and the deficiency of reliability have been overcome, a kind of new BGP system realization scheme is provided, by making up a cluster topology distributed processing system(DPS), can realize the fast processing of BGP message and the reliability services of BGP.
Description of drawings
Fig. 1. based on the distributed BGP system configuration of cluster router structure
Fig. 2. from node status information inquiry schematic diagram
Fig. 3. main controlled node subsystem and the peer-to-peer flow chart that connects
Fig. 4. distributed BGP route is calculated schematic diagram
Fig. 5. the state backup and the rollback of error-tolerant applications system recover schematic diagram
Embodiment
Mainly constitute based on the high-available distributed BGP of cluster router structure system: main controlled node subsystem and from the node system subsystem by two subsystems.
● major function
Main controlled node subsystem: connect with peer-to-peer; According to partitioning algorithm the route updating packet that receives is sent to accordingly from node processing; Receive respectively the local optimum route after the Node B GP Message Processing and select global optimum's route; Routing update is announced to peer-to-peer; Management is from node.
From the node subsystem: UPDATE message is resolved; Calculate the priority of each bar route; Select the local optimum route.
● Same of Important
BGP entity: the BGP system that moves on the router.
Bgp peer: with the BGP system of current system interaction protocol message.
BGP has defined 4 kinds of messages:
OPEN message: the message of inquiring that is used for setting up the bgp peer connection;
UPDATE message: routing update message;
KEEPALIVE message: the notice message that keeps BGP to connect;
NOTIFICATION message: failure notice message;
Simultaneously BGP defined six kinds with the peer-to-peer connection status: it is the Idle state that the startup peer-to-peer is connected, start TCP to connect is the Connect state, wait for TCP to connect be the Active state, send Open message to be the OpenSent state, wait for that receiving the OPEN message authentication is that OpenConfirm state, BGP successful connection are the Established state, be used for describing the different phase that is connected with bgp peer in the process of foundation.In each connection status, need the BGP message difference of reception, and, can be according to the BGP message alteration connection status that receives
The database of main controlled node subsystem maintenance:
global optimum routing information base: preserve the router global optimum routing iinformation that route calculates;
is from node database: preserve work the distributed BGP system from node ID, and each is from the operating load situation of node.
exports routing information base: preserve the route updating packet information that sends to peer-to-peer;
Database from the node subsystem maintenance:
Input routing information base: preserve the peer-to-peer that receives and upgrade message information.
Local optimum routing information base: preserve this node best route information that calculates from the node route.
● distributed partitioning algorithm
Which having write down from the nodal information storehouse of master control subsystem maintenance currently have from node, each has distributed the work of treatment of what peer-to-peer messages from node, after BGP system and new peer-to-peer connected, the master control subsystem was selected the UPDATE message from the new peer-to-peer of node processing of load minimum.This allocation algorithm can guarantee that respectively the duty ratio from node is balanced.
● from node administration
is from the adding of node
1. configuration is from the identification number of node and the identification number of main controlled node.
2. send the adding notice message to main controlled node, the wait main controlled node is receiveed the response;
3. main controlled node is received the adding notice message from node, and the information of new node is joined from the node storehouse, sends to receive the response to from node.
withdraws from from node
1. the information from node is withdrawed from the main controlled node deletion from the node storehouse;
According to partitioning algorithm withdraw from the load of handling from node redistribute to other from node processing;
is from the status checkout of node
Main controlled node periodically sends apply for information to all from node, receives that the node of apply for information is replied message to main controlled node, and that does not reply message will be considered to fault from node.Main and subordinate node state information searching flow process as shown in Figure 2.
is from the troubleshooting of node
1. main controlled node is by finding that from the node state inspection fault is from node;
2. main controlled node is waited for from node and being recovered, and the stand-by period is set by the keeper, and buffer memory is by the UPDATE message of fault from node processing;
3. if in the stand-by period, do not resume work from node, main controlled node deletion from the node storehouse fault from the information of node, the load of fault being handled from node according to partitioning algorithm redistribute to other from node processing.
4. if resume work from node at the stand-by period internal fault, main controlled node sends to its processing with the UPDATE message of buffer memory.
● connect with peer-to-peer
Current router BGP entity at first will connect with peer-to-peer, and flow process as shown in Figure 3.BGP is based on the Routing Protocol on the Network Transmission control protocol (TCP).Therefore, connecting with peer-to-peer to be divided into two steps: set up TCP earlier and be connected, set up BGP again and connect.Connecting before with peer-to-peer, connection status is set to Idle.
sets up TCP and is connected with two kinds of patterns: aggressive mode and Passive Mode
Aggressive mode: the main controlled node subsystem is initiatively initiated the TCP connection request to peer-to-peer, by three-way handshake and peer-to-peer
Passive module: 179 ports of main controlled node subsystem monitoring TCP, peer requests are set up TCP and are connected, and set up TCP by three-way handshake and peer-to-peer and are connected;
Connection status is set to Connect before starting the TCP connection.
sets up BGP and connects
1. send OPEN message to peer-to-peer, wait for the OPEN message of peer-to-peer, connection status is set to OpenSent;
2. receive the OPEN message of peer-to-peer, reply KEEPALIVE message, wait for the KEEPALIVE message of peer-to-peer simultaneously, connection status is set to OpenConfirm;
3. receive KEEPALIVE message, finish and being connected of peer-to-peer, connection status is set to Established.
After BGP entity and peer-to-peer connect, main controlled node according to allocation algorithm select the load minimum from node, by this UPDATE message from this peer-to-peer of node processing.
● treatments B GP message flow process
The main controlled node subsystem is read function and is obtained the BGP message by calling TCP socket.
OPEN Message Processing
In distributed BGP system, the processing of OPEN message realizes that on main controlled node the handling process of OPEN message is as follows:
1. from the OPEN message, read the value in version number (Version), autonomous territory number (AS Number), time-out time (Hold Time) and four territories of BGP identifier (BGP Identiifier);
2. judge the neighbor node whether OPEN message be provided with from the keeper according to AS Number and BGPIdentifier.If not, send NOTIFICATION message to peer-to-peer.
3. carry out collision detection according to the connection collision detection definition of bgp protocol,, then send NOTIFICATION message and interrupt this connection to peer-to-peer if conflict is arranged and need close this connection.
4. whether correct, incorrect transmission NOTIFICATION message is interrupted this connection to peer-to-peer if detecting version number.
5. whether correct, incorrect transmission NOTIFICATION message is interrupted this connection to peer-to-peer if detecting AS Number.
6. detect Hold Time and whether be zero or greater than 3 seconds, if not, send NOTIFICATION message and interrupt this connection to peer-to-peer.
7. the HoldTime value in the OPEN message that compares the Hold Time value of this router bgp entity setting and accept to be worth the little Hold Time value as this connection, is provided with KEEPALIVE message timer for connecting 1/3rd of Hold Time value.
8. send KEEPALIVE message and confirm to accept OPEN message to peer-to-peer, the finite state that peer-to-peer is connected becomes the OpenConfirm state.
KEEPALIVE Message Processing
In distributed BGP system, the processing of KEEPALIVE message realizes on main controlled node.KEEPALIVE message has only a message header, and is fairly simple to its processing.
When connection status was the OpenConfirm state, handling process was as follows:
1. connection status is become the Established state.
2. send KEEPALIVE message to peer-to-peer.
3. the current router routing table is all sent to peer-to-peer by UPDATE message.
When connection status was the Established state, handling process was as follows:
1. increase KEEPALIVE message sink counting.
2. replacement HOLDTime timer.
UPDATE Message Processing
In distributed BGP system, UPDATE message is received by main controlled node, and the processing of UPDATE message is being realized that from node handling process is as follows:
Main controlled node receives UPDATE message, and the UPDATE message is sent to accordingly from node;
To whole attribute length inspection,,, abandon this UPDATE message by NOTIFICATION message informing peer-to-peer if surpass specific length;
If comprise unavailable route in the UPDATE message, check whether unavailable route length is correct.If surpass specific length,, abandon this UPDATE message by NOTIFICATION message informing peer-to-peer;
Unavailable route is carried out syntax check, if mistake abandons this UPDATE message; If correct, the value of obtaining unavailable route deposits in the variable;
If comprise available route in the UPDATE message,,,, abandon this UPDATE message by NOTIFICATION message informing peer-to-peer if oversize to available route length check;
Each territory to the path attribute of available route is checked, if wrong, by NOTIFICATION message informing peer-to-peer, abandons this UPDATE message; If correct, the value of obtaining each territory of path attribute deposits in the structure variable;
Available route is carried out syntax check, if mistake abandons this UPDATE message; If correct, the value of obtaining unavailable route deposits in the variable;
If unavailable route is arranged, this route of deletion from the input routing information base starts distributed BGP route and calculates;
If available route is arranged, upgrade the input routing information base, the storing path attribute; Starting distributed BGP route calculates.
NOTIFICATION Message Processing
In distributed BGP system, the processing of NOTIFICATION message cooperated by main controlled node with from node realizes that handling process is as follows:
1. obtain the value in each territory in the NOTIFICATION message;
2. error message is shown;
3. disconnect and being connected of peer-to-peer.
This peer-to-peer of main controlled node notifier processes UPDATE message from all relevant with it relevant informations of knot removal (comprising route that it is issued and the attribute of describing these routes), start distributed BGP route and calculate;
● distributed BGP route is calculated
In bgp protocol, the BGP route is calculated and is called decision process again, is divided into for three phases: priority calculating, Route Selection, route distribution.This three phase is respectively three independently processes, is excited by different incidents, and Fig. 4 calculates schematic diagram for route.
Distributed BGP routing algorithm is described below:
1. priority is calculated
When from node to the UPDATE packet parsing after, finding has available route, triggers priority computational process.In priority computational process, locking input routing information base according to pre-set strategy, calculates a priority to new available route or alternative route.After calculating is finished, untie the input routing information base, trigger routing procedure.
2. Route Selection
In distributed BGP system, Route Selection was divided into for two steps to be finished, and the first step is to select the local optimum route from node, and second step was that main controlled node is selected global optimum's route.
After priority computational process is finished, at first activate from the node Route Selection.From node routing procedure locking input routing information base, from all routes identical, select a highest route of priority with new available route destination, if the route of preserving in the route of selecting and the local optimum routing information base is identical, finish routing procedure; Otherwise, upgrade the local optimum information bank, untie the input routing information base, the distributed message mechanism by system sends to main controlled node to this routing iinformation simultaneously, activates main controlled node overall situation routing procedure.
In store all local optimum routes on the main controlled node from node, when receiving one during from new route that node sends, locking global optimum routing information base, from all routes identical, select a highest route of priority with new available route destination, upgrade global optimum's routing information base, untie global optimum's routing information base, trigger the route distribution process.
3. route distribution
The route distribution process is routed selection course and activates, and the renewal route of global optimum's routing information base is packaged in the UPDATE message, sends to each opposite end, simultaneously the route that record sends in the output routing information base of each peer-to-peer.
● the binode redundancy backup of main controlled node
Main controlled node and backup node form the hardware environment of binode backup, but the hardware detection mechanism that does not provide mutual software and hardware to lose efficacy between the node, and they realize the status monitoring of two-shipper by the heartbeat algorithm.Main controlled node and backup node all move the main controlled node subsystem, and when the main controlled node operate as normal, backup node can only receive the backup messages of main controlled node, and the Backup Data in the backup messages is backuped in the corresponding database; When main controlled node broke down, backup node was taken over the work of main controlled node.
For realizing this failover, the method that has adopted is to carry out checkpoint (CheckPoint) state backup, carrying out the state rollback then recovers, as shown in Figure 5: the main controlled node subsystem on the main controlled node is carried out step by step, after finishing, each step all inserts a checkpoint, the state that check system is current, and system mode is saved in the backup node corresponding database, main controlled node subsystem on main controlled node is in certain step, when breaking down as step 3, backup node returns to the system status information of checkpoint 2 on the backup node, and the main controlled node subsystem of backup node can continue execution in step 3.
Handling process is as follows:
Main controlled node timed sending query messages is given backup node, and backup node is replied message; When main controlled node can not receive the answer message of backup node, just think the backup node fault, at this moment main controlled node will can not send backup messages to backup node; When main controlled node can be received the answer message of backup node, just think the backup node operate as normal, can be to backup node Status of Backups information;
In the main controlled node module, need the state information of backup can be divided into two classes, a class is: the state information that communication is relevant comprises main controlled node and communication information from node; Another kind ofly be: use relevant status data, comprise in the output route, these cluster routers of global optimum's route, this bgp protocol of configuration parameters such as the IP address of other bgp peer that connects with this bgp protocol and autonomous system number ASN, these cluster routers from node;
For the relevant status data of communication, any once-through operation all may relate to the state variation from node, so their state backup must be accomplished the backup of small grain size, main controlled node each time with after node carries out communication, carry out corresponding state backup; When main controlled node with from the node communication time, main controlled node backups to the communication data read-write operation in the backup node simultaneously, what comprise read-write operation in the read-write operation of backup reads and writes data, data length, and the result that returns of operation;
And for using relevant status data, data volume is big, and the backup granularity is bigger, and main controlled node sends to backup node to these application-dependent data every one time;
When backup node can not be received the query messages of main controlled node, just think that main controlled node breaks down, at this moment backup node will carry out state rollback recovery, take over the work of main controlled node;
Backup node is taken over main controlled node work, at this moment using relevant status data has been kept in the associated databases of backup node, main controlled node subsystem on the backup node directly uses these status datas to start, repeat the communication data read-write operation then, but the communication data read-write operation is not to carry out actual data read-write operation, but returns corresponding data and result from the read-write operation of backup.
Claims (1)
1. based on the high-available distributed boundary gateway protocol system of cluster router structure, it is characterized in that: in cluster router structure, choose a node as main controlled node, another node is the backup node of main controlled node, constitutes the main controlled node subsystem; A connected node; Other nodes constitute from the node subsystem as from node; Main controlled node, form described high-available distributed boundary gateway protocol system by the high speed switching network based on cluster router structure from node and connected node, described system transmission control protocol Network Based connects by connected node and peer-to-peer, and described peer-to-peer is meant the boundary gateway protocol system with described system interaction protocol information; Wherein,
A. the main controlled node subsystem operates on the described main controlled node, is responsible for following task: connect with described peer-to-peer; According to partitioning algorithm the route updating packet that is loaded with routing update message that receives from peer-to-peer is sent to accordingly from node processing, described routing update message is with " UPDATE message " expression; Receive respectively the local optimum route after the node UPDATE Message Processing and therefrom select global optimum's route; Give described peer-to-peer with the UPDATE message announcement; Management sends to described backup node from node and important messages;
On described main controlled node, safeguard following database:
Global optimum's route data information bank: preserve the router global optimum routing iinformation that route calculates;
From node database: preserve work the distributed BGP system from node ID, each is responsible for situation from the work of node, and main controlled node and from the communication operation backup of node, described BGP system refers to boundary gateway protocol system;
Output routing information base: preserve the routing update information that sends to peer-to-peer;
On described main controlled node, disposed following software module:
(1) distributed partitioning algorithm module
After described BGP system and new peer-to-peer connected, what main controlled node was selected the load minimum handled the UPDATE message of new peer-to-peer from node;
(2) from the node administration module
This module comprises following each submodule:
(2.1) add submodule from node
Newly added node is by administrator configurations ID and main controlled node ID, when new node adds Cluster, send the message announcement main controlled node immediately, main controlled node is responded this message, confirm the adding of new node, and the information of new node joined from the nodal information storehouse, described Cluster is a cluster router structure;
(2.2) withdraw from submodule from node
The information from node is withdrawed from main controlled node deletion from the nodal information storehouse, and according to partitioning algorithm this peer-to-peer of handling from node redistribute to other from node processing;
(2.3) from the node state monitoring submodule
Periodically all send apply for information from node to main controlled node to other, and that receives apply for information replys message from node to main controlled node, and that does not reply message will be considered to fault from node;
(2.4) from the node failure processing sub
Main controlled node finds that by condition monitoring certain breaks down from node, main controlled node deletion from the nodal information storehouse this from the information of node, and according to partitioning algorithm this peer-to-peer of handling from node redistribute to other from node processing;
(3) with the peer-to-peer module that connects
This module realizes and being connected of peer-to-peer successively according to the following steps:
Step 3-1: startup is connected with peer-to-peer;
Step 3-2: start TCP and connect;
Step 3-3: set up BGP and connect, carry out according to the following steps;
Step 3-3-1: send the message of inquiring that is used for setting up the bgp peer connection to peer-to-peer, be called OPEN message;
Step 3-3-2: after receiving the OPEN message of peer-to-peer, reply the notice message that keeps BGP to connect to peer-to-peer and be called KEEPALIVE message, wait for the KEEPALIVE message of peer-to-peer simultaneously, connection status is set to OpenConfirm;
Step 3-3-3: receive the KEEPALIVE message of peer-to-peer, finish and being connected of peer-to-peer, connection status is set to Established;
Step 3-4: main controlled node according to described allocation algorithm select the load minimum from node, by this UPDATE message from this peer-to-peer of node processing;
(4) treatments B GP message module
This module realizes Message Processing according to the following steps:
Step 4-1: main controlled node calls TCP socket and reads function and obtain BGP message;
Step 4-2: main controlled node is handled different types of messages:
Step 4-2-1: handle OPEN message
From OPEN message, read the value in version number, autonomous territory number, time-out time, four territories of BGP identifier, and checked respectively;
Judge the neighbor node whether OPEN message be provided with from the keeper according to autonomous territory number and BGP identifier: if not, then send the failure message of representing with NOTIFICATION and be connected with the peer-to-peer interruption; If then carry out following detection;
Carry out collision detection according to the connection collision detection of bgp protocol definition: just send failure message being connected with interruption and this peer-to-peer if conflict is arranged and need close this connections; If there is not conflict, just carry out following the detection;
Whether correct: if incorrect, send failure message and connect with interruption to this peer-to-peer if detecting version number; If correct, just carry out following the detection;
Detect time-out time and whether be zero or less than 3 seconds: if not, failure message sent to interrupt and being connected of this peer-to-peer; Otherwise, just carry out following the detection;
Time-out time value in the OPEN message that the time-out time of this router bgp of comparison entity setting is put and received, to be worth the little time-out time value as this connection, the value that the notice message timer that keeps the BGP connection is set is 1/3rd of a described connection time-out time value;
Send the notice message that keeps BGP to connect and confirm to receive OPEN message to this peer-to-peer, connection status is set to the OpenConfirm state;
Step 4-2-2: handle the notice message that keeps BGP to connect
When connection status was the OpenConfirm state, main controlled node became connection status the Established state and sends the notice message that maintenance BGP connects to peer-to-peer;
When connection status is the Established state, increase the notice message count pick up that keeps BGP to connect, replacement time-out time timer;
Step 4-2-3: handle the routing update message that receives from peer-to-peer
After main controlled node is received routing update message, routing update message is sent to accordingly from node; Below doing, check from node;
Whole attribute length is conducted a survey,,, abandon this routing update message by failure message announcement peer-to-peer if surpass specific length;
If comprise unavailable route in the routing update message, check whether this route length is correct, if surpass setting, send failure message and abandon this routing update message to peer-to-peer; Otherwise, this unavailable route is carried out syntax check, if wrong, just abandon this routing update message; If correct, the value of just obtaining unavailable route deposits in the variable;
If comprise available route in the routing update message, then check the length of this route, if surpass setting, send failure message and abandon this routing update message to peer-to-peer; Otherwise, each territory of the path attribute of this available route is checked, if wrong, just abandon this routing update message; If correct, the value of just obtaining each territory of routing property deposits in the structure variable;
For unavailable route, this route of deletion from the input routing information base starts distributed BGP route and calculates;
For available route, upgrade the input routing information base, the storing path attribute starts distributed BGP route and calculates;
Step 4-2-4: handling failure message
Main controlled node obtains the value in each territory in this failure message, shows error message, and disconnection is connected with the fault peer-to-peer; Then, the processing of notifying this peer-to-peer UPDATE message comprises route that the fault peer-to-peer is issued and all relevant informations of routing property from knot removal;
(5) binode redundancy backup module
Main controlled node and backup node form the hardware environment of binode backup, but the hardware detection mechanism that does not provide mutual software and hardware to lose efficacy between the node, they realize the two-shipper status monitoring by the heartbeat algorithm; Main controlled node and backup node all move the main controlled node subsystem, and when the main controlled node operate as normal, backup node can only receive the backup messages of main controlled node, and the Backup Data in the backup messages is backuped in the corresponding database; When main controlled node broke down, backup node was taken over the work of main controlled node:
For realizing this failover, the method that has adopted is to carry out the checkpointed state backup, carries out the state rollback then and recovers;
Main controlled node timed sending query messages is given backup node, and backup node is replied message; When main controlled node can not receive the answer message of backup node, just think the backup node fault, at this moment main controlled node will can not send backup messages to backup node; When main controlled node can be received the answer message of backup node, just think the backup node operate as normal, can be to backup node Status of Backups information;
In the main controlled node module, need the state information of backup can be divided into two classes, a class is: the state information relevant with communication comprises main controlled node and from the communication information of node; Another kind ofly be: with use relevant status data, data, this bgp protocol that configuration parameters such as the IP address that comprises other bgp peer that connects with this bgp protocol and autonomous system number ASN, these cluster routers are relevant with the global optimum route and the data of exporting in data that route is correlated with, these cluster routers and being correlated with from node;
For the relevant status data of communication, any once-through operation all may relate to the state variation from node, so the backup of their state must be accomplished the backup of small grain size, main controlled node each time with must accomplish the backup of small grain size from the state backup of carrying out corresponding shapes after node carries out communication, main controlled node each time with after node carries out communication, carry out corresponding state backup; When main controlled node with from the node communication time, main controlled node backups to the communication data read-write operation in the backup node simultaneously, what comprise read-write operation in the read-write operation of backup reads and writes data, data length, and the result that returns of operation;
And for using relevant status data, data volume is big, and the backup granularity is bigger, and main controlled node sends to backup node to these application-dependent data every one time;
When backup node can not be received the query messages of main controlled node, just think that main controlled node breaks down, at this moment backup node will carry out state rollback recovery, take over the work of main controlled node;
Backup node is taken over main controlled node work, at this moment using relevant status data has been kept in the associated databases of backup node, main controlled node subsystem on the backup node directly uses these status datas to start, repeat the communication data read-write operation then, but the communication data read-write operation is not to carry out actual data read-write operation, but returns corresponding data and result from the read-write operation of backup;
B. from the node subsystem, be responsible for routing update message and handle, the local optimum Route Selection also will cooperate main controlled node to carry out global optimum's Route Selection; Should distributed BGP route calculating sub module only be arranged from the node subsystem, according to the following steps to finish from the task of node subsystem:
(1) priority is calculated
When from node to the UPDATE packet parsing after, finding has available route, triggers priority computational process; In priority computational process, locking input routing information base according to pre-set strategy, calculates a priority to new available route or alternative route; After calculating is finished, untie the input routing information base, trigger routing procedure;
(2) Route Selection
In distributed BGP system, Route Selection was divided into for two steps to be finished, and the first step is to select the local optimum route from node, and second step was that main controlled node is selected global optimum's route;
After priority computational process is finished, at first activate from the node Route Selection; From node routing procedure locking input routing information base, from all routes identical, select a highest route of priority with new available route destination, if the route of preserving in the route of selecting and the local optimum routing information base is identical, finish routing procedure; Otherwise, upgrade the local optimum information bank, untie the input routing information base, the distributed message mechanism by system sends to main controlled node to this routing iinformation simultaneously, activates main controlled node overall situation routing procedure;
In store all local optimum routes on the main controlled node from node, when receiving one during from new route that node sends, locking global optimum routing information base, from all routes identical, select a highest route of priority with new available route destination, upgrade global optimum's routing information base, untie global optimum's routing information base, trigger the route distribution process;
(3) route distribution
The route distribution process is routed selection course and activates, the renewal route of global optimum's routing information base is packaged in the UPDATE message, send to each and the bgp peer that this bgp protocol connects, in the output routing information base of each peer-to-peer, write down the route that sends simultaneously.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100121929A CN100452797C (en) | 2005-07-15 | 2005-07-15 | High-available distributed boundary gateway protocol system based on cluster router structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100121929A CN100452797C (en) | 2005-07-15 | 2005-07-15 | High-available distributed boundary gateway protocol system based on cluster router structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1719831A CN1719831A (en) | 2006-01-11 |
| CN100452797C true CN100452797C (en) | 2009-01-14 |
Family
ID=35931554
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100121929A Expired - Fee Related CN100452797C (en) | 2005-07-15 | 2005-07-15 | High-available distributed boundary gateway protocol system based on cluster router structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100452797C (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104036548A (en) * | 2014-07-01 | 2014-09-10 | 浪潮(北京)电子信息产业有限公司 | MHA cluster environment reconstruction method, device and system |
| US9934114B2 (en) | 2013-09-26 | 2018-04-03 | Mistubishi Electric Corporation | Communication system, standby device, communication method, and standby program |
Families Citing this family (49)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9384103B2 (en) | 2006-05-16 | 2016-07-05 | Oracle International Corporation | EJB cluster timer |
| CN103327066B (en) * | 2006-05-16 | 2016-08-17 | 甲骨文国际公司 | Method and system for schedule job in cluster |
| CN101141382A (en) * | 2006-09-07 | 2008-03-12 | 华为技术有限公司 | Routing update method and router |
| WO2008086641A1 (en) * | 2007-01-04 | 2008-07-24 | Zte Corporation | A protection method of the speakers of the interdomain protocol in the optical network |
| CN101014011B (en) * | 2007-01-31 | 2010-06-09 | 华为技术有限公司 | Router switching equipment, IP network, communication system and path switching method |
| CN101309201B (en) * | 2007-05-14 | 2012-05-23 | 华为技术有限公司 | Route processing method, routing processor and router |
| CN101056270B (en) | 2007-05-18 | 2010-10-06 | 华为技术有限公司 | A route convergence method and routing device |
| CN101110776B (en) * | 2007-07-05 | 2011-06-01 | 华为技术有限公司 | Backup method, backup device and backup system for data business |
| CN101127705B (en) * | 2007-09-20 | 2011-09-21 | 中兴通讯股份有限公司 | Method for realizing network transmission service quality |
| CN101179504B (en) * | 2007-11-20 | 2011-05-04 | 华为技术有限公司 | Method, system and network appliance to restrain routing |
| CN101217402B (en) * | 2008-01-15 | 2012-01-04 | 杭州华三通信技术有限公司 | A method to enhance the reliability of the cluster and a high reliability communication node |
| CN101534239B (en) * | 2008-03-13 | 2012-01-25 | 华为技术有限公司 | Method and device for installing routers |
| CN101605089B (en) * | 2008-06-11 | 2012-02-22 | 华为技术有限公司 | BGP dynamic transferring method and device |
| CN101309167B (en) * | 2008-06-27 | 2011-04-20 | 华中科技大学 | Disaster allowable system and method based on cluster backup |
| CN101360056B (en) * | 2008-09-12 | 2011-04-20 | 中兴通讯股份有限公司 | System and method solving backup routing engine upper label competition |
| CN101488966A (en) * | 2009-01-14 | 2009-07-22 | 深圳市同洲电子股份有限公司 | Video service system |
| CN101483548B (en) * | 2009-02-26 | 2011-01-19 | 中国人民解放军信息工程大学 | Method and system for distance vector routing protocol self-recovery |
| CN102064954B (en) * | 2009-11-17 | 2013-09-18 | 腾讯科技（深圳）有限公司 | Distributed fault tolerant system, equipment and method |
| CN102135929B (en) * | 2010-01-21 | 2013-11-06 | 腾讯科技（深圳）有限公司 | Distributed fault-tolerant service system |
| CN102340410B (en) * | 2010-07-21 | 2014-09-10 | 中兴通讯股份有限公司 | Cluster management system and method |
| CN101958805B (en) * | 2010-09-26 | 2014-12-10 | 中兴通讯股份有限公司 | Terminal access and management method and system in cloud computing |
| CN102694825A (en) * | 2011-03-22 | 2012-09-26 | 腾讯科技（深圳）有限公司 | Data processing method and data processing system |
| CN102202425B (en) * | 2011-06-24 | 2013-09-18 | 中国人民解放军国防科学技术大学 | Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module |
| CN102291455B (en) * | 2011-08-10 | 2014-02-19 | 华为技术有限公司 | Distributed cluster processing system and message processing method thereof |
| CN103023673A (en) * | 2011-09-21 | 2013-04-03 | 中兴通讯股份有限公司 | Starting method and apparatus of control units |
| JP5927871B2 (en) * | 2011-11-30 | 2016-06-01 | 富士通株式会社 | Management apparatus, information processing apparatus, management program, management method, program, and processing method |
| CN102523257A (en) * | 2011-11-30 | 2012-06-27 | 广东电子工业研究院有限公司 | Infrastructure as a service (IAAS)-cloud-platform-based virtual machine fault-tolerance method |
| CN102904761B (en) * | 2012-10-24 | 2016-08-17 | 浙江宇视科技有限公司 | The method of a kind of NVR stacking and NVR |
| CN103036717B (en) * | 2012-12-12 | 2015-11-04 | 北京邮电大学 | The consistency maintenance system and method for distributed data |
| CN103166796B (en) * | 2013-03-13 | 2014-12-10 | 武汉邮电科学研究院 | Method for realizing consistency of service signal transceiving paths during service recovery of power communication network |
| CN103269286B (en) * | 2013-06-04 | 2016-01-13 | 上海数讯信息技术有限公司 | Based on the visual Route monitoring management system of Border Gateway Protocol |
| CN103888310B (en) * | 2013-09-04 | 2017-11-24 | 中寰卫星导航通信有限公司 | Monitor processing method and system |
| CN103491011B (en) * | 2013-09-05 | 2017-02-08 | 杭州华三通信技术有限公司 | BGP conversation changing method and device |
| CN103491192B (en) * | 2013-09-30 | 2016-08-17 | 北京搜狐新媒体信息技术有限公司 | The Namenode changing method of a kind of distributed system and system |
| US9626261B2 (en) * | 2013-11-27 | 2017-04-18 | Futurewei Technologies, Inc. | Failure recovery resolution in transplanting high performance data intensive algorithms from cluster to cloud |
| US10135704B2 (en) | 2014-06-20 | 2018-11-20 | Microsoft Technology Licensing, Llc | Identification of candidate problem network entities |
| CN104821892B (en) * | 2015-04-09 | 2018-06-19 | 清华大学 | Across the plane behavior verification collaboration method of route switching system and device |
| CN106302198A (en) * | 2015-05-25 | 2017-01-04 | 中兴通讯股份有限公司 | The collocation method of cluster routers cpu resource and cluster routers |
| CN105095008B (en) * | 2015-08-25 | 2018-04-17 | 国电南瑞科技股份有限公司 | A kind of distributed task scheduling fault redundance method suitable for group system |
| CN107332936A (en) * | 2017-08-25 | 2017-11-07 | 长沙曙通信息科技有限公司 | A kind of distributed storage distribution and installation network system realization |
| CN109787795B (en) * | 2017-11-13 | 2020-12-25 | 比亚迪股份有限公司 | Method for processing fault of train network master node, node and electronic equipment |
| CN108197465B (en) * | 2017-11-28 | 2020-12-08 | 中国科学院声学研究所 | Website detection method and device |
| CN108228393A (en) * | 2017-12-14 | 2018-06-29 | 浙江航天恒嘉数据科技有限公司 | A kind of implementation method of expansible big data High Availabitity |
| CN108763312B (en) * | 2018-04-26 | 2021-07-06 | 大连理工大学 | Slave data node screening method based on load |
| CN111695018B (en) * | 2019-03-13 | 2023-05-30 | 阿里云计算有限公司 | Data processing method and device, distributed network system and computer equipment |
| CN111737236B (en) * | 2020-08-26 | 2020-12-08 | 江苏云柜网络技术有限公司 | Data management method and system for intelligent express cabinet service |
| CN113112139A (en) * | 2021-04-07 | 2021-07-13 | 上海联蔚盘云科技有限公司 | Cloud platform bill processing method and equipment |
| CN113312216A (en) * | 2021-05-31 | 2021-08-27 | 中电福富信息科技有限公司 | Extensible distributed hot plug deployment web crawler service model and control method thereof |
| CN116760764B (en) * | 2023-08-18 | 2023-11-17 | 深圳捷誊技术有限公司 | Route announcement method, server node, information bulletin board and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1431808A (en) * | 2003-01-27 | 2003-07-23 | 西安电子科技大学 | Large capacity and expandable packet switching network structure |
| WO2005002136A1 (en) * | 2003-06-06 | 2005-01-06 | Microsoft Corporation | Method and system for global routing and bandwidth sharing |
| CN1610332A (en) * | 2004-07-09 | 2005-04-27 | 清华大学 | Non-state end-to-end constraint entrance permit control method for kernel network |
-
2005
- 2005-07-15 CN CNB2005100121929A patent/CN100452797C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1431808A (en) * | 2003-01-27 | 2003-07-23 | 西安电子科技大学 | Large capacity and expandable packet switching network structure |
| WO2005002136A1 (en) * | 2003-06-06 | 2005-01-06 | Microsoft Corporation | Method and system for global routing and bandwidth sharing |
| CN1610332A (en) * | 2004-07-09 | 2005-04-27 | 清华大学 | Non-state end-to-end constraint entrance permit control method for kernel network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9934114B2 (en) | 2013-09-26 | 2018-04-03 | Mistubishi Electric Corporation | Communication system, standby device, communication method, and standby program |
| CN104036548A (en) * | 2014-07-01 | 2014-09-10 | 浪潮(北京)电子信息产业有限公司 | MHA cluster environment reconstruction method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1719831A (en) | 2006-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100452797C (en) | High-available distributed boundary gateway protocol system based on cluster router structure | |
| Zhang et al. | A survey on software defined networking with multiple controllers | |
| JP5361794B2 (en) | Method and apparatus for maintaining a port state table in the forwarding plane of a network element | |
| US6910148B1 (en) | Router and routing protocol redundancy | |
| KR101099822B1 (en) | Redundant routing capabilities for a network node cluster | |
| JP6382454B2 (en) | Distributed storage and replication system and method | |
| EP1982447B1 (en) | System and method for detecting and recovering from virtual switch link failures | |
| US9130858B2 (en) | System and method for supporting discovery and routing degraded fat-trees in a middleware machine environment | |
| US9473360B2 (en) | System and method for primary switch election in peer groups | |
| CN101588304B (en) | Implementation method of VRRP and device | |
| CN101888331B (en) | Method and apparatus for providing fast reroute of a unicast packet | |
| Xie et al. | An incrementally scalable and cost-efficient interconnection structure for data centers | |
| WO2017193966A1 (en) | Link switching method for service in storage system, and storage device | |
| CN104025513A (en) | Hierarchy of control in a data center network | |
| JP2014131130A (en) | Communication system, route switchover method and communication device | |
| Guay et al. | Host side dynamic reconfiguration with infiniband | |
| Duan et al. | OFBGP: a scalable, highly available BGP architecture for SDN | |
| Xu et al. | HASP: high availability SFC placement approach in data center network | |
| CN117354267A (en) | Link failure processing method, device, equipment, storage medium and program product | |
| US20230224243A1 (en) | Highly-Available Cluster Leader Election in a Distributed Routing System | |
| WO2022044546A1 (en) | Communication system and method for recovering faults therein | |
| Sk et al. | Controller Placement in SDN: An Evaluation of Link Failure-Tolerant Approaches | |
| WO2014141459A1 (en) | Information processing system, and method for managing operation of information processing system | |
| CN117411840A (en) | Link failure processing method, device, equipment, storage medium and program product | |
| CN117499206A (en) | Communication exception handling method and computing device |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090114 Termination date: 20110715 |