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

1. 发明申请

US20120195205A1 Network Topologies for Energy Efficient Networks 有权
标题翻译：节能网络的网络拓扑
公开(公告)号：US20120195205A1
公开(公告)日：2012-08-02
申请号：US13019157
申请日：2011-02-01
申请人： Alvaro Retana , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
发明人： Alvaro Retana , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
IPC分类号： H04L12/26 , H04L12/28
CPC分类号： H04L45/123 , H04L41/12 , H04L45/125 , H04W40/08 , H04W40/246 , Y02D70/122 , Y02D70/142 , Y02D70/144 , Y02D70/146 , Y02D70/22 , Y02D70/324
摘要： One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set.
摘要翻译：一个实施例标识节点的所有一跳邻居节点和两跳邻居节点; 确定所述节点的一跳邻居节点的活动集，包括：在所述活动集中包括作为边缘节点或与至少一个两跳相邻节点连接的每个一跳邻居节点，跳邻居节点连接; 并且如果活动集尚未完成，则：确定尚未在活动集中的所有组合的一跳邻居节点; 并按照每个组合的总能量值的顺序测试每个组合，以确定特定组合是否能够完成活动集合; 如果没有组合能够完成活动集，则包括活动集中的所有一跳邻居节点; 并将消息传送到活动集中的每个一跳邻居节点，指示其在活动集中。

2. 发明授权

US08699382B2 Network topologies for energy efficient networks 有权
标题翻译：节能网络的网络拓扑
公开(公告)号：US08699382B2
公开(公告)日：2014-04-15
申请号：US13019157
申请日：2011-02-01
申请人： Alvaro Retano , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
发明人： Alvaro Retano , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
IPC分类号： H04L12/28 , H04L12/56 , H04W40/24
CPC分类号： H04L45/123 , H04L41/12 , H04L45/125 , H04W40/08 , H04W40/246 , Y02D70/122 , Y02D70/142 , Y02D70/144 , Y02D70/146 , Y02D70/22 , Y02D70/324
摘要： One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set.
摘要翻译：一个实施例标识节点的所有一跳邻居节点和两跳邻居节点; 确定所述节点的一跳邻居节点的活动集合，包括：在所述活动集合中包括作为边缘节点或与至少一个两跳相邻节点连接的每个一跳邻居节点，跳邻居节点连接; 并且如果活动集尚未完成，则：确定尚未在活动集中的一跳邻居节点的所有组合; 并按照每个组合的总能量值的顺序测试每个组合，以确定特定组合是否能够完成活动集合; 如果没有组合能够完成活动集，则包括活动集中的所有一跳邻居节点; 并将消息传送到活动集中的每个一跳邻居节点，指示其在活动集中。

3. 发明申请

US20140211662A1 Network Topologies for Energy Efficient Networks 审中-公开
标题翻译：节能网络的网络拓扑
公开(公告)号：US20140211662A1
公开(公告)日：2014-07-31
申请号：US14243510
申请日：2014-04-02
申请人： Alvaro E. Retana , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
发明人： Alvaro E. Retana , Michael Barnes , Russell I. White , Alan Patrick Sheridan , Stanley M. Ratliff
IPC分类号： H04L12/24
CPC分类号： H04L45/123 , H04L41/12 , H04L45/125 , H04W40/08 , H04W40/246 , Y02D70/122 , Y02D70/142 , Y02D70/144 , Y02D70/146 , Y02D70/22 , Y02D70/324
摘要： One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set.
摘要翻译：一个实施例标识节点的所有一跳邻居节点和两跳邻居节点; 确定所述节点的一跳邻居节点的活动集，包括：在所述活动集中包括作为边缘节点或与至少一个两跳相邻节点连接的每个一跳邻居节点，跳邻居节点连接; 并且如果活动集尚未完成，则：确定尚未在活动集中的所有组合的一跳邻居节点; 并按照每个组合的总能量值的顺序测试每个组合，以确定特定组合是否能够完成活动集合; 如果没有组合能够完成活动集，则包括活动集中的所有一跳邻居节点; 并将消息传送到活动集中的每个一跳邻居节点，指示其在活动集中。

4. 发明授权

US09124449B2 Network topologies for energy efficient networks 有权
标题翻译：节能网络的网络拓扑
公开(公告)号：US09124449B2
公开(公告)日：2015-09-01
申请号：US13019136
申请日：2011-02-01
申请人： Alan Patrick Sheridan , Alvaro Retana , Russell I. White
发明人： Alan Patrick Sheridan , Alvaro Retana , Russell I. White
IPC分类号： G06F15/173 , H04L12/64 , H04L12/751 , H04M15/00
CPC分类号： H04L12/6418 , H04L45/02 , H04M15/8044
摘要： One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.
摘要翻译：一个实施例在网络的至少一部分中的第一节点处接收路由表，网络的部分包括第一节点和一个或多个第二节点，路由表指定提供每个最佳路径的直接邻居基于总成本的网络部分; 使用路由表，在第一节点处确定第一节点到达网络的所有边缘所必需的第二节点，第一节点到达网络的所有边缘所必需的第二节点，其包括用于第一个节点; 并且将消息从第一节点发送到每个第二节点以便于确定是否关闭第二节点。

