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

1. 发明申请

US20080212585A1 Preventing Loops during Recovery in Network Rings Using Cost Metric Routing Protocol 审中-公开
标题翻译：使用成本计量路由协议在网络环中恢复期间预防环路
公开(公告)号：US20080212585A1
公开(公告)日：2008-09-04
申请号：US11681001
申请日：2007-03-01
申请人： Russell White , Steven Moore , James Ng , Yi Yang
发明人： Russell White , Steven Moore , James Ng , Yi Yang
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/00 , H04L45/02
摘要： In one embodiment, a method includes receiving advertised costs to reach a destination address from neighbor routers. Based on the advertised costs, a minimum first cost to reach the destination address from the local router through the neighbors is determined. The first cost corresponds to a successor among the neighbors. Also determined is a minimum second cost of the advertised costs excluding only an advertised cost from the successor. The second cost corresponds to a second router. If it is determined that communication with the successor is interrupted, and the second cost is not less than the first cost, then it is determined whether the second cost is equal to the first cost. If so, then a data packet, which is directed to the destination address and received from a neighbor that is different from the second router, is forwarded to the second router.
摘要翻译：在一个实施例中，一种方法包括接收通告的成本以从邻居路由器到达目的地地址。基于广告费用，确定从本地路由器通过邻居到达目的地地址的最小首要成本。第一个成本对应于邻居之间的继任者。还确定了广告成本的最低二次成本，不包括继承人的广告费用。第二个成本对应于第二个路由器。如果确定与后继者的通信中断，并且第二成本不低于第一成本，则确定第二成本是否等于第一成本。如果是这样，那么指向目的地址并且从与第二路由器不同的邻居接收到的数据分组被转发到第二路由器。

2. 发明授权

US07768995B2 Techniques for one-way synchronization of routing information among intermediate nodes 有权
标题翻译：中间节点之间路由信息单向同步的技术
公开(公告)号：US07768995B2
公开(公告)日：2010-08-03
申请号：US11497224
申请日：2006-08-01
申请人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
发明人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/02 , H04L45/021
摘要： Techniques for synchronizing routing data include determining whether conditions are satisfied for one-way transfer with an adjacent router. If it is determined that conditions are satisfied for one-way transfer of routing table data with the adjacent router, then a refresh-notice message is sent from the initiating router to the adjacent router. The refresh-notice message includes data that indicates a particular direction for transfer of routing table data. If the particular direction is inbound, then a copy of an adjacent routing table is received without sending a copy of the initiating router's own routing table. If the particular direction is outbound, then a copy of the own routing table is sent without receiving a copy of the adjacent routing table.
摘要翻译：用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。如果确定与相邻路由器的路由表数据的单向传输满足条件，则从启动路由器向相邻路由器发送刷新通知消息。刷新通知消息包括指示用于传送路由表数据的特定方向的数据。如果特定方向是入站的，则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。如果特定方向是出站的，则发送自己的路由表的副本而不接收相邻路由表的副本。

3. 发明申请

US20080259820A1 Creating Non-transit Nodes in a Link State Network 有权
标题翻译：在链路状态网络中创建非转接节点
公开(公告)号：US20080259820A1
公开(公告)日：2008-10-23
申请号：US11736563
申请日：2007-04-17
申请人： Russell White , Yi Yang , James Ng
发明人： Russell White , Yi Yang , James Ng
IPC分类号： H04L12/28
CPC分类号： H04L45/026 , H04L45/02
摘要： In one embodiment, a method includes receiving a first link state initiation (HELLO) message from a first neighboring router. The HELLO message requests that a recipient node send a unique identifier for itself in a link state routing protocol. In response to receiving the first HELLO message, a first response message is sent that includes a first identifier from an identifier pool. The identifier pool contains for a local node a plurality of network identifiers that are unique among all nodes in the network that uses the link state routing protocol. A second HELLO message is received from a different second neighboring router. In response to receiving the second HELLO message, a second response message is sent that includes a different second identifier from the identifier pool.
摘要翻译：在一个实施例中，一种方法包括从第一相邻路由器接收第一链路状态发起（HELLO）消息。 HELLO消息请求接收方节点在链路状态路由协议中为其自身发送唯一的标识符。响应于接收到第一HELLO消息，发送包括来自标识符池的第一标识符的第一响应消息。标识符池为本地节点包含在网络中使用链路状态路由协议的所有节点中唯一的多个网络标识符。从不同的第二相邻路由器接收第二个HELLO消息。响应于接收到第二HELLO消息，发送包含来自标识符池的不同的第二标识符的第二响应消息。

4. 发明申请

