CA2548340A1 - System and method for controlling the flooding of information in a network environment - Google Patents

System and method for controlling the flooding of information in a network environment Download PDF

Info

Publication number
CA2548340A1
CA2548340A1 CA002548340A CA2548340A CA2548340A1 CA 2548340 A1 CA2548340 A1 CA 2548340A1 CA 002548340 A CA002548340 A CA 002548340A CA 2548340 A CA2548340 A CA 2548340A CA 2548340 A1 CA2548340 A1 CA 2548340A1
Authority
CA
Canada
Prior art keywords
network element
neighbor list
update
relaying
neighbor
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CA002548340A
Other languages
French (fr)
Other versions
CA2548340C (en
Inventor
David A. Cook
Alvaro E. Retana
Russell I. White
Yi Yang
Madhavi W. Chandra
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.)
Cisco Technology Inc
Original Assignee
Cisco Technology, Inc.
David A. Cook
Alvaro E. Retana
Russell I. White
Yi Yang
Madhavi W. Chandra
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 Cisco Technology, Inc., David A. Cook, Alvaro E. Retana, Russell I. White, Yi Yang, Madhavi W. Chandra filed Critical Cisco Technology, Inc.
Publication of CA2548340A1 publication Critical patent/CA2548340A1/en
Application granted granted Critical
Publication of CA2548340C publication Critical patent/CA2548340C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/03—Topology update or discovery by updating link state protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding

Abstract

An apparatus for communicating packets in a network environment is provided that includes a first network element that includes a first neighbor list, the first network element being coupled to a second network element and a third network element. The first network element is operable to receive a second neighbor list from the second network element and a third neighbor list from the third network element. The first network element is further operable to determine one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.

Claims (32)

