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

1. 发明授权

US08964566B2 Creating balanced link-disjoint topologies in a computer network 有权
标题翻译：在计算机网络中创建平衡的链路 - 不相交拓扑
公开(公告)号：US08964566B2
公开(公告)日：2015-02-24
申请号：US12859692
申请日：2010-08-19
申请人： Russell White , Ian Michael Charles Shand
发明人： Russell White , Ian Michael Charles Shand
IPC分类号： H04L12/26 , H04L12/703 , H04L12/751 , H04L12/735 , H04L12/721 , H04L12/715
CPC分类号： H04L45/28 , H04L45/02 , H04L45/1283 , H04L45/34 , H04L45/64
摘要： In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.
摘要翻译：在一个实施例中，计算机网络中的每个节点通过其每个邻居来确定回节点的最短循环环。然后可以将这些环中的每一个以特定方向标记，确保与另一个环共享链接的任何环以这样的方式被标记，使得共享链路在共享链路的每个环中处于相同的方向。在特定方向上标记的链接可以存储为第一拓扑的一部分。相反，链路上相反的方向（例如，双向链路或并行单向链路）可以被存储为与第一拓扑链接不相交的第二拓扑。

2. 发明授权

US08699410B2 Method and apparatus for automatic sub-division of areas that flood routing information 有权
标题翻译：自动划分洪水路由信息区域的方法和装置
公开(公告)号：US08699410B2
公开(公告)日：2014-04-15
申请号：US12560890
申请日：2009-09-16
申请人： Alvaro Retana , Russell White
发明人： Alvaro Retana , Russell White
IPC分类号： H04W4/00
CPC分类号： H04L45/32 , H04L45/04 , H04L45/20 , H04W40/248
摘要： Techniques for sharing routing information over a network include determining whether the scale of a flooding domain exceeds a threshold. If so, then a router announcement message is sent over a particular link. The message indicates the local router is a flooding domain border router (FDBR). Summary routing information is determined with less than a certain level of detail used in the flooding domain for routers connected to the local router through links different from the particular link. The summary routing information is sent over the particular link in a link state message that includes type data that indicates summary routing information that crosses a FDBR. These techniques allow automatic favorable scaling of domains of shared routing information as the size of a mobile ad hoc network grows.
摘要翻译：通过网络共享路由信息的技术包括确定洪泛域的规模是否超过阈值。如果是，则通过特定链路发送路由器通告消息。该消息表示本地路由器是泛洪域边界路由器（FDBR）。对于通过不同于特定链路的链路连接到本地路由器的路由器的洪泛域中，小于一定程度的细节来确定汇总路由信息。汇总路由信息通过链路状态消息中的特定链路发送，该链路状态消息包括指示跨越FDBR的汇总路由信息的类型数据。随着移动自组织网络规模的扩大，这些技术允许自动优化共享路由信息域的扩展。

3. 发明授权

US07889655B2 Techniques for detecting loop-free paths that cross routing information boundaries 有权
标题翻译：用于检测交叉路由信息边界的无环路径的技术
公开(公告)号：US07889655B2
公开(公告)日：2011-02-15
申请号：US11333221
申请日：2006-01-17
申请人： Alvaro Retana , Russell White , Abhay Roy , Sina Mirtorabi
发明人： Alvaro Retana , Russell White , Abhay Roy , Sina Mirtorabi
IPC分类号： G06F11/07
CPC分类号： H04L45/18 , H04L45/00 , H04L45/04
摘要： Techniques for detecting loops in routes that cross route information boundaries include receiving a control message at a first edge node on one side of the boundary that is connected to a different second edge node on another side of the boundary. The control message indicates a particular network address of a particular node that is reachable from the first edge node. Distinguisher data is determined that indicates if a node in the first collection can reach the first edge node without leaving the first collection. An advertising message is sent from the first edge node to the second edge node that includes route data that indicates the particular network address and the distinguisher data. Based on the distinguisher data, a testing edge node in the first collection can determine whether there is a loop comprising both an internal path and an external path to the first edge node.
摘要翻译：用于检测跨越路由信息边界的路由中的循环的技术包括：在边界的一侧上的第一边缘节点处接收控制消息，所述控制消息连接到边界的另一侧上的不同的第二边缘节点。控制消息指示可从第一边缘节点到达的特定节点的特定网络地址。确定识别器数据，其指示第一集合中的节点是否可以到达第一边缘节点而不离开第一集合。广告消息从第一边缘节点发送到第二边缘节点，其包括指示特定网络地址和识别器数据的路由数据。基于识别器数据，第一集合中的测试边缘节点可以确定是否存在包括内部路径和到第一边缘节点的外部路径的环路。