US20080031236A1 Techniques for one-way synchronization of routing information among intermediate nodes 有权
标题翻译：中间节点之间路由信息单向同步的技术
公开(公告)号：US20080031236A1
公开(公告)日：2008-02-07
申请号：US11497224
申请日：2006-08-01
申请人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
发明人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
IPC分类号： H04L12/56
CPC分类号： H04L45/02 , H04L45/021
摘要： Techniques for synchronizing routing data include determining whether conditions are satisfied for one-way transfer with an adjacent router. If it is determined that conditions are satisfied for one-way transfer of routing table data with the adjacent router, then a refresh-notice message is sent from the initiating router to the adjacent router. The refresh-notice message includes data that indicates a particular direction for transfer of routing table data. If the particular direction is inbound, then a copy of an adjacent routing table is received without sending a copy of the initiating router's own routing table. If the particular direction is outbound, then a copy of the own routing table is sent without receiving a copy of the adjacent routing table.
摘要翻译：用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。如果确定与相邻路由器的路由表数据的单向传输满足条件，则从启动路由器向相邻路由器发送刷新通知消息。刷新通知消息包括指示用于传送路由表数据的特定方向的数据。如果特定方向是入站的，则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。如果特定方向是出站的，则发送自己的路由表的副本而不接收相邻路由表的副本。

5. 发明授权

US07796537B2 Creating non-transit nodes in a link network 有权
标题翻译：在链路网络中创建非传输节点
公开(公告)号：US07796537B2
公开(公告)日：2010-09-14
申请号：US11736563
申请日：2007-04-17
申请人： Russell White , Yi Yang , James Ng
发明人： Russell White , Yi Yang , James Ng
IPC分类号： H04L12/28 , G06F15/177
CPC分类号： H04L45/026 , H04L45/02
摘要： In one embodiment, a method includes receiving a first link state initiation (HELLO) message from a first neighboring router. The HELLO message requests that a recipient node send a unique identifier for itself in a link state routing protocol. In response to receiving the first HELLO message, a first response message is sent that includes a first identifier from an identifier pool. The identifier pool contains for a local node a plurality of network identifiers that are unique among all nodes in the network that uses the link state routing protocol. A second HELLO message is received from a different second neighboring router. In response to receiving the second HELLO message, a second response message is sent that includes a different second identifier from the identifier pool.
摘要翻译：在一个实施例中，一种方法包括从第一相邻路由器接收第一链路状态发起（HELLO）消息。 HELLO消息请求接收方节点在链路状态路由协议中为其自身发送唯一的标识符。响应于接收到第一HELLO消息，发送包括来自标识符池的第一标识符的第一响应消息。标识符池为本地节点包含在网络中使用链路状态路由协议的所有节点中唯一的多个网络标识符。从不同的第二相邻路由器接收第二个HELLO消息。响应于接收到第二HELLO消息，发送包含来自标识符池的不同的第二标识符的第二响应消息。

6. 发明授权

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消息建立邻接关系。基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。

7. 发明申请

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

8. 发明申请

US20060159082A1 Techniques for reducing adjacencies in a link-state network routing protocol 有权
公开(公告)号：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.

9. 发明授权

US07623474B2 Techniques for distributing information using multicast subsets 有权
标题翻译：使用多播子集分发信息的技术
公开(公告)号：US07623474B2
公开(公告)日：2009-11-24
申请号：US11353544
申请日：2006-02-14
申请人： Thuan Van Tran , Yi Yang , Liem Nguyen , Russell White , Donnie Van Savage
发明人： Thuan Van Tran , Yi Yang , Liem Nguyen , Russell White , Donnie Van Savage
IPC分类号： H04L12/26
CPC分类号： H04L45/16 , H04L12/1836 , H04L12/1868 , H04L12/1886 , H04L45/02 , H04L45/245
摘要： Techniques for sending data in a packet-switched communications network include determining multiple subsets of adjacent network nodes of the network. The adjacent network nodes communicate without intervening network nodes with a particular network node through an interface on the particular network node. Each subset includes multiple adjacent network nodes. Subset definition data is sent through the interface. The subset definition data indicates which adjacent network nodes belong to which subset. Data for fewer than all adjacent network nodes in all subsets are sent by including, in a multicast data packet sent over the interface with a multicast destination address, subset identifier data that indicates a particular subset. When such data is received by a node, it is discarded unless the subset identifier matches the receiving node's subset identifier. Among other effects, this allows routing messages to be more efficiently sent to better performing neighboring network nodes.
摘要翻译：在分组交换通信网络中发送数据的技术包括确定网络的相邻网络节点的多个子集。相邻的网络节点通过特定网络节点上的接口与特定的网络节点通信而无需中间网络节点。每个子集包括多个相邻的网络节点。子集定义数据通过接口发送。子集定义数据指示哪些相邻网络节点属于哪个子集。通过在通过接口发送的多播数据分组中包括指示特定子集的子集标识符数据，包括在所有子集中比所有相邻网络节点少的数据。当节点接收到这样的数据时，除非子集标识符与接收节点的子集标识符相匹配，否则丢弃该数据。除此之外，这使得路由消息更有效地发送到更好地执行的相邻网络节点。

10. 发明申请

US20080043635A1 System and Method for Controlling the Flooding of Information in a Network Environment 有权
标题翻译：控制网络环境中信息泛滥的系统和方法
公开(公告)号：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.
摘要翻译：提供了一种用于在网络环境中传送分组的装置，其包括包括第一邻居列表的第一网络元件，所述第一网络元件耦合到第二网络元件和第三网络元件。第一网络元件可操作以从第二网络元件接收第二邻居列表，并从第三网络元件接收第三邻居列表。当与第一邻居列表相比较时，第一网络元件还可操作以确定由第二和第三邻居列表提供的一个或多个重叠，第一网络元件基于一个或多个重叠中继其接收的更新。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式