公开(公告)号：US07515551B2

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

申请号：US11037964

申请日：2005-01-18

申请人： David Anthony Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

发明人： David Anthony Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

IPC分类号： H04L12/56 ,  H04J1/16

CPC分类号： H04L45/26 ,  H04L45/02

摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

摘要翻译： 通过在路由器处建立链路状态数据来呈现一种通过网络支持数据分组的最短路径优先（SPF）路由的方法和装置。 链路状态数据表示路由器与不同路由器之间的直接链路，并与不同节点建立邻接关系。 初始链路状态数据存储在第一路由器。 在存储初始链路状态数据之后，在第一路由器处接收到hello消息。 hello消息指示与一个网段上的不同第二路由器的直接连接。 基于初始链路状态数据，确定与第二路由器建立邻接关系是否足够有价值。 如果没有，则与第二路由器不响应于hello消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。

公开(公告)号：US20080130500A1

公开(公告)日：2008-06-05

申请号：US11565608

申请日：2006-11-30

申请人： Alvaro Retana ,  Russell White ,  David Anthony Cook ,  Yi Yang ,  Madhavi Chandra

发明人： Alvaro Retana ,  Russell White ,  David Anthony Cook ,  Yi Yang ,  Madhavi Chandra

IPC分类号： H04L12/56 ,  G08C15/00

CPC分类号： H04L12/66

摘要： In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.

摘要翻译： 在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。 从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。 确定距离测量是否超过阈值。 如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。 而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。 某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

公开(公告)号：US08009591B2

公开(公告)日：2011-08-30

申请号：US11565608

申请日：2006-11-30

申请人： Alvaro Retana ,  Russell White ,  David Anthony Cook ,  Yi Yang ,  Madhavi Chandra

发明人： Alvaro Retana ,  Russell White ,  David Anthony Cook ,  Yi Yang ,  Madhavi Chandra

IPC分类号： H04L12/28

CPC分类号： H04L12/66

摘要： In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.

摘要翻译： 在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。 从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。 确定距离测量是否超过阈值。 如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。 而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。 某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

公开(公告)号：US20060159082A1

公开(公告)日：2006-07-20

申请号：US11037964

申请日：2005-01-18

申请人： David Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

发明人： David Cook ,  Russell White ,  Alvaro Retana ,  Yi Yang ,  Madhavi Chandra ,  Abhay Roy

IPC分类号： H04L12/56 ,  H04L12/28

CPC分类号： H04L45/26 ,  H04L45/02

摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

公开(公告)号：US20080043635A1

公开(公告)日：2008-02-21

申请号：US11877104

申请日：2007-10-23

申请人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

发明人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

IPC分类号： H04L12/28

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/021 ,  H04L45/028 ,  H04L45/32

摘要： 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.

摘要翻译： 提供了一种用于在网络环境中传送分组的装置，其包括包括第一邻居列表的第一网络元件，所述第一网络元件耦合到第二网络元件和第三网络元件。 第一网络元件可操作以从第二网络元件接收第二邻居列表，并从第三网络元件接收第三邻居列表。 当与第一邻居列表相比较时，第一网络元件还可操作以确定由第二和第三邻居列表提供的一个或多个重叠，第一网络元件基于一个或多个重叠中继其接收的更新。

公开(公告)号：US20080095169A1

公开(公告)日：2008-04-24

申请号：US11963003

申请日：2007-12-21

申请人： Madhavi Chandra ,  David Cook ,  Alvaro Retana ,  Russell White ,  Yi Yang

发明人： Madhavi Chandra ,  David Cook ,  Alvaro Retana ,  Russell White ,  Yi Yang

IPC分类号： H04L12/56

CPC分类号： H04L45/02 ,  H04L45/26 ,  H04W40/248

摘要： A method for communicating packets in a network environment is provided that includes receiving a packet at a network element and identifying a sequence number included in the packet that correlates to awareness information associated with one or more adjacent network elements. A table included in the network element may be updated in order to account for the awareness information included within the packet that has not been accounted for by the network element. In cases where the awareness information included in the packet has already been accounted for, the packet may be ignored.

摘要翻译： 提供了一种用于在网络环境中传送分组的方法，包括在网络元件处接收分组，并且识别与包含在与一个或多个相邻网络元素相关联的识别信息相关联的分组中的序列号。 可以更新包括在网络元件中的表，以便考虑包含在网络元件尚未被考虑的分组内的识别信息。 在分组中包含的识别信息已经被考虑的情况下，分组可以被忽略。

