公开(公告)号：WO2005006682A2

公开(公告)日：2005-01-20

申请号：PCT/US2004/004615

申请日：2004-02-17

Applicant: CISCO TECHNOLOGIES, INC.

Inventor： VAN TRAN, Thuan ,  SAVAGE, Donnie, V. ,  SLICE, Donald

IPC: H04L12/56

CPC classification number: H04L45/02 ,  H04L45/026

Abstract: A technique efficiently notifies EIGRP neighbors when destroying adjacencies in a computer network. A goodbye notification packet is provided that enables an EIGRP router to inform one or more of its neighbors of its intention to destroy their existing adjacencies. The goodbye notification packet comprises 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 conventional 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.

Abstract translation: 当破坏计算机网络中的邻接关系时，技术有效地通知EIGRP邻居。 提供了一个再见通知包，使得EIGRP路由器能够通知一个或多个邻居意图破坏其现有邻接。 再说通知分组包括具有实施为附加再见属性的可变长度字段的EIGRP分组报头。 附加的再见属性根据TLV编码格式被示意性地标记，TLV编码格式定义了具有预定类型的称为“再见”的新类型（T）字段，该预定类型将其与传统的EIGRP Hello数据包区分开。 在再见属性中传送的信息的值（V）字段包含邻居（对等体）标识符（ID）的列表。 此列表上的对等体ID指示这些邻居路由器“离开”，以使其邻接能够被破坏。

公开(公告)号：EP2047642A2

公开(公告)日：2009-04-15

申请号：EP07758765.7

申请日：2007-03-17

Applicant: Cisco Technologies, Inc.

Inventor： VAN TRAN, Thuan ,  SAVAGE, Donnie, Van ,  SLICE, Donald

IPC: H04L12/56

CPC classification number: H04L45/16 ,  H04L1/1607 ,  H04L12/18 ,  H04L45/02 ,  H04L45/026 ,  H04L45/54 ,  H04L2001/0093

Abstract: Techniques for sending routing data include sending first routing data in a first multicast packet to a number N of adjacent nodes. It is determined whether different routing data (410) is ready to be sent in a different multicast packet (430). If so, then a number M of adjacent nodes from which acknowledgment messages (440) have been received, and whether M (450) exceeds a threshold, is determined. If so, then a Conditional-Receive (CR) method is invoked in which a multicast message is sent which identifies each of a number L = N-M of laggard adjacent nodes. The laggard adjacent nodes are thus notified to ignore the different multicast packet. If it is determined that M does not exceed the threshold, then additional acknowledgement messages are received while waiting until M does exceed the threshold before the CR method is invoked (460). The threshold (402) is greater than or equal to 1.