1. An apparatus for communicating packets in a network environment, comprising:
a first network element that includes a first neighbor list, the first network element being coupled to a second network element and a third network element, the first network element being operable to receive a second neighbor list from the second network element and a third neighbor list from the third network element, wherein the first network element is further operable to determine one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.
2. The apparatus of Claim 1, wherein the first network element includes a link state database operable to store the first neighbor list.
3. The apparatus of Claim 1, wherein if the first neighbor list and the second neighbor list overlap completely, then the first network element does not relay the update when it is received from the second network element.
4. The apparatus of Claim 1, wherein the update is provided in a routing protocol packet that includes an origin associated with the update.
5. The apparatus of Claim 1, wherein if the first neighbor list and the second neighbor list do not overlap completely and the first network element is designated as active, then the first network element relays the update when it is received from the second network element.
6. The apparatus of Claim 1, wherein if the first neighbor list and the second neighbor list do not overlap completely and the first network element is designated as non-active, then the first network element waits a selected time interval before determining whether to relay the update.
7. The apparatus of Claim 6, wherein the selected time interval is substantially equal to a pushback time plus a jitter time.
8. The apparatus of Claim 1, wherein if the first network element determines that its relaying of the update will result in a redundant transmission, the first network element will suppress the relaying of the update.
9. The apparatus of Claim 1, wherein the first network element is operable to determine whether its relaying of the update will result in a redundant transmission by gleaning data associated with a selected one of an acknowledgement and a re-flood both of which are associated with the update, the acknowledgement and the re-flood being communicated by one or more non-overlapping neighbors.
10. The apparatus of Claim 1, wherein the first network element includes an algorithm that is operable to determine the one more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the algorithm being invoked in order to determine whether the first network element should relay the update that it receives.
11. A method for communicating packets in a network environment, comprising:
receiving, by a first network element that includes a first neighbor list, a second neighbor list from a second network element and a third neighbor list from a third network element; and determining one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.
12. The method of Claim 11, further comprising:
storing the first neighbor list in a link state database provided in the first network element.
13. The method of Claim 11, wherein if the first neighbor list and the second neighbor list overlap completely, then the first network element does not relay the update when it is received from the second network element.
14. The method of Claim 11, wherein if the first neighbor list and the second neighbor list do not overlap completely and the first network element is designated as active, then the first network element relays the update when it is received from the second network element.
15. The method of Claim 11, wherein if the first neighbor list and the second neighbor list do not overlap completely and the first network element is designated as non-active, then the first network element waits a selected time interval before determining whether to relay the update.
16. The method of Claim 15, wherein the selected time interval is substantially equal to a pushback time plus a fitter time.
17. The method of Claim 11, wherein if the first network element determines that its relaying of the update will result in a redundant transmission, the first network element will suppress the relaying of the update.
18. The method of Claim 11, further comprising:
determining whether relaying of the update by the first network element will result in a redundant transmission by gleaning data associated with a selected one of an acknowledgement and a re-flood both of which are associated with the update, the acknowledgement and the re-flood being communicated by one or more non-overlapping neighbors.
19. A system for communicating packets in a network environment, comprising:
means for receiving a first neighbor list from a first network element and a second neighbor list from a second network element; and means for determining one or more overlaps provided by the first and second neighbor lists when compared to a third neighbor list, a third network element relaying an update that it receives from the first network element based on the one or more overlaps.
20. The system of Claim 19, further comprising:
means for storing the third neighbor list the third network element.
21. The system of Claim 19, wherein if the first neighbor list and the third neighbor list overlap completely, then the third network element does not relay the update when it is received from the first network element.
22. The system of Claim 19, wherein if the first neighbor list and the third neighbor list do not overlap completely and the third network element is designated as active, then the third network element relays the update when it is received from the first network element.
23. The system of Claim 19, wherein if the first neighbor list and the third neighbor list do not overlap completely and the third network element is designated as non-active, then the third network element waits a selected time interval before determining whether to relay the update.
24. The system of Claim 19, wherein if the third network element determines that its relaying of the update will result in a redundant transmission, the third network element will suppress the relaying of the update.
25. The system of Claim 19, further comprising:
means for determining whether relaying of the update by the third network element will result in a redundant transmission by gleaning data associated with a selected one of an acknowledgement and a re-flood both of which are associated with the update, the acknowledgement and the re-flood being communicated by one or more non-overlapping neighbors.
26. Software for communicating packets in a network environment, the software being embodied in a computer readable medium and comprising computer code such that when executed is operable to:
receive a first neighbor list from a first network element and a second neighbor list from a second network element; and determine one or more overlaps provided by the first and second neighbor lists when compared to a third neighbor list, a third network element relaying an update that it receives from the first network element based on the one or more overlaps.
27. The medium of Claim 26, wherein the code is further operable to:
store the third neighbor list in a link state database provided in the third network element.
28. The medium of Claim 26, wherein if the first neighbor list and the third neighbor list overlap completely, then the third network element does not relay the update when it is received from the first network element.
29. The medium of Claim 26, wherein if the first neighbor list and the third neighbor list do not overlap completely and the third network element is designated as active, then the third network element relays the update when it is received from the first network element.
30. The medium of Claim 26, wherein if the first neighbor list and the third neighbor list do not overlap completely and the third network element is designated as non-active, then the third network element waits a selected time interval before determining whether to relay the update.
31. The medium of Claim 26, wherein if the third network element determines that its relaying of the update will result in a redundant transmission, the third network element will suppress the relaying of the update.
32. The medium of Claim 26, wherein the code is further operable to:

determine whether relaying of the update by the third network element will result in a redundant transmission by gleaning data associated with a selected one of an acknowledgement and a re-flood both of which are associated with the update, the acknowledgement and the re-flood being communicated by one or more non-overlapping neighbors.
CA2548340A 2004-01-21 2005-01-12 System and method for controlling the flooding of information in a network environment Expired - Fee Related CA2548340C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US10/762,856 2004-01-21
US10/762,856 US7298707B2 (en) 2004-01-21 2004-01-21 System and method for controlling the flooding of information in a network environment
PCT/US2005/001106 WO2005069826A2 (en) 2004-01-21 2005-01-12 System and method for controlling the flooding of information in a network environment

Publications (2)

