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

11. 发明申请

US20090141651A1 DETERMINING AN OPTIMAL ROUTE ADVERTISEMENT IN A REACTIVE ROUTING ENVIRONMENT 有权
标题翻译：在反应性路由环境中确定最佳路由广告
公开(公告)号：US20090141651A1
公开(公告)日：2009-06-04
申请号：US11949561
申请日：2007-12-03
申请人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
发明人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
IPC分类号： H04L12/28
CPC分类号： H04L12/28 , H04L45/00 , H04L45/02
摘要： In an example embodiment, a method is provided. In this method, a network address query is received. A first network address of a known apparatus is retrieved from a routing table, in response to the network address query. A second network address may be determined based upon the network address query, the second network address having a smaller bit length than the first network address. An aggregate value may be advertised that represents a range of reachable network addresses, the range of reachable network addresses including the second network address.
摘要翻译：在示例实施例中，提供了一种方法。在该方法中，接收到网络地址查询。响应于网络地址查询，从路由表中检索已知设备的第一网络地址。可以基于网络地址查询确定第二网络地址，第二网络地址具有比第一网络地址更小的比特长度。可以公布聚合值，其表示可达网络地址的范围，可达网络地址的范围，包括第二网络地址。

12. 发明申请

US20090080436A1 Protection of Transit Links in a Network 有权
标题翻译：保护网络中的传输链路
公开(公告)号：US20090080436A1
公开(公告)日：2009-03-26
申请号：US11862161
申请日：2007-09-26
申请人： Russell White , James L. Ng , Donnie V. Savage
发明人： Russell White , James L. Ng , Donnie V. Savage
IPC分类号： H04L12/28
CPC分类号： H04L45/02 , H04L45/025
摘要： A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.
摘要翻译：路由器识别过境链路和非过境链路。只有非转接链路作为到相邻路由器的路由通告，从而保护转接链路免受终止于其中一个转接链路上的网络上的边缘业务。在本发明的另一方面，管理白名单补充标识中继链路网络路由的路由。在本发明的另一方面，广告路由的方法将路由器表中的条目标识为广播或点到点。仅通告不用于相邻路由器的不转发或广播链路的路由器表条目，而点对点转接链路或广播转发链路则作为传输链路通告，如果管理白名单启用。

13. 发明授权

US07821970B2 Protection of transit links in a network 有权
标题翻译：保护网络中的中转链路
公开(公告)号：US07821970B2
公开(公告)日：2010-10-26
申请号：US11862161
申请日：2007-09-26
申请人： Russell White , James L. Ng , Donnie V. Savage
发明人： Russell White , James L. Ng , Donnie V. Savage
IPC分类号： H04L1/00 , H04L12/26
CPC分类号： H04L45/02 , H04L45/025
摘要： A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.
摘要翻译：路由器识别过境链路和非过境链路。只有非转接链路作为到相邻路由器的路由通告，从而保护转接链路免受终止于其中一个转接链路上的网络上的边缘业务。在本发明的另一方面，管理白名单补充标识中继链路网络路由的路由。在本发明的另一方面，广告路由的方法将路由器表中的条目标识为广播或点到点。仅通告不用于相邻路由器的不转发或广播链路的路由器表条目，而点对点转接链路或广播转发链路则作为传输链路通告，如果管理白名单启用。

14. 发明授权

US07467226B2 Method and apparatus for flooding link state packets to achieve faster convergence 有权
标题翻译：用于洪泛链路状态分组以实现更快收敛的方法和装置
公开(公告)号：US07467226B2
公开(公告)日：2008-12-16
申请号：US10959707
申请日：2004-10-05
申请人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
发明人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
IPC分类号： H04L12/56
CPC分类号： H04L45/02 , H04L45/32
摘要： Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node, and these other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.
摘要翻译：公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没。也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。然后，第一节点发送与先前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP，并且这些另外的LSP由第一节点以与其相关的顺序发送到另一个LSP接收节点与从先到先发送其他LSP到第一节点的其他LSP发送节点的第一节点到每个其他LSP发送节点的路径相关的相对成本。

15. 发明授权

US07805537B2 Method and apparatus for flooding link state packets to achieve faster convergence 有权
标题翻译：用于洪泛链路状态分组以实现更快收敛的方法和装置
公开(公告)号：US07805537B2
公开(公告)日：2010-09-28
申请号：US12332713
申请日：2008-12-11
申请人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
发明人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
IPC分类号： H04L12/56
CPC分类号： H04L45/02 , H04L45/32
摘要： Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node. These other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.
摘要翻译：公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没。也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。第一节点然后发送与之前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP。这些其他LSP由第一节点发送到另一个LSP接收节点，其顺序是与先前已经将另一个LSP发送到第一节点的从第一节点到其他LSP发送节点的路径相关联的相对成本相关的顺序。

16. 发明授权