5. 发明申请

US20120198092A1 Network Topologies for Energy Efficient Networks 有权
标题翻译：节能网络的网络拓扑
公开(公告)号：US20120198092A1
公开(公告)日：2012-08-02
申请号：US13019136
申请日：2011-02-01
申请人： Alan Patrick Sheridan , Alvaro Retana , Russell I. White
发明人： Alan Patrick Sheridan , Alvaro Retana , Russell I. White
IPC分类号： G06F15/16
CPC分类号： H04L12/6418 , H04L45/02 , H04M15/8044
摘要： One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.
摘要翻译：一个实施例在网络的至少一部分中的第一节点处接收路由表，网络的部分包括第一节点和一个或多个第二节点，路由表指定提供每个最佳路径的直接邻居基于总成本的网络部分; 使用路由表，在第一节点处确定第一节点到达网络的所有边缘所必需的第二节点，第一节点到达网络的所有边缘所必需的第二节点，其包括用于第一个节点; 并且将消息从第一节点发送到每个第二节点以便于确定是否关闭第二节点。

6. 发明授权

US07940668B2 Method and apparatus to enable an IPe domain through EIGRP 有权
标题翻译：通过EIGRP实现IPe域的方法和装置
公开(公告)号：US07940668B2
公开(公告)日：2011-05-10
申请号：US12052861
申请日：2008-03-21
申请人： Alvaro E. Retana , Russell I. White , Yi Yang
发明人： Alvaro E. Retana , Russell I. White , Yi Yang
IPC分类号： H04J1/16
CPC分类号： H04L45/12 , H04L45/02 , H04L45/025
摘要： In one embodiment, a system, method, and apparatus for preventing excessive transmission of routing information in a communications network occurs by receiving a network routing address at a connection node in a communications network, the network routing address allowing the transmission of data packets from a source node to a destination node in the communications network; determining a longest summary route covering a path to the destination node; creating a list comprising a summary of all neighbor connection nodes of the connection node; and transmitting an update of the longest summary route of the network routing address towards all neighbor nodes advertising a destination address comprising a shorter address prefix, wherein the transmitting process occurs sequentially beginning with a first neighbor connection node entered in the list.
摘要翻译：在一个实施例中，通过在通信网络中的连接节点处接收网络路由地址来发生用于防止通信网络中的路由信息的过度传输的系统，方法和装置，所述网络路由地址允许从源节点到通信网络中的目的地节点; 确定覆盖到目的地节点的路径的最长汇总路由; 创建包括所述连接节点的所有邻居连接节点的摘要的列表; 以及向所述广播包含较短地址前缀的目的地地址的所有邻居节点发送所述网络路由地址的最长摘要路由的更新，其中，所述发送处理以从所述列表中输入的第一邻居连接节点顺序发生。

7. 发明申请

US20100329270A1 DYNAMIC DISCOVERY MECHANISMS VIA INTER-DOMAIN ROUTING PROTOCOL 有权
标题翻译：通过“域间路由协议”的动态发现机制
公开(公告)号：US20100329270A1
公开(公告)日：2010-12-30
申请号：US12491034
申请日：2009-06-24
申请人： Rajiv Asati , David Delano Ward , Russell I. White , Keyur P. Patel
发明人： Rajiv Asati , David Delano Ward , Russell I. White , Keyur P. Patel
IPC分类号： H04L12/56
CPC分类号： H04L45/04 , H04L45/00 , H04L45/02
摘要： In an embodiment, a method is provided at which it is used in a device. In this method, a logical identifier assigned to the device is identified and additionally, a mesh group identifier identifying a mesh group is identified. The logical identifier and the mesh group identifier are encoded in a routing message, which is used in an inter-domain routing protocol, and this routing message is transmitted to a reflector device in communication with the device. The reflector device is configured to transmit the routing message to a remote device included in the computer network.
摘要翻译：在一个实施例中，提供了一种在设备中使用的方法。在该方法中，识别分配给该设备的逻辑标识符，并且另外识别识别网格组的网格组标识符。逻辑标识符和网格组标识符被编码在用于域间路由协议的路由消息中，并且该路由消息被发送到与设备通信的反射器设备。反射器装置被配置为将路由消息发送到包括在计算机网络中的远程设备。