4. 发明授权

US07782858B2 Validating internal routing protocol information passed through an external routing protocol 有权
标题翻译：验证通过外部路由协议传递的内部路由协议信息
公开(公告)号：US07782858B2
公开(公告)日：2010-08-24
申请号：US11696708
申请日：2007-04-04
申请人： Russell White , James Ng , Alvaro Retana , Brian Weis
发明人： Russell White , James Ng , Alvaro Retana , Brian Weis
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/50 , H04L45/04
摘要： In one embodiment, a method includes receiving authenticated site data that includes site ID data and address data. The site ID data indicates a unique site ID for each site among multiple sites for a first network that uses an internal routing protocol. Multiple edge sites of those sites are separate from each other and connected to a second network that is under separate administrative control of at least one different party. The address data indicates network addresses associated with each site of the plurality of sites. An external routing protocol message is discounted based on the authenticated site data.
摘要翻译：在一个实施例中，一种方法包括接收包括站点ID数据和地址数据的认证站点数据。站点ID数据指示使用内部路由协议的第一个网络的多个站点中每个站点的唯一站点ID。这些站点的多个边缘站点彼此分离并连接到处于至少一个不同方的单独管理控制下的第二网络。地址数据指示与多个站点中的每个站点相关联的网络地址。外部路由协议消息基于认证的站点数据进行打折。

5. 发明授权

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.
摘要翻译：在分组交换通信网络中发送数据的技术包括确定网络的相邻网络节点的多个子集。相邻的网络节点通过特定网络节点上的接口与特定的网络节点通信而无需中间网络节点。每个子集包括多个相邻的网络节点。子集定义数据通过接口发送。子集定义数据指示哪些相邻网络节点属于哪个子集。通过在通过接口发送的多播数据分组中包括指示特定子集的子集标识符数据，包括在所有子集中比所有相邻网络节点少的数据。当节点接收到这样的数据时，除非子集标识符与接收节点的子集标识符相匹配，否则丢弃该数据。除此之外，这使得路由消息更有效地发送到更好地执行的相邻网络节点。

6. 发明申请

US20090196181A1 TECHNIQUE TO AUTOMATICALLY DEAGGREGATE AN OPTIMUM SET TO PREVENT SUBOPTIMAL ROUTING OR ROUTING FAILURES WITHIN A LINK STATE FLOODING DOMAIN 有权
标题翻译：自动消除最佳设置的技术，以防止链接状态下的不正确路由或路由失败
公开(公告)号：US20090196181A1
公开(公告)日：2009-08-06
申请号：US12026158
申请日：2008-02-05
申请人： Alvaro E. Retana , Timothy M. Gage , Russell White
发明人： Alvaro E. Retana , Timothy M. Gage , Russell White
IPC分类号： H04L12/26
CPC分类号： H04L45/026 , H04L45/02
摘要： In one embodiment, information is signaled between aggregating routers indicating the components of aggregated addresses. This information is used to dynamically leak, or deaggregate, specific parts of the aggregated address space to reduce sub-optimal routing and possibly prevent routing black holes from occurring in a network.
摘要翻译：在一个实施例中，在指示聚合地址的组件的聚合路由器之间用信号通知信息。该信息用于动态泄漏或解除聚合地址空间的特定部分，以减少次优路由，并可能防止在网络中发生黑洞。

7. 发明申请

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消息，发送包含来自标识符池的不同的第二标识符的第二响应消息。

8. 发明申请

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.
摘要翻译：在一个实施例中，一种方法包括接收通告的成本以从邻居路由器到达目的地地址。基于广告费用，确定从本地路由器通过邻居到达目的地地址的最小首要成本。第一个成本对应于邻居之间的继任者。还确定了广告成本的最低二次成本，不包括继承人的广告费用。第二个成本对应于第二个路由器。如果确定与后继者的通信中断，并且第二成本不低于第一成本，则确定第二成本是否等于第一成本。如果是这样，那么指向目的地址并且从与第二路由器不同的邻居接收到的数据分组被转发到第二路由器。

9. 发明申请

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

10. 发明申请

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.
摘要翻译：用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。如果确定与相邻路由器的路由表数据的单向传输满足条件，则从启动路由器向相邻路由器发送刷新通知消息。刷新通知消息包括指示用于传送路由表数据的特定方向的数据。如果特定方向是入站的，则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。如果特定方向是出站的，则发送自己的路由表的副本而不接收相邻路由表的副本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式