US08705539B2 Determining a route advertisement in a reactive routing environment 有权
标题翻译：确定反应路由环境中的路由通告
公开(公告)号：US08705539B2
公开(公告)日：2014-04-22
申请号：US13345003
申请日：2012-01-06
申请人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
发明人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
IPC分类号： H04L12/28 , H04L12/56 , G06F15/177 , G06F15/173
CPC分类号： H04L12/28 , H04L45/00 , H04L45/02
摘要： In an example embodiment, a method and system is provided to determine and advertise a route advertisement in a reactive routing environment. In response to receiving a network address query with respect to a destination address at a routing device, an aggregate value, e.g. an address prefix, is determined and advertised in reply to the network address query. Determining of the aggregate value may comprise identifying within a range of network addresses represented by the aggregate value respective addresses for which the routing device does not have reachability information. The routing device may send address queries with respect to the identified addresses, to determine reachability via the routing device of those addresses. The aggregate value may be advertised conditional upon determining that a percentage of addresses within the corresponding range that can be reached via the routing device satisfies a predefined minimal coverage value.
摘要翻译：在示例实施例中，提供了一种方法和系统来确定和通告在反应式路由环境中的路由通告。响应于在路由设备处接收到关于目的地地址的网络地址查询，例如聚合值。确定地址前缀，并回复网络地址查询。确定聚合值可以包括在由路由设备不具有可达性信息的聚合值相应地址表示的网络地址范围内的识别。路由设备可以相对于所识别的地址发送地址查询，以通过路由设备确定那些地址的可达性。可以在确定可以通过路由设备到达的相应范围内的地址百分比满足预定义的最小覆盖值的情况下，将聚合值通告为有条件的。

17. 发明授权

US08121130B2 Determining an optimal route advertisement in a reactive routing environment 有权
标题翻译：确定反应路由环境中的最优路由通告
公开(公告)号：US08121130B2
公开(公告)日：2012-02-21
申请号：US11949561
申请日：2007-12-03
申请人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
发明人： Russell I. White , Steven Edward Moore , James L. Ng , Alvaro Enrique Retana
IPC分类号： H04L12/28 , H04L12/56 , G06F15/177 , G06F15/173
CPC分类号： H04L12/28 , H04L45/00 , H04L45/02
摘要： In an example embodiment, a method is provided. In this method, a network address query is received. A first network address of a known apparatus is retrieved from a routing table, in response to the network address query. A second network address may be determined based upon the network address query, the second network address having a smaller bit length than the first network address. An aggregate value may be advertised that represents a range of reachable network addresses, the range of reachable network addresses including the second network address.
摘要翻译：在示例实施例中，提供了一种方法。在该方法中，接收到网络地址查询。响应于网络地址查询，从路由表中检索已知设备的第一网络地址。可以基于网络地址查询确定第二网络地址，第二网络地址具有比第一网络地址更小的位长度。可以公布聚合值，其表示可达网络地址的范围，可达网络地址的范围，包括第二网络地址。

18. 发明申请

US20090092052A1 METHOD AND APPARATUS FOR FLOODING LINK STATE PACKETS TO ACHIEVE FASTER CONVERGENCE 有权
标题翻译：链接状态包的方法和装置实现更快的融合
公开(公告)号：US20090092052A1
公开(公告)日：2009-04-09
申请号：US12332713
申请日：2008-12-11
申请人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
发明人： Steven V. Luong , Heidi H. Ou , Gerald Redwine , James L. Ng , Kevin M. Eckhardt , Scott R. Sturgess , Steven Moore
IPC分类号： H04L12/26
CPC分类号： H04L45/02 , H04L45/32
摘要： Disclosed are methods and apparatus for flooding link state packets or packet data units (LSP's) from a first node to one other LSP receiving node, where the LSP's are flooded in an order that is related to relative costs of various paths emanating from the first node. That is, the first node sends its own LSP first since the first node has no cost relative to itself. The first node then sends other LSP's that are associated with a plurality of other LSP sending nodes that have previously flooded their LSP's to the first node. These other LSP's are sent by the first node to the other LSP receiving node in an order related to the relative costs associated with the paths from the first node to each of the other LSP sending nodes which had previously sent the other LSP's to the first node.
摘要翻译：公开了用于将链路状态分组或分组数据单元（LSP）从第一节点扩展到另一个LSP接收节点的方法和装置，其中LSP以与从第一节点发出的各种路径的相对成本相关的顺序淹没。也就是说，第一个节点首先发送自己的LSP，因为第一个节点相对于自身没有成本。第一节点然后发送与之前已经将其LSP扩充到第一节点的多个其他LSP发送节点相关联的其他LSP。这些其他LSP由第一节点发送到另一个LSP接收节点，其顺序是与先前已经将另一个LSP发送到第一节点的从第一节点到其他LSP发送节点的路径相关联的相对成本相关的顺序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式