公开(公告)号：US20050160179A1

公开(公告)日：2005-07-21

申请号：US10762856

申请日：2004-01-21

申请人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

发明人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

IPC分类号： G06F15/173 ,  H04L12/56

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/021 ,  H04L45/028 ,  H04L45/32

摘要： 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.

摘要翻译： 提供了一种用于在网络环境中传送分组的装置，其包括包括第一邻居列表的第一网络元件，所述第一网络元件耦合到第二网络元件和第三网络元件。 第一网络元件可操作以从第二网络元件接收第二邻居列表，并从第三网络元件接收第三邻居列表。 当与第一邻居列表相比较时，第一网络元件还可操作以确定由第二和第三邻居列表提供的一个或多个重叠，第一网络元件基于一个或多个重叠中继其接收的更新。

公开(公告)号：US20050018667A1

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

申请号：US10625994

申请日：2003-07-24

申请人： Madhavi Chandra ,  David Cook ,  Alvaro Retana ,  Russell White ,  Yi Yang

发明人： Madhavi Chandra ,  David Cook ,  Alvaro Retana ,  Russell White ,  Yi Yang

IPC分类号： G06F20060101 ,  H04L12/56

CPC分类号： H04L45/02 ,  H04L45/26 ,  H04W40/248

摘要： A method for communicating packets in a network environment is provided that includes receiving a packet at a network element and identifying a sequence number included in the packet that correlates to awareness information associated with one or more adjacent network elements. A table included in the network element may be updated in order to account for the awareness information included within the packet that has not been accounted for by the network element. In cases where the awareness information included in the packet has already been accounted for, the packet may be ignored.

摘要翻译： 提供了一种用于在网络环境中传送分组的方法，包括在网络元件处接收分组并且识别与包含在与一个或多个相邻网络元素相关联的识别信息相关联的分组中的序列号。 可以更新包括在网络元件中的表，以便考虑包含在网络元件尚未被考虑的分组内的识别信息。 在分组中包含的识别信息已经被考虑的情况下，分组可以被忽略。

公开(公告)号：US07333501B2

公开(公告)日：2008-02-19

申请号：US11036728

申请日：2005-01-14

申请人： David Anthony Cook ,  Russell White ,  Alvaro Retana

发明人： David Anthony Cook ,  Russell White ,  Alvaro Retana

IPC分类号： H04L12/28

CPC分类号： H04L45/586 ,  H04L45/04 ,  H04L45/46

摘要： A method and apparatus are presented for determining network nodes for aggregating addresses in routing information used for routing data packets over a network. Link data and reachability data are received. Link data indicates direct links between each of multiple candidate routers of a network and a different router or a network segment. Reachability data indicates a set of one or more contiguous network addresses that can be reached on each link described in the link data. A measure of possible aggregation of contiguous network addresses is determined at the candidate routers based on the link data and the reachability data. A preferred router to aggregate addresses in routing information sent between routers in the network is determined among the candidate routers based on the measure of possible aggregation at each candidate router.

摘要翻译： 提出了一种方法和装置，用于确定网络节点，用于聚合用于通过网络路由数据分组的路由信息​​中的地址。 接收到链接数据和可达性数据。 链路数据表示网络的多个候选路由器和不同路由器或网段之间的每个候选路由器之间的直接链路。 可达性数据表示在链接数据中描述的每个链路上可以达到的一组或多个连续网络地址的集合。 基于链路数据和可达性数据，在候选路由器处确定连续网络地址的可能聚合的度量。 基于每个候选路由器可能聚合的测量，在候选路由器之间确定在网络中的路由器之间发送的路由信息​​中聚合地址的优选路由器。

公开(公告)号：US07940776B2

公开(公告)日：2011-05-10

申请号：US11762547

申请日：2007-06-13

申请人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

发明人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

IPC分类号： H04L12/56

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/026 ,  H04L45/58

摘要： In one embodiment, a method includes sending an adjacency discovery message 1 from a local router over a direct link to a first neighbor router. An adjacency discovery message is not forwarded and includes a repair address. The repair address indicates the local router but is not advertised as reachable over the direct link. An outbound routing update message is sent to a different second neighbor router. The outbound routing update message is forwarded and includes reachability data that indicates the repair address is reachable. A payload of an inbound tunneled packet received at the local router and directed to the repair address is forwarded based on a destination indicated in the payload.

摘要翻译： 在一个实施例中，一种方法包括通过到第一邻居路由器的直接链路从本地路由器发送邻接发现消息1。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器，但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发，并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地，转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。