CN100411383C - Method for realizing message retransmission under routing device - Google Patents

Method for realizing message retransmission under routing device Download PDF

Info

Publication number
CN100411383C
CN100411383C CNB031554032A CN03155403A CN100411383C CN 100411383 C CN100411383 C CN 100411383C CN B031554032 A CNB031554032 A CN B031554032A CN 03155403 A CN03155403 A CN 03155403A CN 100411383 C CN100411383 C CN 100411383C
Authority
CN
China
Prior art keywords
message
route
routing
routing device
transmitted
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
Application number
CNB031554032A
Other languages
Chinese (zh)
Other versions
CN1585377A (en
Inventor
贾海波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 filed Critical Huawei Technologies Co Ltd
Priority to CNB031554032A priority Critical patent/CN100411383C/en
Publication of CN1585377A publication Critical patent/CN1585377A/en
Application granted granted Critical
Publication of CN100411383C publication Critical patent/CN100411383C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Abstract

The present invention provides a method for realizing message retransmission in route devices, which comprises: messages needing responding are respectively transmitted to the next hops of all routes in a route table of route devices for determining routes receiving response messages; when the route devices need to retransmit the messages, the messages are retransmitted according to the corresponding routes receiving the response messages in the route table. The route table is optimized according to the effectiveness of network devices of the next hops in networks by the present invention for ensuring that the routes retransmitted by the messages are reliable and effective. Consequently, the present invention realizes the purpose of enhancing network security and reliability.

Description

A kind of method that in routing device, realizes the message forwarding
Technical field
The present invention relates to the network communications technology field, be specifically related to a kind of method that message is transmitted that in routing device, realizes.
Background technology
At present, be to determine the message forwarding route that it receives in routing device, and its message that receives carried out message according to this forwarding route transmit according to routing table.
Routing table in the routing device is as shown in table 1:
Table 1
Numbering Destination address Mask Next jumping Outgoing interface
A 10.1.1.0 255.255.255.0 20.1.1.1 Ethernet1/0/0
B 10.1.0.0 255.255.0.0 30.1.1.1 Ethernet1/0/1
C 10.1.2.0 255.255.255.0 20.1.1.1 Ethernet1/0/0
D 10.1.2.0 255.255.255.0 30.1.1.1 Ethernet1/0/1
The method that routing device is transmitted message according to routing table in the prior art is: routing device adopts the algorithm of longest prefix match in routing table according to the destination address of the message that receives, carry out longest prefix match, if match corresponding record, then set up forward-path for it, message is transmitted according to next skip list item, outgoing interface list item corresponding in the record; If can not match corresponding record, then take methods such as packet loss, do not set up forward-path for it.
The algorithm of employing longest prefix match can hit the route of destination address network segment scope minimum in the routing table in routing table.In at table 1: be numbered the route of A, we are referred to as route A, and the route of other numberings is referred to as route B, route C, route D.The destination address network segment scope of route B correspondence comprises the destination address network segment scope of route A correspondence.Transmit if routing device need be the message of 10.1.1.1 with destination address, the algorithm that then adopts longest prefix match when the destination address with routing table mates, with the route of its coupling be route A, rather than route B.
Because the kind of Routing Protocol is a lot, as: RIP (routing information protocol), BGP (border Routing Protocol), OSPF (open type shortest path priority protocol), IS-IS (intermediate system to intermediate syst) etc.Routing device can be supported multiple Routing Protocol simultaneously, when arriving routing device based on the message of different routing protocol, may obtain the identical route of destination address network segment scope, and routing management selects the high route of priority that message is transmitted; When reaching routing device based on message with a kind of Routing Protocol, also may obtain the identical route of destination address network segment scope is equal-cost route, as: in table 1, route C is identical because of its corresponding destination address network segment scope with route D, so route C and route D are equal-cost route.Generally this equal-cost route is selected different routes for use for different data streams, can carry out load sharing to the data traffic in the network like this, only can select wherein a route to carry out message to transmit for identical data flow is general.
Prior art can realize the general requirement that message is transmitted, as: dynamic routing protocol all has corresponding aging function, if cause next jumping of message forwarding no longer direct-connected owing to link failure occurring in the network, Routing Protocol just can not receive corresponding connection back message using, as: hello packet or update etc., the route of being learned can be passed through the aging mechanism automatic aging of agreement, thereby this route is deleted in transmitting, and can not influence the normal forwarding of message.But in some cases, some problems appear easily under the situation of static configuration route particularly.
The route of static configuration, owing to itself do not have aging mechanism, the route that can therefore cause being hit can not be carried out actual message forwarding.
Accompanying drawing 1 is a kind of simple and common network construction form.
In Fig. 1, generally can dispose two static routing, in routing device 1, the route of setting up for the message of a part of network terminal transmission is route A, and promptly message is the network equipment 2 arrival destination address 10.1.1.1 of 20.1.1.1 through Ethernet1/0/0 port and address; The route of setting up for the message of all the other network terminals transmissions is route B, and promptly message is the network equipment 3 arrival destination address 10.1.2.1 of 30.1.1.1 through Ethernet1/0/1 port and address.
The network equipment 2 among the setting route A hinders for some reason and paralyses, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, but the port Ethernet 1/0/1 in the routing device 1 still is a connection status, and the result who shows on routing device 1 is then normal for all so.But when actual message is transmitted, if need being the message of 10.1.1.1 with destination address, transmits routing device 1, the algorithm that then adopts longest prefix match is when the destination address with table 1 mates, the route that matches is route A, promptly need message is sent to the network equipment 2 through port Ethernet 1/0/0, because the network equipment 2 paralysis, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, thereby cause the all-network terminal use all can't visit 10.1.1.1; In fact, in fact message can carry out the message forwarding from route B.But the algorithm that adopts longest prefix match is when the destination address with table 1 mates, because route B unmatch, so message can not be transmitted from route B.
In general networking, require load sharing and dispose equal-cost route C, under the D situation, if need being the message of 10.1.2.1 with destination address, transmits routing device 1, the algorithm that then adopts longest prefix match is when the destination address with table 1 mates, the route that setting matches is route C, promptly needing message is the network equipment transmission of 20.1.1.1 through port Ethernet 1/0/0 and address, because the network equipment 2 paralysis, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, occur and above-mentioned similar situation, message is transmitted obstructed.Because the message of general router is transmitted in the method that realizes and stipulated, what same data stream was hit is same route, and therefore, some network terminal user may just can't visit 10.1.2.1.
In addition, dynamic routing protocol may be subjected to malicious attack, and causes normal data normally not transmit.RIP (routing information protocol) for example, network terminal user may malice construct next and jump the message that does not have Routing Protocol, after the hitting of routing table coupling, can cause normal data normally not transmit, thereby influence network terminal user's business so.
Summary of the invention
The objective of the invention is to, a kind of method that message is transmitted that realizes in routing device is provided, utilize the routing table of optimizing that the message that needs in the route equipment to transmit is carried out message and transmit control, to realize improving the purpose of internet security and reliability.
For achieving the above object, a kind of method of message forwarding that realizes in routing device provided by the invention comprises:
A, next of all routes jumps to send respectively in the routing table of routing device needs the message responded, and determines to receive the route of back message using;
B, when routing device need E-Packet, carry out message according to the route of receiving back message using in its routing table accordingly and transmit.
Described route comprises: the route that dynamic routing protocol is set up, the route of static configuration.
Described dynamic routing protocol comprises routing information protocol, border Routing Protocol, open type shortest path priority protocol, intermediate system to intermediate syst.
The described message that needs to respond comprises the arp request message.
Described step a comprises:
A1, next jumps structure arp request message and with its transmission for all have nothing in common with each other in the routing table of routing device;
A2, judge whether routing device receives the back message using of next jumping that has nothing in common with each other in the given time;
Next jumping corresponding route in routing table of route equipment being received back message using is provided with significant notation, and the relevant information of back message using received in record;
Next jumping corresponding route in routing table of route equipment not being received back message using is provided with invalid flag.
Described step a1 comprises:
For Hash table is set up in all next jumpings in the routing device routing table;
According to the Hash operation of each next jumping, next is jumped identical route be placed in the chained list;
To next the jumping structure arp request message in each chained list and with its transmission.
When the described relevant information of receiving back message using during with the form record of table, described step a also comprises:
When in routing table, adding new route,, will described new route be added in the Hash table in the corresponding chained list next jumping that simultaneously will described new route and receive that the list item in the back message using table mates according to the Hash operation of described new route next jump;
To with the described new route of receiving back message using table coupling significant notation being set in the routing table;
To in the routing table with receive that the unmatched described new route of back message using table is provided with invalid flag.
Described step a also comprises:
When the described record deletion of receiving in the back message using table, route corresponding in the described routing table is provided with invalid flag.
Describedly receive that the record in the back message using table can delete according to predetermined aging mechanism;
Described predetermined aging mechanism comprises:
Pre-determined number is set;
According to predetermined space traversal HASH table, send to next jumping structure arp request message of each chained list and with it, the metering value of each chained list increases progressively simultaneously;
Whether the metering value of judging each chained list respectively reaches pre-determined number;
If do not reach described pre-determined number,
Judge whether routing device receives back message using in the given time;
If receive back message using, with the metering value zero clearing of pre-determined number;
If do not receive back message using, return describedly according to predetermined space traversal Hash table, next of each chained list jumped structure arp request message and it is sent, simultaneously the metering value incremental steps of each chained list;
If reach described pre-determined number, with the respective record deletion of receiving in the back message using table.
Described step b comprises:
When message that routing device need be transmitted, carry out message according to the route of corresponding significant notation in its routing table and transmit.
Utilize the present invention, the next-hop network equipment that can receive back message using is defined as the effective network equipment, route in the routing table of effective next-hop network equipment correspondence is provided with significant notation, make routing table obtain optimization, when routing device carries out the message forwarding, the route that each bar is matched all is effective, reliable route, thereby avoided making certain route invalid because of network equipment failure or link failure or network terminal user malicious attack, cause the phenomenon that network terminal user can not the normal transmission message, guaranteed that routing device is reliable, safe is forwarded to destination address with message; Realized improving the purpose of internet security, reliability.
Description of drawings
Fig. 1 is the communication network schematic diagram.
Embodiment
Core concept of the present invention is: next jumping by all routes in the routing table of routing device sends the message that needs response respectively, judge whether next jumping in the routing table is effective, if receive back message using, think that then next jumping of this route is effective, this route is effective; Otherwise, think that next jumping of this route is invalid, this route is invalid; When routing device need E-Packet, carry out message according to the route of receiving back message using in its routing table accordingly and transmit.
Core concept of the present invention can realize by following method: whether the next-hop network equipment of determining all routes in the routing table of routing device is effective, can carry out normal message forwarding because have only next to jump the effective network equipment, whether effectively optimize routing table in the routing device by the next-hop network equipment of all routes in the routing table that detects routing device, carry out message forwarding control according to the routing table of optimizing then.
Next-hop network equipment in the present embodiment effectively comprises next-hop network equipment fault-free, and two-layer equipment between routing device and this next-hop network equipment or link fault-free etc., promptly routing device and this next-hop network equipment can carry out normal transfer of data.
The present invention checks next-hop network equipment, and whether effective method is: ask the next-hop network device acknowledge by periodically sending the message that needs to respond to next jumping network equipment, if next-hop network device acknowledge, prove that then this network equipment is effective, thereby this route is effective, can carry out message according to this route and transmit.
In Ethernet, we can be that example illustrates method of the present invention with the Ethernet by sending the optimization that the device acknowledge of ARP (address resolution protocol) request message request next-hop network realizes routing table below.
Because The present invention be directed to the next-hop network equipment of all routes in the routing table of routing device detects, so, can at first build a Hash (Hash) table to the next-hop network equipment of routing table, the Hash computing is carried out in IP address according to the next-hop network equipment of all routes in the routing table, and the route that the IP address of next-hop network equipment is identical is put in the chained list.
To the structure of the next-hop network equipment in each chained list ARP request message and transmission.Build one and receive ARP back message using table.This table is preserved the relevant information of the route of receiving the ARP back message using.This table can comprise: the MAC Address field of the IP address field of next-hop network equipment, next-hop network equipment, this routing device are with the outgoing interface field of message transmissions to next-hop network equipment.To all are received that the route of ARP back message using is added into and receive in the ARP back message using table in the given time; While is according to the significant notation of corresponding route in the recording setting routing device routing table of receiving in the ARP back message using table, be about in the routing table with receive ARP back message using table in the corresponding route of record significant notation is set, in the routing table with receive ARP back message using table in record do not have corresponding route invalid flag be set.
When routing device need send message, adopt the algorithm of longest prefix match, the destination address of message is mated in routing table, and the route of invalid flag does not participate in matched routings, thereby can guarantee that the route one that matches is forwarded to message next-hop network equipment surely reliably, safely.
After dynamic routing protocol is learnt new dynamic routing or is disposed new static routing, when joining above-mentioned new route in the routing table, at first need new route is mated with receiving ARP back message using table, if list item in should showing and new matched routings, then should significant notation be set new route, be added in the routing table; If the list item in this table does not match with new route, then new route is provided with invalid flag, be added in the routing table.After new route is added into routing table, also need this new route is carried out corresponding HASH computing according to the IP address of its next-hop network equipment, relatively whether the next-hop ip address in each chained list of the next-hop ip address of this new route and HASH table is identical, if identical, then new route is added in this chained list with the next-hop ip address in certain chained list; And if next-hop ip address in each chained list is all inequality, then sets up new chained list and new route is added in the new chained list for new route.
The present invention has also set the aging mechanism of receiving ARP back message using table.
The aging mechanism of receiving ARP back message using table is: predetermined space is set, every predetermined interval, travels through next and jump the Hash table, the timing of predetermined space can realize by timer.Be set to 2 minutes as timer,, travel through next and jump the Hash table, jump the next-hop network equipment in each chained list in the Hash table at next, structure ARP request message then every 2 minutes.
Pre-determined number is set, can realizes by counter the counting of pre-determined number, the counter of each chained list is set respectively, for the next-hop network equipment of each chained list structure ARP message and when sending respectively, the counter of each chained list adds one respectively; If routing device is received the ARP back message using of next-hop network equipment in the given time, prove that then this routing device and this next-hop network equipment are unobstructed on the link that message is transmitted, and this next-hop network equipment can normally be received and dispatched message, so determine that this next-hop network equipment operation is normal, effective, thereby the route in this routing device routing table of definite this chained list correspondence is effective, route in the routing device routing table of this chained list correspondence is provided with significant notation, the counter O reset of this chained list.If do not receive the ARP back message using of next-hop network equipment in the given time, prove that then next-hop network equipment is on the link that message is transmitted or have problem on the next-hop network equipment operation, the not zero clearing of counter of this chained list.
For guaranteeing reliability to the testing result of next-hop network equipment, the numerical value of pre-determined number can be set according to actual needs, as: pre-determined number is set to 3 times, so, after waiting for that predetermined space is full, travel through the HASH table once more, the step that repeats above-mentioned structure ARP request message and send; If the counter of certain chained list reaches 3 times, do not receive the ARP back message using in the given time yet, confirm that then link or next-hop network equipment between this routing device and the next-hop network equipment have fault, or next-hop network equipment reason such as do not exist, and makes next-hop network equipment can not carry out normal message and transmits.Need will receive in the ARP back message using table corresponding record deletion according to the route in this chained list, all and the device-dependent route of this next-hop network all will be provided with invalid flag in the routing table of the record correspondence of this deletion.
The above-mentioned scheduled time, predetermined space, pre-determined number all can rationally be provided with above-mentioned each data according to the practical application flexible configuration, can effectively control message and transmit under the prerequisite of conserve network resources.Guarantee routing device reliable, safe message is forwarded to destination address.
The concrete application that utilizes the present invention to carry out message forwarding control still describes according to Fig. 1.
In Fig. 1, the routing table in the routing device 1 is as shown in table 1, sets up HASH table according to table 1, carry out the HASH computing after, route A and route C put into a chained list, route B and route D put into a chained list.The record that route A, route B, route C, route D correspondence are arranged in the ARP back message using table is received in setting, and setting pre-determined number is 3, and predetermined time interval is 120 seconds, and the scheduled time is 10 seconds.Traversal HASH table is the network equipment 2 and the network equipment 3 structure ARP messages, and for each chained list is provided with counter, each counter begins counting.
The ARP message of constructing for the network equipment 2 is sent to the network equipment 2 through the Ethernet1/0/0 port, because the network equipment 2 paralysis, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, thereby cause the network equipment 2 not receive the ARP message, maybe can not respond the ARP message; Routing device 1 did not receive the ARP back message using of the network equipment 2 in 10 seconds, the value of the counter of this chained list is 1, not zero clearing.
The ARP message of constructing for the network equipment 3 is sent to the network equipment 3 through the Ethernet1/0/1 port, because the network equipment is normal and two-layer equipment or links 3 centres from routing device 1 to the network equipment are normal, the network equipment 3 is responded the ARP message after receiving the ARP message; Routing device 1 received the ARP back message using of the network equipment 2, the counter O reset of this chained list in 10 seconds.Route B in the routing table of this chained list correspondence and route D are provided with significant notation.
After 120 seconds, travel through the HASH table once more, identical with said process to the process of the network equipment 2 and the network equipment 3 transmission ARP messages etc., if routing device 1 did not still receive the ARP back message using of the network equipment 2 in 10 seconds, the value of the counter of this chained list is 2.When the value of the counter of this chained list is 3, still do not receive the ARP back message using of the network equipment 2, the record of route A and route C correspondence in the deletion ARP table, and route A in the routing table of this chained list correspondence and route C be provided with invalid flag.
When routing device 1 need carry out the message forwarding, if need being the message of 10.1.1.1 with destination address, transmits routing device 1, the algorithm that then adopts longest prefix match is when the destination address with table 1 mates, because route A is the route of invalid flag, so the route that matches is route B, routing device 1 is transmitted message from route B.Thereby can not cause because of network by equipment 2 paralysis, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, the situation that the all-network terminal use can't visit 10.1.1.1 appears.
In general networking, require load sharing and dispose under equal-cost route C, the D situation, if need being the message of 10.1.2.1 with destination address, transmits routing device 1, the algorithm that then adopts longest prefix match is when the destination address with table 1 mates, because route C is the route of invalid flag, so the route that matches is route D, routing device 1 is transmitted message from route B.Thereby can not cause because of network by equipment 2 paralysis, or from routing device 1 to the network equipment two-layer equipment or the links in the middle of 2 break down, the situation that some network terminal user can't visit 10.1.2.1 appears.
If dynamic routing protocol is subjected to malicious attack, RIP (routing information protocol) for example, network terminal user malice is constructed next and is jumped the message that does not have Routing Protocol, owing to receive and do not have corresponding record in the ARP back message using table, so this route is the route of invalid flag in the routing table, and behind the traversal HASH table, send the ARP message to this next-hop network equipment, all can not receive corresponding back message using at the fixed time with in the pre-determined number, this route still is the route of invalid flag in the routing table so, thereby can not influence the normal forwarding of network terminal user normal data.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, wishes that appended claim comprises these distortion and variation.

Claims (10)

1. in routing device, realize the method that message is transmitted for one kind, it is characterized in that comprising:
A, next of all routes jumps to send respectively in the routing table of routing device needs the message responded, and determines to receive the route of back message using;
B, when routing device need E-Packet, carry out message according to the route of receiving back message using in its routing table accordingly and transmit.
2. a kind of method that message is transmitted that realizes in routing device as claimed in claim 1 is characterized in that described route comprises: the route that dynamic routing protocol is set up, the route of static configuration.
3. a kind of method that message is transmitted that realizes in routing device as claimed in claim 2 is characterized in that described dynamic routing protocol comprises routing information protocol, border Routing Protocol, open type shortest path priority protocol, intermediate system to intermediate syst.
4. as claim 1 or 2 or 3 described a kind of methods that message is transmitted that in routing device, realize, it is characterized in that the message that described needs are responded comprises the arp request message.
5. a kind of method that message is transmitted that realizes in routing device as claimed in claim 4 is characterized in that described step a comprises:
A1, next jumps structure arp request message and with its transmission for all have nothing in common with each other in the routing table of routing device;
A2, judge whether routing device receives the back message using of next jumping that has nothing in common with each other in the given time;
Next jumping corresponding route in routing table of route equipment being received back message using is provided with significant notation, and the relevant information of back message using received in record;
Next jumping corresponding route in routing table of route equipment not being received back message using is provided with invalid flag.
6. a kind of method that message is transmitted that realizes in routing device as claimed in claim 5 is characterized in that described step a1 comprises:
For Hash table is set up in all next jumpings in the routing device routing table;
According to the Hash operation of each next jumping, next is jumped identical route be placed in the chained list;
To next the jumping structure arp request message in each chained list and with its transmission.
7. a kind of method that realizes that in routing device message is transmitted as claimed in claim 5 is characterized in that described step a also comprises when the described relevant information of receiving back message using during with the form record of table:
When in routing table, adding new route,, will described new route be added in the Hash table in the corresponding chained list next jumping that simultaneously will described new route and receive that the list item in the back message using table mates according to the Hash operation of described new route next jump;
To with the described new route of receiving back message using table coupling significant notation being set in the routing table;
To in the routing table with receive that the unmatched described new route of back message using table is provided with invalid flag.
8. a kind of method that message is transmitted that realizes in routing device as claimed in claim 7 is characterized in that described step a also comprises:
When the described record deletion of receiving in the back message using table, route corresponding in the described routing table is provided with invalid flag.
9. a kind of method that realizes that in routing device message is transmitted as claimed in claim 8 is characterized in that describedly receiving that the record in the back message using table can delete according to predetermined aging mechanism;
Described predetermined aging mechanism comprises:
Pre-determined number is set;
According to predetermined space traversal HASH table, send to next jumping structure arp request message of each chained list and with it, the metering value of each chained list increases progressively simultaneously;
Whether the metering value of judging each chained list respectively reaches pre-determined number;
If do not reach described pre-determined number,
Judge whether routing device receives back message using in the given time;
If receive back message using, with the metering value zero clearing of pre-determined number;
If do not receive back message using, return describedly according to predetermined space traversal Hash table, next of each chained list jumped structure arp request message and it is sent, simultaneously the metering value incremental steps of each chained list;
If reach described pre-determined number, with the respective record deletion of receiving in the back message using table.
10. a kind of method that message is transmitted that realizes in routing device as claimed in claim 5 is characterized in that described step b comprises:
When message that routing device need be transmitted, carry out message according to the route of corresponding significant notation in its routing table and transmit.
CNB031554032A 2003-08-22 2003-08-22 Method for realizing message retransmission under routing device Expired - Fee Related CN100411383C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB031554032A CN100411383C (en) 2003-08-22 2003-08-22 Method for realizing message retransmission under routing device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB031554032A CN100411383C (en) 2003-08-22 2003-08-22 Method for realizing message retransmission under routing device

Publications (2)

Publication Number Publication Date
CN1585377A CN1585377A (en) 2005-02-23
CN100411383C true CN100411383C (en) 2008-08-13

Family

ID=34598126

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB031554032A Expired - Fee Related CN100411383C (en) 2003-08-22 2003-08-22 Method for realizing message retransmission under routing device

Country Status (1)

Country Link
CN (1) CN100411383C (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104521189B (en) * 2013-08-09 2017-10-17 华为技术有限公司 The network terminal obtains method, equipment, the system of business
CN104426775B (en) * 2013-08-19 2019-06-14 中兴通讯股份有限公司 A kind of implementation method and device of routing update
CN104219157B (en) * 2014-08-05 2018-08-03 新华三技术有限公司 A kind of determination method and apparatus of statistics time interval
CN108289044B (en) * 2017-01-10 2021-10-15 阿里巴巴集团控股有限公司 Data forwarding method, link state method for determining static route and network equipment
CN109787869B (en) * 2019-03-29 2020-11-06 新华三技术有限公司 Path fault detection method and device
CN115580575A (en) * 2022-12-06 2023-01-06 北京中科网威信息技术有限公司 Routing path switching method, device, equipment, medium and router

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1392710A (en) * 2001-06-18 2003-01-22 华为技术有限公司 Ip address mapping and transmitting method for non-broadcast multipath access network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1392710A (en) * 2001-06-18 2003-01-22 华为技术有限公司 Ip address mapping and transmitting method for non-broadcast multipath access network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
核心路由器转发处理软件子系统设计与实现. 李云海.中国人民解放军信息工程大学研究生学位论文. 2001
核心路由器转发处理软件子系统设计与实现. 李云海.中国人民解放军信息工程大学研究生学位论文. 2001 *

Also Published As

Publication number Publication date
CN1585377A (en) 2005-02-23

Similar Documents

Publication Publication Date Title
US6847638B1 (en) Multicast system for forwarding desired multicast packets in a computer network
JP3963728B2 (en) Spanning tree bypass method and apparatus
US5500860A (en) Router using multiple hop redirect messages to enable bridge like data forwarding
CN100456754C (en) System, method and program product to route message packets
JP3123467B2 (en) bridge
CN102035676B (en) ARP (Address Resolution Protocol) interaction based method and equipment for detecting and recovering link fault
EP2533475B1 (en) Method and system for host route reachability in packet transport network access ring
JP2005130228A (en) Communication device for path control between as and path control method therefor
CN103428060A (en) Seamless redundancy realization method of loop network
US6928483B1 (en) Fast path forwarding of link state advertisements
CN103004144A (en) Media access control bridging in a mesh network
US6868086B1 (en) Data packet routing
KR20070103435A (en) Method for determining the routing direction of ethernet frames
CN101005644A (en) Method and a system for transmitting control data traffic between a base station of a 3G mobile communication network and a network management station
CN100411383C (en) Method for realizing message retransmission under routing device
CN102769567B (en) A kind of retransmission method of multilink transparent internet Frame and device
JP5433630B2 (en) Network relay device and network relay method
JP3824906B2 (en) INTERNET CONNECTION METHOD, ITS DEVICE, AND INTERNET CONNECTION SYSTEM USING THE DEVICE
Eastlake 3rd et al. Routing bridges (rbridges): Adjacency
JP3596609B2 (en) Packet relay method
TWI288546B (en) Procedure for loop control in level 2 of OSI (ISO) for telecommunication networks
EA008852B1 (en) Method of switching packets in a transmission medium comprising multiple stations which are connected using different links
Cisco Novell IPX Commands
Cisco Novell IPX Commands
Cisco Novell IPX Commands

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080813

Termination date: 20160822

CF01 Termination of patent right due to non-payment of annual fee