专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07924726B2 Arrangement for preventing count-to-infinity in flooding distance vector routing protocols 有权
标题翻译：用于防止洪泛距离矢量路由协议中的无穷大的排列
公开(公告)号：US07924726B2
公开(公告)日：2011-04-12
申请号：US10887919
申请日：2004-07-12
申请人： Russell Ivan White , David Anthony Cook , Alvaro Enrique Retana
发明人： Russell Ivan White , David Anthony Cook , Alvaro Enrique Retana
IPC分类号： G01R31/08
CPC分类号： H04W40/246 , H04L45/02 , H04L45/32 , H04L45/54 , H04W40/02 , H04W84/18
摘要： Each router in a network is configured for generating router advertisement messages according to a flooding distance vector routing protocol. Each router advertisement message output according to the flooding distance vector routing protocol includes reachability information for at least one destination, and an originating router identifier indicating a router having originated the reachability information. If any router receiving the router advertisement message detects a match between the originating router identifier and the corresponding assigned router identifier, the received router advertisement message is disregarded during calculation of the best paths from the network. If the originating router identifier identifies another router, the router floods the received router advertisement message to other ports, and output its own router advertisement message based on the received router advertisement message and that specifies the originating router identifier from the received router advertisement message.
摘要翻译：网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息，以及指示已经发起可达性信息的路由器的始发路由器标识符。如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配，则在从网络计算最佳路径期间忽略接收到的路由器通告消息。如果始发路由器标识符识别另一个路由器，则路由器将接收的路由器通告消息洪泛到其他端口，并根据接收到的路由器通告消息输出自己的路由器通告消息，并从接收到的路由器通告消息中指定始发路由器标识符。

2. 发明授权

US08009591B2 Automatic overlapping areas that flood routing information 有权
标题翻译：自动重叠区域，洪泛路由信息
公开(公告)号：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.
摘要翻译：在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。确定距离测量是否超过阈值。如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

3. 发明授权

US07515551B2 Techniques for reducing adjacencies in a link-state network routing protocol 有权
标题翻译：降低链路状态网络路由协议邻接度的技术
公开(公告)号：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消息建立邻接关系。基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。

4. 发明申请

US20080130500A1 Automatic Overlapping Areas that Flood Routing Information 有权
标题翻译：自动重叠区域洪水路由信息
公开(公告)号：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.
摘要翻译：在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。确定距离测量是否超过阈值。如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

5. 发明授权

US07634554B2 TTL exploration technique for determining capabilities and configuration of a peer router 有权
标题翻译：用于确定对等路由器的能力和配置的TTL探测技术
公开(公告)号：US07634554B2
公开(公告)日：2009-12-15
申请号：US10665805
申请日：2003-09-18
申请人： David Anthony Cook
发明人： David Anthony Cook
IPC分类号： G06F15/177 , G06F15/173
CPC分类号： H04L63/0428 , H04L29/06 , H04L45/04 , H04L45/60 , H04L63/08 , H04L69/24
摘要： An exploration technique allows a router to efficiently determine capabilities and configuration of a neighbor (peer) router. In addition, the technique enables peer routers of an adjacency to negotiate a capability “outside” of a protocol, such as a routing protocol, before a routing session is established between the routers. In this context, the term “outside” of the protocol denotes that there is no field within a protocol packet (message) implementation that can be used to negotiate the capability. Moreover, the inventive technique obviates the need to manually configure a router to support a particular capability and interoperate correctly within a network of routers that both support and are unaware of the capability.
摘要翻译：探索技术允许路由器有效地确定邻居（对等）路由器的能力和配置。此外，在路由器之间建立路由会话之前，该技术使得邻接的对等路由器能够协商诸如路由协议之类的协议的“外部”能力。在这种情况下，协议中的“外部”一词表示协议包（消息）实现中没有可用于协商能力的字段。此外，本发明的技术避免了手动配置路由器以支持特定能力并且在支持并且不知道能力的路由器的网络内正确地互操作的需要。

6. 发明授权

US07333501B2 Techniques for determining network nodes to represent, multiple subnetworks for a routing protocol 有权
标题翻译：用于确定网络节点来表示路由协议的多个子网络的技术
公开(公告)号：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.
摘要翻译：提出了一种方法和装置，用于确定网络节点，用于聚合用于通过网络路由数据分组的路由信息中的地址。接收到链接数据和可达性数据。链路数据表示网络的多个候选路由器和不同路由器或网段之间的每个候选路由器之间的直接链路。可达性数据表示在链接数据中描述的每个链路上可以达到的一组或多个连续网络地址的集合。基于链路数据和可达性数据，在候选路由器处确定连续网络地址的可能聚合的度量。基于每个候选路由器可能聚合的测量，在候选路由器之间确定在网络中的路由器之间发送的路由信息中聚合地址的优选路由器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式