Publication Number Publication Date
CA2548340A1 true CA2548340A1 (en) 2005-08-04
CA2548340C CA2548340C (en) 2010-11-23

Family

ID=34750381

Family Applications (1)

Application Number Title Priority Date Filing Date
CA2548340A Expired - Fee Related CA2548340C (en) 2004-01-21 2005-01-12 System and method for controlling the flooding of information in a network environment

Country Status (6)

Country Link
US (2) US7298707B2 (en)
EP (1) EP1716500B1 (en)
CN (1) CN101341682B (en)
AU (1) AU2005206868B2 (en)
CA (1) CA2548340C (en)
WO (1) WO2005069826A2 (en)

Families Citing this family (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6820134B1 (en) * 2000-12-28 2004-11-16 Cisco Technology, Inc. Optimizing flooding of information in link-state routing protocol
US7298707B2 (en) * 2004-01-21 2007-11-20 Cisco Technology, Inc. System and method for controlling the flooding of information in a network environment
WO2005079536A2 (en) * 2004-02-19 2005-09-01 Ember Corporation Directing packets in a mesh network
US8407365B2 (en) * 2004-05-24 2013-03-26 Tellabs Operations, Inc. Method and system for autodiscovery of a network path
EP1772018A1 (en) * 2004-07-15 2007-04-11 Koninklijke Philips Electronics N.V. Measurement system for delay between two signals transmitted via two transmission paths
US7391730B1 (en) * 2004-07-21 2008-06-24 Cisco Technology System and method for synchronizing link state databases in a network environment
US7623533B2 (en) * 2005-10-14 2009-11-24 Hewlett-Packard Development Company, L.P. Switch meshing using multiple directional spanning trees
US7636356B1 (en) 2006-01-03 2009-12-22 Marvell Israel (M.I.S.L.) Ltd Processor traffic segregation for network switching and routing
US8255515B1 (en) 2006-01-17 2012-08-28 Marvell Israel (M.I.S.L.) Ltd. Rate limiting per-flow of traffic to CPU on network switching and routing devices
US7609672B2 (en) * 2006-08-29 2009-10-27 Cisco Technology, Inc. Method and apparatus for automatic sub-division of areas that flood routing information
US7899005B2 (en) * 2006-09-12 2011-03-01 Cisco Technology, Inc. Method and apparatus for passing routing information among mobile routers
US7639057B1 (en) 2006-12-07 2009-12-29 Marvell International Ltd. Clock gater system
US8223668B2 (en) * 2006-12-14 2012-07-17 Rockstar Bidco Lp Method and apparatus for exchanging routing information and the establishment of connectivity across multiple network areas
JP4821600B2 (en) * 2006-12-26 2011-11-24 ソニー株式会社 Wireless communication system, wireless communication apparatus, wireless communication method, and program
US20080207209A1 (en) * 2007-02-22 2008-08-28 Fujitsu Limited Cellular mobile radio communication system
US8437280B2 (en) * 2007-03-22 2013-05-07 Tr Technologies Inc. Distributed synchronous batch reconfiguration of a network
US7940668B2 (en) * 2008-03-21 2011-05-10 Cisco Technology, Inc. Method and apparatus to enable an IPe domain through EIGRP
US7978612B2 (en) * 2008-10-13 2011-07-12 Cisco Technology, Inc. Two-hop relay for reducing distance vector routing information
US7869349B2 (en) * 2008-10-14 2011-01-11 International Business Machines Corporation Method and system for deducing network routes by querying routers
US8811388B2 (en) * 2008-11-14 2014-08-19 Rockstar Consortium Us Lp Service instance applied to MPLS networks
US8730875B2 (en) * 2009-05-18 2014-05-20 Nec Corporation Wireless communication terminal, wireless communication forwarding control system, wireless communication forwarding control method, and wireless communication forwarding control program
US8831618B2 (en) * 2009-07-15 2014-09-09 Qualcomm Incorporated Apparatus and method to perform fast neighbor list search during a transfer to a different RAT target system
CN102064992B (en) * 2009-11-13 2012-11-28 中兴通讯股份有限公司 Relay node, and relay node distributed network and networking method thereof
US8787392B2 (en) 2010-12-17 2014-07-22 Cisco Technology, Inc. Dynamic routing metric adjustment
US9019846B2 (en) 2011-06-20 2015-04-28 Cisco Technology, Inc. Reducing the impact of hidden nodes in mesh networks
JP5708335B2 (en) * 2011-07-19 2015-04-30 富士通株式会社 Base station, communication method, and wireless communication system
US20130100852A1 (en) * 2011-10-19 2013-04-25 Electronics And Telecommunications Research Institute METHOD AND APPARATUS FOR MULTI-HOP QoS ROUTING
GB201200709D0 (en) * 2012-01-17 2012-02-29 Ip Access Ltd Network element, integrated circuit cellular communication system and method for correlating information
US9819548B2 (en) * 2013-01-25 2017-11-14 Cisco Technology, Inc. Shared information distribution in a computer network
US9372821B2 (en) * 2013-05-23 2016-06-21 Cisco Technology, Inc. Limited functionality link state protocol node
US10366368B2 (en) * 2016-09-22 2019-07-30 Microsoft Technology Licensing, Llc Search prioritization among users in communication platforms
US10038623B2 (en) 2016-10-24 2018-07-31 Microsoft Technology Licensing, Llc Reducing flooding of link state changes in networks
EP3574681B1 (en) * 2017-01-25 2023-09-20 Airties SAS Island topologies and routing in hybrid mesh networks
GB201701592D0 (en) 2017-01-31 2017-03-15 Nchain Holdings Ltd Computer-implemented system and method
US11778021B2 (en) 2017-01-31 2023-10-03 Nchain Licensing Ag Computer-implemented system and method for updating a network's knowledge of the network's topology

Family Cites Families (50)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5101348A (en) * 1988-06-23 1992-03-31 International Business Machines Corporation Method of reducing the amount of information included in topology database update messages in a data communications network
US5345558A (en) * 1992-11-23 1994-09-06 Synoptics Communications, Inc. Topology independent broadcast of cells in an ATM network or the like
US5511122A (en) * 1994-06-03 1996-04-23 The United States Of America As Represented By The Secretary Of The Navy Intermediate network authentication
EP0699008A1 (en) * 1994-08-23 1996-02-28 BELL TELEPHONE MANUFACTURING COMPANY Naamloze Vennootschap Method for rerouting a data stream
US6393486B1 (en) * 1995-06-23 2002-05-21 Cisco Technology, Inc. System and method using level three protocol information for network centric problem analysis and topology construction of actual or planned routed network
US5926101A (en) * 1995-11-16 1999-07-20 Philips Electronics North America Corporation Method and apparatus for routing messages in a network of nodes with minimal resources
US5742820A (en) * 1995-07-06 1998-04-21 Novell, Inc. Mechanism for efficiently synchronizing information over a network
US5757924A (en) * 1995-09-18 1998-05-26 Digital Secured Networks Techolognies, Inc. Network security device which performs MAC address translation without affecting the IP address
US5684800A (en) * 1995-11-15 1997-11-04 Cabletron Systems, Inc. Method for establishing restricted broadcast groups in a switched network
US5815490A (en) * 1995-11-20 1998-09-29 Nec America, Inc. SDH ring high order path management
US6151324A (en) * 1996-06-03 2000-11-21 Cabletron Systems, Inc. Aggregation of mac data flows through pre-established path between ingress and egress switch to reduce number of number connections
JPH1079740A (en) * 1996-09-03 1998-03-24 Hitachi Ltd Router device using atm switch
US6069889A (en) * 1996-10-02 2000-05-30 International Business Machines Corporation Aggregation of data flows on switched network paths
US5881243A (en) * 1997-05-07 1999-03-09 Zaumen; William T. System for maintaining multiple loop free paths between source node and destination node in computer network
US6347078B1 (en) * 1997-09-02 2002-02-12 Lucent Technologies Inc. Multiple path routing
US6111884A (en) * 1997-09-12 2000-08-29 International Business Machines Corporation Method for using logical link control (LLC) to route traffic within a router
US6256295B1 (en) * 1997-09-25 2001-07-03 Nortel Networks Limited Method and apparatus for determining multiple minimally-overlapping paths between nodes in a network
DE19745602C1 (en) * 1997-10-08 1999-07-15 Atotech Deutschland Gmbh Method and solution for the production of gold layers
US6131120A (en) * 1997-10-24 2000-10-10 Directory Logic, Inc. Enterprise network management directory containing network addresses of users and devices providing access lists to routers and servers
US6639897B1 (en) 1998-04-22 2003-10-28 Nippon Telegraph And Telephone Corporation Communication network of linked nodes for selecting the shortest available route
US6483833B1 (en) * 1998-06-19 2002-11-19 Nortel Networks Limited Method for transmitting label switching control information using the open shortest path first opaque link state advertisement option protocol
US6625156B2 (en) * 1998-06-29 2003-09-23 Nortel Networks Limited Method of implementing quality-of-service data communications over a short-cut path through a routed network
US6584093B1 (en) * 1998-08-25 2003-06-24 Cisco Technology, Inc. Method and apparatus for automatic inter-domain routing of calls
US6108702A (en) * 1998-12-02 2000-08-22 Micromuse, Inc. Method and apparatus for determining accurate topology features of a network
US6657965B1 (en) 1998-12-15 2003-12-02 Siemens Information & Communication Networks, Inc. System and method for enhanced routing and reservation protocol
US6366962B1 (en) * 1998-12-18 2002-04-02 Intel Corporation Method and apparatus for a buddy list
US6526052B1 (en) * 1998-12-23 2003-02-25 Enterasys Networks, Inc. Virtual local area networks having rules of precedence
US6856627B2 (en) * 1999-01-15 2005-02-15 Cisco Technology, Inc. Method for routing information over a network
SE521516C2 (en) * 1999-09-14 2003-11-11 Ericsson Telefon Ab L M Routing monitoring and handling device for communication network, using control device with copy of link condition database for its associated routing regions
US6578086B1 (en) * 1999-09-27 2003-06-10 Nortel Networks Limited Dynamically managing the topology of a data network
US6385174B1 (en) * 1999-11-12 2002-05-07 Itt Manufacturing Enterprises, Inc. Method and apparatus for transmission of node link status messages throughout a network with reduced communication protocol overhead traffic
US7327683B2 (en) * 2000-03-16 2008-02-05 Sri International Method and apparatus for disseminating topology information and for discovering new neighboring nodes
EP1168710B1 (en) * 2000-06-19 2005-11-23 Broadcom Corporation Method and device for frame forwarding in a switch fabric
AU5684100A (en) * 2000-06-20 2002-01-02 Nokia Networks Oy A method for performing a mobile user terminal route update in a telecommunication network operated based on the internet protocol
US6985959B1 (en) * 2000-11-01 2006-01-10 Nortel Networks Limited Constraint route dissemination using distributed route exchanges
US6898187B2 (en) 2000-11-30 2005-05-24 Sun Microsystems, Inc. Automatic selection of unique node identifiers in a distributed routing environment
US6820134B1 (en) * 2000-12-28 2004-11-16 Cisco Technology, Inc. Optimizing flooding of information in link-state routing protocol
US20020145978A1 (en) * 2001-04-05 2002-10-10 Batsell Stephen G. Mrp-based hybrid routing for mobile ad hoc networks
TW555837B (en) * 2001-07-02 2003-10-01 Merck Patent Gmbh Chiral compounds
US7254111B2 (en) * 2001-10-05 2007-08-07 Samsung Electronics Co., Ltd. Routing coordination protocol for a massively parallel router architecture
US7277383B2 (en) * 2001-10-05 2007-10-02 Samsung Electronics Co., Ltd. Redundancy mechanization protocol for a massively parallel router
ATE399417T1 (en) * 2002-03-04 2008-07-15 Operax Ab METHOD FOR PROVIDING TOPOLOGY AWARENESS INFORMATION IN AN IP NETWORK
US7200149B1 (en) * 2002-04-12 2007-04-03 Meshnetworks, Inc. System and method for identifying potential hidden node problems in multi-hop wireless ad-hoc networks for the purpose of avoiding such potentially problem nodes in route selection
AU2003237454A1 (en) * 2002-06-06 2003-12-22 Motorola, Inc., A Corporation Of The State Of Delaware Protocol and structure for mobile nodes in a self-organizing communication network
KR100433556B1 (en) * 2002-08-08 2004-05-31 삼성전자주식회사 Link-state synchronization on Ad-hoc network, method therefore, and data structure therefore
US20040247317A1 (en) * 2003-06-06 2004-12-09 Sadananda Santosh Kumar Method and apparatus for a network database in an optical network
DE112004002233B4 (en) * 2003-11-19 2018-07-12 Nimcat Networks Inc. Time and data synchronization between network devices
US7554981B2 (en) * 2003-11-26 2009-06-30 Wind River Systems, Inc. System and method for efficient storage and processing of IPv6 addresses
AU2003295301A1 (en) * 2003-12-23 2005-07-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for efficient routing in ad hoc networks
US7298707B2 (en) 2004-01-21 2007-11-20 Cisco Technology, Inc. System and method for controlling the flooding of information in a network environment

Also Published As

Publication number Publication date
US20080043635A1 (en) 2008-02-21
US7821956B2 (en) 2010-10-26
AU2005206868B2 (en) 2008-11-06
EP1716500A2 (en) 2006-11-02
CN101341682B (en) 2012-01-11
CA2548340C (en) 2010-11-23
WO2005069826A3 (en) 2006-12-28
CN101341682A (en) 2009-01-07
US7298707B2 (en) 2007-11-20
US20050160179A1 (en) 2005-07-21
EP1716500B1 (en) 2018-03-21
AU2005206868A1 (en) 2005-08-04
EP1716500A4 (en) 2010-01-06
WO2005069826A2 (en) 2005-08-04

Similar Documents

Publication Publication Date Title
CA2548340A1 (en) System and method for controlling the flooding of information in a network environment
US7764599B2 (en) Network routing device and network routing method
EP2421206B1 (en) Flooding-based routing protocol having database pruning and rate-controlled state refresh
US20140341078A1 (en) Reduction of message and computational overhead in networks
KR20090030320A (en) Mobile ad-hoc network(manet) and method for implementing mutiple paths for fault tolerance
EP2642691A1 (en) Method and device for link fault detecting and recovering based on arp interaction
TW200910835A (en) Wireless local area network (LAN) system
JP4193678B2 (en) Communication terminal and communication network
US20040017769A1 (en) Method of establishing a route redundancy in a data transmission system using static routes
US11088871B1 (en) Fast convergence for MAC mobility
CN102420766B (en) Routing determination method and routing device
US11088939B1 (en) Reducing open shortest path first protocol link flap
WO2007094308A1 (en) Wireless data communication system
CN108337162B (en) System and method for supporting dual-homing protection
JP2011166245A (en) Network system, switching method of gateway device, first tunnel termination gateway device and second tunnel termination gateway device
CN102223241B (en) Method and equipment for informing network change
JP4480726B2 (en) Wireless terminal and wireless communication method
CN102055635B (en) TM method for Ethernet ring network and ring network node
US11736385B1 (en) Distributed flooding technique
CN104486223A (en) GR method and system based on OSPF protocol
US20230327989A1 (en) Systems and methods for low convergence time for media access control move events
US11252074B2 (en) Detection of multihoming misconfiguration
JP5493952B2 (en) Relay device, network system, and program
CN114553761B (en) Exception handling method, device, network equipment and storage medium
EP4009595B1 (en) Maintaining a set of links associated with a link aggregation group to facilitate provisioning or updating of a customer edge device provisioning or updating of a customer edge device

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed

Effective date: 20180112