8. 发明申请

US20120331555A1 Performing A Defensive Procedure In Response To Certain Path Advertisements 有权
标题翻译：对某些路径广告作出反应的防御性程序
公开(公告)号：US20120331555A1
公开(公告)日：2012-12-27
申请号：US13169121
申请日：2011-06-27
申请人： Alvaro E. Retana , Burjiz Pithawala , David A. Sacerdote , Keyur Patel , Russell I. White
发明人： Alvaro E. Retana , Burjiz Pithawala , David A. Sacerdote , Keyur Patel , Russell I. White
IPC分类号： G06F21/20
CPC分类号： G06Q30/0241
摘要： In certain embodiments, performing a defensive procedure involves receiving at a first speaker of a first autonomous system a path advertisement from a second speaker of a second autonomous system. The path advertisement advertises a path from the second speaker of the second autonomous system. It is determined whether the second autonomous system is a stub autonomous system and whether a path length of the path is greater than one. If the second autonomous system is a stub and the path length is greater than one, a defensive measure is performed for the path. Otherwise, a default procedure is performed for the path.
摘要翻译：在某些实施例中，执行防御性过程包括在第一自治系统的第一说话者处接收来自第二自治系统的第二说话者的路径通告。路径广告从第二自主系统的第二说话者通告路径。确定第二自治系统是否是存根自主系统，以及路径的路径长度是否大于1。如果第二个自治系统是存根，并且路径长度大于1，则对该路径执行防御措施。否则，将为路径执行默认过程。

9. 发明授权

US08121136B2 Dynamic discovery mechanisms via inter-domain routing protocol 有权
标题翻译：通过域间路由协议的动态发现机制
公开(公告)号：US08121136B2
公开(公告)日：2012-02-21
申请号：US12491034
申请日：2009-06-24
申请人： Rajiv Asati , David Delano Ward , Russell I. White , Keyur P. Patel
发明人： Rajiv Asati , David Delano Ward , Russell I. White , Keyur P. Patel
IPC分类号： H04L12/28 , H04L12/56 , H04L1/00 , H04L12/26 , G06F15/173
CPC分类号： H04L45/04 , H04L45/00 , H04L45/02
摘要： In an embodiment, a method is provided at which it is used in a device. In this method, a logical identifier assigned to the device is identified and additionally, a mesh group identifier identifying a mesh group is identified. The logical identifier and the mesh group identifier are encoded in a routing message, which is used in an inter-domain routing protocol, and this routing message is transmitted to a reflector device in communication with the device. The reflector device is configured to transmit the routing message to a remote device included in the computer network.
摘要翻译：在一个实施例中，提供了一种在设备中使用的方法。在该方法中，识别分配给该设备的逻辑标识符，并且另外识别识别网格组的网格组标识符。逻辑标识符和网格组标识符被编码在用于域间路由协议的路由消息中，并且该路由消息被发送到与设备通信的反射器设备。反射器装置被配置为将路由消息发送到包括在计算机网络中的远程设备。

10. 发明申请

US20110019671A1 Partitioned Forwarding of Packets Originated on a Broadcast Link Among Layer 2 Forwarding Devices of Different Adjacency Networks 有权
标题翻译：分组转发源于不同邻接网络的二层转发设备之间的广播链路的报文
公开(公告)号：US20110019671A1
公开(公告)日：2011-01-27
申请号：US12509587
申请日：2009-07-27
申请人： Russell I. White , Ian Michael Charles Shand , Alvaro Enrique Retana
发明人： Russell I. White , Ian Michael Charles Shand , Alvaro Enrique Retana
IPC分类号： H04L12/56
CPC分类号： H04L45/16 , H04L45/04 , H04L45/18 , H04L45/46 , H04L45/48 , H04L45/66
摘要： The designated forwarding device functionality for forwarding of packets originated on a broadcast link among layer 2 is shared among multiple forwarding devices of different adjacency networks. As these networks do not form adjacencies, the forwarding devices do not natively participate in a same spanning tree for determining how to forward packets, and a designated forwarding device is used for forwarding packets originated on the common broadcast link. Distributing the role of a designated forwarding device among multiple of the forwarding devices provides a means for more efficiently forwarding packets to their destinations.
摘要翻译：用于转发在层2之间的广播链路上的分组的指定转发设备功能在不同邻接网络的多个转发设备之间共享。由于这些网络不形成邻接关系，所以转发设备本身不参与相同的生成树，以确定如何转发数据包，并且指定的转发设备用于转发在公共广播链路上发起的数据包。在多个转发设备之间分配指定转发设备的角色提供了一种更有效地将报文转发到目的地的方法。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式