CA2521501A1 - Technique for notifying eigrp neighbors when destroying adjacencies in a computer network - Google Patents
Technique for notifying eigrp neighbors when destroying adjacencies in a computer network Download PDFInfo
- Publication number
- CA2521501A1 CA2521501A1 CA002521501A CA2521501A CA2521501A1 CA 2521501 A1 CA2521501 A1 CA 2521501A1 CA 002521501 A CA002521501 A CA 002521501A CA 2521501 A CA2521501 A CA 2521501A CA 2521501 A1 CA2521501 A1 CA 2521501A1
- Authority
- CA
- Canada
- Prior art keywords
- goodbye
- neighbor
- attribute
- neighbors
- router
- 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
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/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/026—Details of "hello" or keep-alive messages
-
- 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/033—Topology update or discovery by updating distance vector protocols
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A technique efficiently notifies EIGRP neighbors when destroying adjacencies in a computer network. A goodbye notification packet is provided that enable s an EIGRP router to inform one or more of its neighbors of its intention to destroy their existing adjacencies. The goodbye notification packet comprise s an EIGRP packet header with variable-length fields embodied as an appended goodbye attribute. The appended goodbye attribute is illustratively tagged according to a TLV encoding format that defines a new type (T) field called "a goodbye" having a predetermined type that distinguishes it from a convention al EIGRP Hello packet. A value (V) field of infor~mation conveyed within the goodbye attribute contains a list of neighbor (peer) identi~fiers (IDs). The peer IDs on this list instruct those neighbor routers to "go away" so that their adjacencies can be destroyed.
Claims (20)
1. A system configured to notify neighbors when destroying adjacencies in a computer network, the system comprising:
a router adapted to generate a goodbye notification packet to inform one or more of the neighbors to destroy the adjacencies, the goodbye notification packet hav-ing a packet header with an appended goodbye attribute tagged according to an encod-ing format.
a router adapted to generate a goodbye notification packet to inform one or more of the neighbors to destroy the adjacencies, the goodbye notification packet hav-ing a packet header with an appended goodbye attribute tagged according to an encod-ing format.
2. The system of Claim 1 wherein the goodbye attribute comprises:
a goodbye type; and a list of neighbor (peer) identifiers (IDs), wherein each neighbor identified by a peer ID on the list destroys its adjacency with the router.
a goodbye type; and a list of neighbor (peer) identifiers (IDs), wherein each neighbor identified by a peer ID on the list destroys its adjacency with the router.
3. The system of Claim 2 wherein the muter is an enhanced interior gateway routing protocol (EIGRP) router configured to run an EIGRP routing protocol process.
4. The system of Claim 3 wherein the EIGRP routing protocol process comprises a neighbor discovery process configured to construct the goodbye notification packet.
5. The system of Claim 2 wherein the router comprises:
a multi-access interface with circuitry that connects the router to a shared media computer network; and a point-to-point interface with circuitry that connects the router to a point-to-point computer network connection.
a multi-access interface with circuitry that connects the router to a shared media computer network; and a point-to-point interface with circuitry that connects the router to a point-to-point computer network connection.
6. The system of Claim 5 wherein the multi-access interface enables use of the good-bye notification packet as an unreliable message in an unreliable environment to notify a subset of neighbors to destroy their adjacencies with the router.
7. The system of Claim 6 wherein the subset of neighbors is notified through the list of peer IDs.
8. The system of Claim 5 wherein the point-to-point interface enables use of the good-bye notification packet as a reliable message in a reliable environment to notify a single neighbor to destroy its adjacency with the router.
9. The system of Claim 8 wherein the single neighbor is notified through the list of peer IDs.
10. A method for notifying neighbors when destroying adjacencies in a computer net-work, the method comprising the steps of:
sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute;
examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, destroying the adjacency with the router.
sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute;
examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, destroying the adjacency with the router.
11. The method of Claim 10 wherein the step of examining comprises the step of ex-amining a type of the goodbye attribute to determine if the neighbor is configured to understand that type of information.
12. The method of Claim 11 further comprising the step of, if the neighbor is not con-figured to understand the goodbye attribute, skipping over a value field of the goodbye attribute.
13. The method of Claim 12 wherein the neighbors are routers configured to run an Enhanced Interior Gateway Routing Protocol (EIGRP).
14. A system configured to notify neighbors when destroying adjacencies in a com-puter network, the system comprising:
a router configured to run an enhanced interior gateway routing protocol (EIGRP) to generate a goodbye notification packet to inform one or more of the neigh-bors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute having a predetermined goodbye type and a list of neighbor (peer) identifiers (IDs), wherein each neighbor identified by a peer ID on the list destroys its adjacency with the router.
a router configured to run an enhanced interior gateway routing protocol (EIGRP) to generate a goodbye notification packet to inform one or more of the neigh-bors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute having a predetermined goodbye type and a list of neighbor (peer) identifiers (IDs), wherein each neighbor identified by a peer ID on the list destroys its adjacency with the router.
15. Apparatus adapted to notify neighbors when destroying adjacencies in a computer network, the apparatus comprising:
means for sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notifica-tion packet having a packet header with an appended goodbye attribute;
means for examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, means for searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, means for destroying the adjacency with the router.
means for sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notifica-tion packet having a packet header with an appended goodbye attribute;
means for examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, means for searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, means for destroying the adjacency with the router.
16. The apparatus of Claim 15 wherein the means for examining comprises means for examining a type of the goodbye attribute to determine if the neighbor is configured to understand that type of information.
17. The apparatus of Claim 16 further comprising, if the neighbor is not configured to understand the goodbye attribute, means for skipping over a value field of the goodbye attribute.
18. A computer readable medium containing executable program instructions for noti-fying neighbors when destroying adjacencies in a computer network, the executable program instructions comprising program instructions for:
sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute;
examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, destroying the adjacency with the router.
sending a goodbye notification packet from a router to one or more of the neighbors to inform the neighbors to destroy the adjacencies, the goodbye notification packet having a packet header with an appended goodbye attribute;
examining the appended goodbye attribute at each neighbor;
if the neighbor is configured to understand the goodbye attribute, searching a list of peer identifiers (IDs) contained in the goodbye attribute to determine if the peer ID of the neighbor is on the list; and if the peer ID of the neighbor is on the list, destroying the adjacency with the router.
19. The computer readable medium of Claim 18 wherein the program instruction for examining comprises one or more program instructions for examining a type of the goodbye attribute to determine if the neighbor is configured to understand that type of information.
20. The computer readable medium method of Claim 19 further comprising one or more program instructions for, if the neighbor is not configured to understand the goodbye attribute, skipping over a value field of the goodbye attribute.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/465,129 US7388862B2 (en) | 2003-06-19 | 2003-06-19 | Technique for notifying EIGRP neighbors when destroying adjacencies in a computer network |
| US10/465,129 | 2003-06-19 | ||
| PCT/US2004/004615 WO2005006682A2 (en) | 2003-06-19 | 2004-02-17 | Technique for notifying eigrp neighbors when destroying adjacencies in a computer network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2521501A1 true CA2521501A1 (en) | 2005-01-20 |
| CA2521501C CA2521501C (en) | 2009-12-15 |
Family
ID=33517440
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002521501A Expired - Fee Related CA2521501C (en) | 2003-06-19 | 2004-02-17 | Technique for notifying eigrp neighbors when destroying adjacencies in a computer network |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US7388862B2 (en) |
| EP (1) | EP1634411B1 (en) |
| CN (1) | CN100484088C (en) |
| AU (1) | AU2004300837B2 (en) |
| CA (1) | CA2521501C (en) |
| WO (1) | WO2005006682A2 (en) |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9137033B2 (en) | 2003-03-18 | 2015-09-15 | Dynamic Network Services, Inc. | Methods and systems for monitoring network routing |
| US7626948B1 (en) * | 2003-09-12 | 2009-12-01 | Cisco Technology, Inc. | System and method for verifying the validity of a path in a network environment |
| US7720054B2 (en) * | 2004-03-02 | 2010-05-18 | Cisco Technology, Inc. | Router configured for outputting update messages specifying a detected attribute change of a connected active path according to a prescribed routing protocol |
| US7924726B2 (en) * | 2004-07-12 | 2011-04-12 | Cisco Technology, Inc. | Arrangement for preventing count-to-infinity in flooding distance vector routing protocols |
| EP1847071A4 (en) | 2005-01-26 | 2010-10-20 | Internet Broadcasting Corp B V | Layered multicast and fair bandwidth allocation and packet prioritization |
| US7792045B1 (en) * | 2005-08-25 | 2010-09-07 | Emc Corporation | Method and apparatus for configuration and analysis of internal network routing protocols |
| US7583672B2 (en) | 2006-04-05 | 2009-09-01 | Cisco Technology, Inc. | Techniques to support asymmetrical static/dynamic adjacency in routers |
| US7512106B2 (en) * | 2006-08-01 | 2009-03-31 | Cisco Technology, Inc. | Techniques for distributing routing information using multicasts |
| US8103870B2 (en) * | 2006-09-12 | 2012-01-24 | Foleeo, Inc. | Hive-based peer-to-peer network |
| US20080080750A1 (en) * | 2006-10-02 | 2008-04-03 | Wison Technology Corp. | Interactive wireless fingerprint recognition system |
| US20080175449A1 (en) * | 2007-01-19 | 2008-07-24 | Wison Technology Corp. | Fingerprint-based network authentication method and system thereof |
| US7821970B2 (en) * | 2007-09-26 | 2010-10-26 | Cisco Technology, Inc. | Protection of transit links in a network |
| US9319277B2 (en) * | 2007-11-14 | 2016-04-19 | At&T Intellectual Property I, L.P. | Network router employing enhanced prefix limiting |
| CN101179444B (en) * | 2007-12-11 | 2010-12-08 | 华为技术有限公司 | Configuration take-effective method, configuration system and configuration gateway |
| US8644186B1 (en) | 2008-10-03 | 2014-02-04 | Cisco Technology, Inc. | System and method for detecting loops for routing in a network environment |
| US8699368B2 (en) | 2011-07-26 | 2014-04-15 | Cisco Technology, Inc. | Link reliability metrics in communication networks |
| US8831019B2 (en) * | 2012-05-18 | 2014-09-09 | Renesys | Path reconstruction and interconnection modeling (PRIM) |
| US10439880B2 (en) * | 2014-11-05 | 2019-10-08 | Cisco Technology, Inc. | Loop-free convergence in communication networks |
| CN104598626B (en) * | 2015-02-04 | 2018-02-02 | 中国人民解放军总后勤部军事交通运输研究所 | Data modularization storage method in automatic tag identification |
| CN107688853B (en) * | 2016-08-05 | 2020-01-10 | 中科寒武纪科技股份有限公司 | Device and method for executing neural network operation |
| CN109067781B (en) * | 2018-09-18 | 2021-04-16 | 重庆金美通信有限责任公司 | Method for improving EIGRP protocol message information capacity |
| US11516320B2 (en) * | 2020-12-23 | 2022-11-29 | Itron, Inc. | Frame compatibility across network protocol versions |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2092134C (en) * | 1992-03-24 | 1998-07-21 | Anthony J. Mazzola | Distributed routing network element |
| US6038212A (en) * | 1996-12-13 | 2000-03-14 | International Business Machines Corporation | Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure |
| US5964841A (en) * | 1997-03-03 | 1999-10-12 | Cisco Technology, Inc. | Technique for handling forwarding transients with link state routing protocol |
| US6339595B1 (en) * | 1997-12-23 | 2002-01-15 | Cisco Technology, Inc. | Peer-model support for virtual private networks with potentially overlapping addresses |
| US6202114B1 (en) * | 1997-12-31 | 2001-03-13 | Cisco Technology, Inc. | Spanning tree with fast link-failure convergence |
| US6314105B1 (en) | 1998-05-19 | 2001-11-06 | Cisco Technology, Inc. | Method and apparatus for creating and dismantling a transit path in a subnetwork |
| US6512768B1 (en) * | 1999-02-26 | 2003-01-28 | Cisco Technology, Inc. | Discovery and tag space identifiers in a tag distribution protocol (TDP) |
| US6392997B1 (en) | 1999-03-16 | 2002-05-21 | Cisco Technology, Inc. | Technique for group-based routing update with limited per neighbor/adjacency customization |
| US6553423B1 (en) | 1999-05-27 | 2003-04-22 | Cisco Technology, Inc. | Method and apparatus for dynamic exchange of capabilities between adjacent/neighboring networks nodes |
| US6553412B1 (en) | 1999-09-10 | 2003-04-22 | Avantgo, Inc. | System, method, and computer program product for web content aggregation and development, and web content delivery to clients |
| JP3654158B2 (en) * | 2000-08-09 | 2005-06-02 | 日本電気株式会社 | Packet transfer path control apparatus and packet transfer path control method used therefor |
| US7035202B2 (en) * | 2001-03-16 | 2006-04-25 | Juniper Networks, Inc. | Network routing using link failure information |
| US7126921B2 (en) * | 2001-05-14 | 2006-10-24 | Tropic Networks Inc. | Packet network providing fast distribution of node related information and a method therefor |
| US6590868B2 (en) | 2001-06-02 | 2003-07-08 | Redback Networks Inc. | Method and apparatus for restart communication between network elements |
| US6931441B1 (en) * | 2001-06-29 | 2005-08-16 | Cisco Technology, Inc. | Method and apparatus for managing a network using link state information |
| FR2831743B1 (en) * | 2001-10-25 | 2004-01-30 | Cit Alcatel | IS-IS FAULT TOLERANT ROUTING SYSTEM AND CORRESPONDING METHOD |
-
2003
- 2003-06-19 US US10/465,129 patent/US7388862B2/en active Active
-
2004
- 2004-02-17 EP EP04711860.9A patent/EP1634411B1/en not_active Expired - Lifetime
- 2004-02-17 CN CNB2004800113057A patent/CN100484088C/en not_active Expired - Fee Related
- 2004-02-17 AU AU2004300837A patent/AU2004300837B2/en not_active Expired - Fee Related
- 2004-02-17 WO PCT/US2004/004615 patent/WO2005006682A2/en active Application Filing
- 2004-02-17 CA CA002521501A patent/CA2521501C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| WO2005006682A3 (en) | 2005-04-07 |
| EP1634411A2 (en) | 2006-03-15 |
| AU2004300837B2 (en) | 2009-12-03 |
| US20040258002A1 (en) | 2004-12-23 |
| CA2521501C (en) | 2009-12-15 |
| EP1634411B1 (en) | 2013-05-01 |
| CN100484088C (en) | 2009-04-29 |
| CN1792064A (en) | 2006-06-21 |
| AU2004300837A1 (en) | 2005-01-20 |
| WO2005006682A2 (en) | 2005-01-20 |
| US7388862B2 (en) | 2008-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2521501A1 (en) | Technique for notifying eigrp neighbors when destroying adjacencies in a computer network | |
| CN109963352B (en) | Network access method and device of equipment, equipment and storage medium | |
| US8699410B2 (en) | Method and apparatus for automatic sub-division of areas that flood routing information | |
| CN106572017B (en) | Sending method, receiving method and device of BIER information | |
| Min et al. | Improving construction for connected dominating set with Steiner tree in wireless sensor networks | |
| KR100513282B1 (en) | Apparatus and method for transmitting data using path MTU in ad-hoc network | |
| US7570582B1 (en) | Method and system for routing communications among computer networks | |
| CN1893434A (en) | Apis to build peer to peer messaging applications | |
| CN109729012B (en) | Unicast message transmission method and device | |
| Tarnaras et al. | SDN and ForCES based optimal network topology discovery | |
| CN102694721A (en) | Usage of masked Ethernet addresses between transparent interconnect of lots of links (trill) routing bridges | |
| EP3432527B1 (en) | Information processing method and device, and computer storage medium | |
| JPH10243010A (en) | Multi-cast communication method for mobile host | |
| EP2894812B1 (en) | Method and apparatus for establishing a virtual interface for a set of mutual-listener devices | |
| US8964741B2 (en) | Adjacency discovery through multicast and single-hop messaging | |
| CN112868214B (en) | Coordinated load transfer OAM records within packets | |
| Katz et al. | Generic application of bidirectional forwarding detection (BFD) | |
| WO2018059290A1 (en) | Parameter notification and obtaining methods and devices, and storage medium | |
| CN107294861B (en) | Multicast traffic control method and device | |
| CN101572648A (en) | Method and device for realizing broadcast in QinQ | |
| US20040105455A1 (en) | Automatic edge port and one way connectivity detection with rapid reconfiguration for shared media in spanning tree configured bridged Local Area Networks | |
| CN114448859A (en) | Supporting multiple transport options for border gateway protocol | |
| US8175106B2 (en) | Fast and automatic self-forming meshing topology to integrate with wired networks | |
| CN101478775B (en) | Detection method, system and equipment for multi-neighbor connection state | |
| CN108123871B (en) | Equivalent multipath ECMP processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20180219 |