CN100420242C - Routing device chain circuit state data synchronizing method - Google Patents
Routing device chain circuit state data synchronizing method Download PDFInfo
- Publication number
- CN100420242C CN100420242C CNB2006101083079A CN200610108307A CN100420242C CN 100420242 C CN100420242 C CN 100420242C CN B2006101083079 A CNB2006101083079 A CN B2006101083079A CN 200610108307 A CN200610108307 A CN 200610108307A CN 100420242 C CN100420242 C CN 100420242C
- Authority
- CN
- China
- Prior art keywords
- router
- lsa
- receiving
- ack message
- send
- 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
Abstract
A method for synchronizing state data of router link includes adding LSA in its own LSDB when new LSA is generated by send router, judging whether receiving router is busy or not by send router and adding said LSA in retransmission list corresponding to receiving router in send router for carrying out fixed time retransmission if it is or otherwise sending said LSA immediately to receiving router, adding LSA in LSDB of receiving router when said LSA is received by receiving router.
Description
Technical field
The present invention relates to network communications technology field, particularly relate to a kind of method of routing device chain circuit state data sync.
Background technology
Routing iinformation is normally distributed, is collected by Border Gateway Protocol/Interior Gateway Protocol (BGP/IGP) in the network.SPF (OSPF) agreement belongs to IGP, be the inner dynamic routing protocol of a autonomous system (AS) of the Internet engineering duty group (IETF) organization development, be used on Internet protocol (IP) network, dynamically sending and propagate route by the Link State of collecting and transmit autonomous system based on Link State.
Ospf protocol is collected topology information and routing iinformation with proliferation network by multiple Link State Packet (LSA).OSPF autonomous system is divided into one or more zone, uses routing device chain circuit state message (Route-LLSA) or network link status message (Network-LSA) to carry route in the zone; Interregional use is summed up Link State Packet (Summary-LSA) and is carried route.And Autonomy System-External uses Autonomy System-External Link State Packet (AS-external-LSA) to carry route, for inferior minor details zone (NSSA), then uses time minor details zone Link State Packets (NSSA-LSA) to carry route.
All LSA have formed the LSD (LSDB) of OSPF.In the zone of OSPF, all routers all must have on all four LSDB can the correct calculation route, instruct and transmit, otherwise path black hole or route loop can occur.The process of LSDB from inconsistent to unanimity on two routers is called routing device chain circuit state data synchronization process.Ospf protocol has defined the strict and complicated mechanism of a cover at this synchronizing process, is called flood (Flooding), and Flooding mechanism has guaranteed that the Link State data of regional interior all-router can reach synchronous state.
When router is new when producing a LSA or receiving a new LSA, need immediately this LSA to be sent to other neighbor router, this LSA is joined in the retransmission list corresponding in this router simultaneously with this neighbor router, regularly retransmit, till the response of receiving neighbor router (ACK) message.Router upgrades (LSU) message by Link State LSA is sent to neighbor router, and a link state update packet can load a plurality of LSA.Defined the Flooding process in the prior art, as described below:
(1) router is new when producing a LSA or receiving a new LSA on an interface, immediately this LSA is sent on other interface.
When (2) router sends to a neighbor router with new LSA, simultaneously this LSA is joined in the retransmission list corresponding with this neighbor router in this router, regularly retransmit.
(3), send the ACK message to the router that sends this LSA if router receives new LSA.The ACK message can send immediately, also can delayed delivery.When receive be the LSA of repetition the time, send the ACK message immediately, otherwise delayed delivery ACK message.
(4) LSA in the router timed sending retransmission list.Only retransmit a link state update packet, link state update packet length is the length of a MTU (MTU) at every turn.Behind the ACK message that receives neighbor router, can send next link state update packet immediately, and need not wait for the overtime of retransmission timer.
When the scale of LSDB is smaller, the Flooding mechanism of OSPF can guarantee to finish fast and effectively each router LSDB synchronously.In fact, because the quantity of Summary-LSA, AS-external-LSA and NSSA-LSA is very big, thereby the scale of LSDB is also very big (for example above 100,000 LSA, even up to a million LSA of possibility), this moment, the Flooding mechanism of OSPF can produce great impact to receiving router, and the synchronizing speed of LSDB also can be slack-off.
With 100,000 LSA is example, and the ospf protocol of router RTA has been introduced 100,000 BGP routes, and this BGP route is produced by RTA oneself or receives from other router.Suppose that RTA finished the introducing of BGP route in 10 seconds, generated 100,000 AS-external-LSA, these LSA are sent to neighbor router RTB at once.RTB will receive and handle this 100,000 LSA within these 10 seconds or tens seconds, all be great challenge to hardware and software systems, and the hardware of RTB and software systems must be in the height busy state this moment.Generally, RTB can't in time handle these LSA, and many LSA can be dropped, and overflows such as being abandoned or receive buffering area by OSPF software.And RTB also depends on its software realization of system for the processing of HELLO message, if the HELLO message is not by priority treatment or processing in time, may cause the vibration of its neighbor router so, that is to say that above-mentioned Synchronous Processing may make RTB because of can't in time handling the vibration that the HELLO message causes the neighbor router of RTB.
Supposing in 10 seconds that RTB is actual receives only and has handled 40,000 LSA, and so Sheng Xia 60,000 LSA can only come by retransmission list corresponding with RTB among the RTA regularly to send to RTB.Suppose that two routers are that 1500 interface is set up neighborhood by a MTU, a link state update packet can carry 40 LSA at most so.Because RTB sends after the ACK message, RTA just can send next link state update packet, be 1 second the time of delay of supposing RTB delayed delivery ACK, neglect the processing time and the delivery time of message on link of system, RTA can receive the ACK message of RTB in per 1 second, sent a link state update packet to RTB simultaneously.Like this, 60,000 LSA in the retransmission list all send to RTB just needs 1500 seconds, and this is one period considerable time.
In actual applications, other situation also may occur causes router need receive a lot of LSA, for example: set up a plurality of neighborhoods by a plurality of interfaces between two routers, router may reach several ten thousand from the total number of the LSA that these interfaces receive; A router and many routers are set up neighborhood, and this router can receive several ten thousand LSA that many neighbor routers are sent simultaneously.Under these situations, receiving router all can be subjected to very big impact, and the synchronous speed of LSDB also can be very slow.
Summary of the invention
The object of the present invention is to provide a kind of method of routing device chain circuit state data sync,, accelerate Link State data synchronization speed to reduce impact to receiving router.
The method of routing device chain circuit state data sync of the present invention may further comprise the steps:
When a) the transmission router produces new Link State Packet LSA or receives new LSA, described LSA is joined among the LSDB of oneself;
B) send router and judge whether receiving router is busy, if receiving router is busy, then described LSA is joined in the retransmission list corresponding with described receiving router in this transmission router, regularly retransmit, otherwise send described LSA immediately to receiving router;
When c) receiving router receives described LSA, this LSA is joined among the LSDB of described receiving router.
In the step b), judging that receiving router is whether busy is: if the quantity of the LSA in the described retransmission list was upgraded the quantity that link state update packet can load more than a Link State before new LSA adds, determine that then receiving router is busy, otherwise, determine that receiving router is not busy.
The maximum length of described link state update packet is the MTU MTU of receiving router place interface.
In the step b), the transmission router sends described LSA immediately and further comprises after receiving router: send router described LSA is joined in the described retransmission list, regularly retransmit.
Further comprise after the step c): d) described receiving router sends it back and answers the ACK message to sending router; When the transmission router receives the ACK message, delete LSA corresponding in the described retransmission list with this ACK message.
In the step d), send router LSA corresponding in the described retransmission list of deletion and further comprise afterwards: other LSA in the described retransmission list is loaded in the link state update packet, and this link state update packet is sent to receiving router immediately with this ACK message.
In the step d), receiving router further comprised before sending router sending the ACK message: judge that receiving buffering area uses percentage whether greater than the percentage of setting, if greater than the percentage of setting, then send the ACK message and to sending router be: delayed delivery ACK message is to the transmission router; Otherwise transmission ACK message to sending router is: send the ACK message immediately to sending router.
The percentage of described setting is less than or equal to 30%.
Step d) further comprises: if the reception buffering area of receiving router uses percentage greater than the percentage of setting, then increase the time of delay of delayed delivery ACK message, otherwise reduce the time of delay of delayed delivery ACK message.
Step b) further comprises, if receiving router is busy, then increases the time interval that regularly retransmits, otherwise, reduce the time interval that regularly retransmits.
Described transmission router is non-designed router (dr), and described receiving router is designed router (dr) and backup designed router (dr); Perhaps described transmission router is designed router (dr) or backup designed router (dr), and described receiving router is its neighbor router.
The invention has the beneficial effects as follows: send router when receiving router sends LSA, by judging the scale that sends retransmission list corresponding in the router with receiving router, determine whether receiving router is busy, dynamically adjust the frequency that sends LSA with this, make the process of transmitting of LSA relax level and smooth, reduce the system pressure of neighbor router, avoid unnecessary packet loss and re-transmission; Receiving router uses percentage dynamically to adjust the transmission speed of ACK message according to receiving buffering area, and effectively to the busy extent that sends router feedback oneself, remote-effects send the frequency that router sends LSA.These can both effectively improve routing device chain circuit state data synchronization speed.
Description of drawings
Fig. 1 is the method flow diagram of routing device chain circuit state data sync of the present invention;
Fig. 2 is the process chart of receiving router in the method for routing device chain circuit state data sync of the present invention.
Embodiment
Describe the present invention below in conjunction with accompanying drawing.
As shown in Figure 1, the method for routing device chain circuit state data sync of the present invention may further comprise the steps:
When 101) the transmission router produces new LSA or receives new LSA, described LSA is joined among the LSDB of oneself;
102) send router and judge whether receiving router is busy, if receiving router is busy, then described LSA is joined in the retransmission list corresponding with described receiving router in this transmission router, regularly retransmit, otherwise send described LSA immediately to receiving router;
When 103) receiving router receives described LSA, this LSA is joined among the LSDB of described receiving router.
In step 102) in, the transmission router sends described LSA immediately and further comprises after receiving router: send router described LSA is joined in the described retransmission list, regularly retransmit.
In step 102) in, judging that receiving router is whether busy is: if the quantity that the quantity of the LSA in the described retransmission list can be loaded more than a link state update packet before new LSA adds, determine that then receiving router is busy, otherwise, determine that receiving router is not busy.Wherein, the maximum length of link state update packet is the MTU MTU of receiving router place interface, because if the length of link state update packet surpasses the MTU of interface, may cause the burst of LSA.
Why judging the scale of retransmission list, is because the scale of retransmission list has directly reflected the ability to bear of receiving router.If the LSA number in the retransmission list seldom, illustrate that the disposal ability of receiving router can be caught up with present transmission speed; Otherwise the pressure ratio that receiving router is described is bigger, has had LSA to be dropped, and sends LSA again and in the past continues probably to be dropped.
In step 103) further comprise afterwards: described receiving router sends the ACK message to sending router; When the transmission router receives the ACK message, delete LSA corresponding in the described retransmission list with this ACK message.
Further, when the transmission router receives the ACK message of receiving router, can send the link state update packet that a length be no more than the MTU of interface to receiving router immediately.Receive the ACK message of receiving router, illustrate that temporarily capable processing of receiving router sends LSA in the past, therefore can send next link state update packet, and needn't wait until that retransmission timer is overtime, can accelerate the propagation velocity of LSA like this.
In the present invention, the time interval that regularly retransmits is defaulted as 5 seconds.By adjusting the time interval of regular re-transmission, can further accelerate the synchronizing speed of LSDB.Specifically,, then increase the time interval that regularly retransmits if receiving router is busy, otherwise, the time interval that regularly retransmits reduced.
The ability to bear that method of the present invention is judged receiving router according to the scale and the ACK message of the retransmission list of receiving router correspondence, thus the frequency that sends LSA adjusted, alleviate the system pressure of receiving router.Because having reduced unnecessary message, dropping packets probably when the receiving router system pressure is big, this method retransmit.
Be example with non-broadcast network and radio network respectively below, the concrete application of method of the present invention is described.
(1) non-broadcast network
When sending router and preparing that new LSA sent to certain neighbor router on the interface, if the quantity that the LSA quantity in the retransmission list of neighbor router correspondence can be loaded more than a link state update packet, this LSA does not send to neighbor router immediately so; Otherwise,, then this LSA is sent to neighbor router immediately by link state update packet if all LSA in the retransmission list of neighbor router correspondence can both be loaded in the link state update packet.
(2) radio network
New LSA sends with the form of multicast, if sending router is non-designed router (dr) (DROther), this LSA only sends to designed router (dr) (DR) and backup designed router (dr) (BDR) so, and destination address is all designed router (dr)s (AllDRouters); If sending router is DR or BDR, this LSA can send to all neighbor routers so, and destination address is all SPF routers (AllSPFRouters).Still judge the ability to bear of neighbor router according to the scale of the retransmission list of neighbor router correspondence,, take different mode (send immediately or do not send immediately) to treat for the different neighbor router of ability to bear.
(a) be DROther if send router, check the retransmission list of neighbours DR and BDR correspondence, specifically comprise: if the LSA quantity that the LSA quantity (a1) in the retransmission list of DR and BDR correspondence all can be loaded more than a link state update packet does not send this LSA so immediately.(a2), use multicast destination address AllDRouters to send this LSA immediately so if the LSA in the retransmission list of DR and BDR correspondence can be respectively charged in the link state update packet.(a3) if having only the LSA in the retransmission list of a correspondence can both be encased in the link state update packet among DR and the BDR, hypothesis is DR here, uses unicast message to send this LSA immediately to DR so, and does not send this LSA immediately to BDR.
(b) be DR or BDR if send router, check the retransmission list of each neighbor router correspondence, specifically comprise: if the quantity that the LSA quantity (b1) in the retransmission list of all neighbours' correspondences all can be loaded more than a link state update packet does not send this LSA so immediately.(b2), use multicast destination address AllSPFRouters to send this LSA immediately so if the LSA in the retransmission list of all neighbor router correspondences can be respectively charged in the link state update packet.(b3), use unicast message to send this LSA immediately, and do not send this LSA immediately to other neighbor router to corresponding neighbor router if the LSA only in the retransmission list of some neighbor router correspondence enough is respectively charged in the link state update packet.
Need to prove, in the example of above-mentioned non-broadcast network and radio network,, still do not send LSA immediately, all need this LSA is joined in the corresponding retransmission tabulation, regularly retransmit, up to receiving that the ACK message is for extremely no matter be to send LSA immediately.
As shown in Figure 2, in order to reach goal of the invention, also can adjust the frequency of receiving router transmission ACK message and come remote-effects to send the frequency that router sends LSA.
Such as, in step 105) in, receiving router judges that further the reception buffering area uses percentage whether greater than the percentage of setting, if greater than the percentage of setting, transmission ACK message to sending router is: postpone to send out the ACK message to the transmission router; Otherwise transmission ACK message to sending router is: send the ACK message immediately to sending router.
Surpassed the percentage of setting if receive the use amount of buffering area, illustrate that to also have a lot of messages etc. pending, system is in busy state, does not need to send router and sends LSA again and come the ACK of delayed delivery at this moment message; Otherwise illustrative system pressure is normal, the more message of having the ability to continue to handle, and expectation transmission router sends new LSA and comes, and sends the ACK message this moment immediately.
The percentage of this setting can be specified according to the hardware of receiving router and the performance of software systems, and the present invention is preferably and is less than or equal to 30%.
Use percentage to adjust according to the reception buffering area of receiving router,, then increase the time of delay of delayed delivery ACK message if use percentage greater than the percentage of setting to this time of delay, otherwise, time of delay of delayed delivery ACK message reduced.Be preferably more than 1 second the time of delay of delayed delivery ACK message and less than the time interval that regularly retransmits.
Described reception buffering area is a logical concept, and receiving router can use the mode of various hardware or software to realize that this receives buffering area.
In a word, method of the present invention can make the diffusion process of LSA relax and steady (particularly under the larger situation of LSDB), reduce the system pressure of receiving router, reduce the probability that abandons and retransmit of message, accelerated routing device chain circuit state data synchronization speed (for example, the diffusion of 100,000 LSA can be controlled in minutes or be shorter) on the whole; Simultaneously, reduced of the dependence of the Flooding process of ospf protocol to the performance and the implementation of router hardware, software systems.
Should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not breaking away from the spiritual scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (11)
1. the method for a routing device chain circuit state data sync is characterized in that, this method may further comprise the steps:
When a) the transmission router produces new Link State Packet LSA or receives new LSA, described LSA is joined among the LSD LSDB of oneself;
B) send router and judge whether receiving router is busy, if receiving router is busy, then described LSA is joined in the retransmission list corresponding with described receiving router in this transmission router, regularly retransmit, otherwise send described LSA immediately to receiving router;
When c) receiving router receives described LSA, this LSA is joined among the LSDB of described receiving router.
2. the method for claim 1 is characterized in that,
In the step b), judging that receiving router is whether busy is: if the quantity of the LSA in the described retransmission list was upgraded the quantity that link state update packet can load more than a Link State before new LSA adds, determine that then receiving router is busy, otherwise, determine that receiving router is not busy.
3. method as claimed in claim 2 is characterized in that,
The maximum length of described link state update packet is the MTU MTU of receiving router place interface.
4. as claim 1,2 or 3 described methods, it is characterized in that,
In the step b), the transmission router sends described LSA immediately and further comprises after receiving router: send router described LSA is joined in the described retransmission list, regularly retransmit.
5. method as claimed in claim 4 is characterized in that,
Further comprise after the step c): d)
Described receiving router sends it back answers the ACK message to sending router;
When the transmission router receives the ACK message, delete LSA corresponding in the described retransmission list with this ACK message.
6. method as claimed in claim 5 is characterized in that,
In the step d), send router LSA corresponding in the described retransmission list of deletion and further comprise afterwards: other LSA in the described retransmission list is loaded in the link state update packet, and this link state update packet is sent to receiving router immediately with this ACK message.
7. method as claimed in claim 5 is characterized in that,
In the step d), receiving router further comprised before sending router sending the ACK message: judge that receiving buffering area uses percentage whether greater than the percentage of setting, if greater than the percentage of setting, then send the ACK message and to sending router be: delayed delivery ACK message is to the transmission router; Otherwise transmission ACK message to sending router is: send the ACK message immediately to sending router.
8. method as claimed in claim 7 is characterized in that,
The percentage of described setting is less than or equal to 30%.
9. method as claimed in claim 7 is characterized in that,
Step d) further comprises: if the reception buffering area of receiving router uses percentage greater than the percentage of setting, then increase the time of delay of delayed delivery ACK message, otherwise reduce the time of delay of delayed delivery ACK message.
10. method as claimed in claim 4 is characterized in that,
Step b) further comprises, if receiving router is busy, then increases the time interval that regularly retransmits, otherwise, reduce the time interval that regularly retransmits.
11., it is characterized in that as claim 1,2 or 3 described methods:
Described transmission router is non-designed router (dr), and described receiving router is designed router (dr) and backup designed router (dr); Perhaps
Described transmission router is designed router (dr) or backup designed router (dr), and described receiving router is its neighbor router.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101083079A CN100420242C (en) | 2006-08-01 | 2006-08-01 | Routing device chain circuit state data synchronizing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101083079A CN100420242C (en) | 2006-08-01 | 2006-08-01 | Routing device chain circuit state data synchronizing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1889531A CN1889531A (en) | 2007-01-03 |
| CN100420242C true CN100420242C (en) | 2008-09-17 |
Family
ID=37578790
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101083079A Expired - Fee Related CN100420242C (en) | 2006-08-01 | 2006-08-01 | Routing device chain circuit state data synchronizing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100420242C (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101316229B (en) * | 2007-06-01 | 2011-09-14 | 华为技术有限公司 | Method and router for synchronizing link state advertisement |
| CN101800694B (en) * | 2009-09-16 | 2012-07-25 | 福建星网锐捷网络有限公司 | Resource warning processing method and routing switching equipment |
| CN101764820B (en) * | 2010-01-14 | 2012-11-07 | 华为技术有限公司 | Information synchronizing method, device and system of link state database of GR (Graceful Restart) scene |
| CN102932116B (en) * | 2012-10-26 | 2015-06-17 | 迈普通信技术股份有限公司 | Link state advertisement information confirmation method and equipment |
| CN103414645B (en) * | 2013-07-24 | 2017-02-08 | 北京华为数字技术有限公司 | Link status database synchronization method, controller and system |
| CN105721320B (en) * | 2014-12-05 | 2020-01-07 | 中兴通讯股份有限公司 | Method, device and system for synchronously realizing link state notification information |
| CN105634830A (en) * | 2016-03-14 | 2016-06-01 | 北京星网锐捷网络技术有限公司 | OSPF hot standby method and device |
| CN107104763B (en) * | 2016-12-22 | 2020-06-02 | 腾讯科技（深圳）有限公司 | Method and device for setting timeout retransmission duration |
| CN109167706A (en) * | 2018-09-10 | 2019-01-08 | 北京华环电子股份有限公司 | A method of being quickly informed in gauze member |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5461624A (en) * | 1992-03-24 | 1995-10-24 | Alcatel Network Systems, Inc. | Distributed routing network element |
| US20030081553A1 (en) * | 2001-10-30 | 2003-05-01 | Nabil Bitar | Link state retransmission mechanism |
| US20030218988A1 (en) * | 2002-05-21 | 2003-11-27 | Min-Ho Han | Network for transferring active packet and method for employing same |
| CN1192564C (en) * | 2002-06-06 | 2005-03-09 | 华为技术有限公司 | Method for opening grouping updating of fifth group link state notice of shortest route priority procotol |
| US6950427B1 (en) * | 2001-08-09 | 2005-09-27 | Cisco Technology, Inc. | Technique for resynchronizing LSDB in OSPF after a software reload in a non-stop forwarding intermediate node of a computer network |
-
2006
- 2006-08-01 CN CNB2006101083079A patent/CN100420242C/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5461624A (en) * | 1992-03-24 | 1995-10-24 | Alcatel Network Systems, Inc. | Distributed routing network element |
| US6950427B1 (en) * | 2001-08-09 | 2005-09-27 | Cisco Technology, Inc. | Technique for resynchronizing LSDB in OSPF after a software reload in a non-stop forwarding intermediate node of a computer network |
| US20030081553A1 (en) * | 2001-10-30 | 2003-05-01 | Nabil Bitar | Link state retransmission mechanism |
| US20030218988A1 (en) * | 2002-05-21 | 2003-11-27 | Min-Ho Han | Network for transferring active packet and method for employing same |
| CN1192564C (en) * | 2002-06-06 | 2005-03-09 | 华为技术有限公司 | Method for opening grouping updating of fifth group link state notice of shortest route priority procotol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1889531A (en) | 2007-01-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100420242C (en) | Routing device chain circuit state data synchronizing method | |
| EP1747644B1 (en) | Method and apparatus for group communication with end-to-end reliability | |
| Chiu et al. | TRAM: A tree-based reliable multicast protocol | |
| EP2421205B1 (en) | Flooding-based routing protocol having average-rate and burst-rate control | |
| Zhang et al. | Reliable bursty convergecast in wireless sensor networks | |
| US6507562B1 (en) | Dynamic optimization for receivers using distance between a repair head and a member station in a repair group for receivers having a closely knit topological arrangement to locate repair heads near the member stations which they serve in tree based repair in reliable multicast protocol | |
| EP1716500B1 (en) | Apparatus, method,system and computer program product for communicating packets in a network environment | |
| US6526022B1 (en) | Detecting congestion by comparing successive loss of packets in windows to provide congestion control in reliable multicast protocol | |
| US7349390B2 (en) | Packet transmission method and communication system | |
| JP2003224601A (en) | Device, method, and system for broadcasting, program thereof, and program recording medium | |
| WO2004054100A2 (en) | System and method for link-state based proxy flooding of messages in a network | |
| CA2296423A1 (en) | Communication method and system | |
| CN101212401B (en) | Grid-oriented configurable data transmission method and system | |
| CN103560947B (en) | A kind of method and device avoiding intermediate system neighborhood to shake | |
| Kunz | Multicasting in mobile ad-hoc networks: achieving high packet delivery ratios | |
| CN101005336A (en) | Adpative jam control method and system suitable for satellite network | |
| CN107820218A (en) | The establishing method and equipment of message transmissions mode | |
| CN107733589B (en) | Method, device, equipment and storage medium for realizing automatic retransmission request of ad hoc network | |
| CN102904817B (en) | Transmitting method for link state advertisement (LSA), OSPF (open shortest path first interior gateway protocol) equipment and network system | |
| CN114286380A (en) | Deterministic delay service transmission method and system for dynamically adjusting time slice | |
| Lien | Hop-by-hop tcp for sensor networks | |
| CN101459613B (en) | Method and device for transmitting route updating packet | |
| Lee et al. | A hop-by-hop reliability support scheme for wireless sensor networks | |
| CN100542124C (en) | RPF is reliable transmission in many ways | |
| Maimour et al. | An active reliable multicast framework for the grids |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20171214 Address after: 075000 Government Street, Ningbao village, Zhenning fort, Chicheng County, Zhangjiakou, Hebei Province, No. 1 Patentee after: Su Huaijun Address before: 510640 Guangdong City, Tianhe District Province, No. five, road, public education building, unit 371-1, unit 2401 Patentee before: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Effective date of registration: 20171214 Address after: 510640 Guangdong City, Tianhe District Province, No. five, road, public education building, unit 371-1, unit 2401 Patentee after: GUANGDONG GAOHANG INTELLECTUAL PROPERTY OPERATION Co.,Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| CB03 | Change of inventor or designer information |
Inventor after: Su Huaijun Inventor before: Feng Lu |
|
| CB03 | Change of inventor or designer information | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080917 Termination date: 20180801 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |