专利快速检索-快速检索全球专利，免费商用专利数据库-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. 发明授权

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.
摘要翻译：一个实施例在网络的至少一部分中的第一节点处接收路由表，网络的部分包括第一节点和一个或多个第二节点，路由表指定提供每个最佳路径的直接邻居基于总成本的网络部分; 使用路由表，在第一节点处确定第一节点到达网络的所有边缘所必需的第二节点，第一节点到达网络的所有边缘所必需的第二节点，其包括用于第一个节点; 并且将消息从第一节点发送到每个第二节点以便于确定是否关闭第二节点。

3. 发明申请

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.
摘要翻译：一个实施例在网络的至少一部分中的第一节点处接收路由表，网络的部分包括第一节点和一个或多个第二节点，路由表指定提供每个最佳路径的直接邻居基于总成本的网络部分; 使用路由表，在第一节点处确定第一节点到达网络的所有边缘所必需的第二节点，第一节点到达网络的所有边缘所必需的第二节点，其包括用于第一个节点; 并且将消息从第一节点发送到每个第二节点以便于确定是否关闭第二节点。

4. 发明授权

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

5. 发明授权

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

6. 发明申请

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

7. 发明申请

US20080062947A1 Method and Apparatus for Passing Routing Information Among Mobile Routers 有权
标题翻译：移动路由器传递路由信息的方法和装置
公开(公告)号：US20080062947A1
公开(公告)日：2008-03-13
申请号：US11531259
申请日：2006-09-12
申请人： Alvaro Retana , Yi Yang , Abhay Roy , Alfred Lindem
发明人： Alvaro Retana , Yi Yang , Abhay Roy , Alfred Lindem
IPC分类号： H04B7/216
CPC分类号： H04L45/026 , H04L45/04 , H04W40/246
摘要： A method and apparatus for sharing routing information include receiving first domain data that indicates domains of a first mobile router. A domain is a collection of routers that share uniform routing information at a particular level of detail. An inbound data packet is received from a second mobile router over a particular link. The inbound control plane packet lists second domain data that indicates domains of the second mobile router. The first domain data and the second domain data together include multiple domains. A particular domain is automatically selected from the first domain data and the second domain data. The second mobile router independently selects the same particular domain. The particular link is assigned to the particular domain; and routing information for the particular domain is shared between the first mobile router and the second mobile router over the particular link.
摘要翻译：用于共享路由信息的方法和装置包括接收指示第一移动路由器的域的第一域数据。一个域是一个路由器的集合，它们以特定的详细级别共享统一的路由信息。通过特定链路从第二移动路由器接收入站数据分组。入站控制平面分组列出了指示第二移动路由器的域的第二域数据。第一域数据和第二域数据一起包括多个域。从第一域数据和第二域数据自动选择特定域。第二移动路由器独立地选择相同的特定域。特定链接被分配给特定的域; 并且特定域的路由信息在特定链路上在第一移动路由器和第二移动路由器之间共享。

8. 发明申请

US20070245034A1 Dynamically configuring and verifying routing information of broadcast networks using link state protocols in a computer network 有权
标题翻译：在计算机网络中使用链路状态协议动态配置和验证广播网络的路由信息
公开(公告)号：US20070245034A1
公开(公告)日：2007-10-18
申请号：US11406222
申请日：2006-04-18
申请人： Alvaro Retana , Alfred Lindem , Russ White
发明人： Alvaro Retana , Alfred Lindem , Russ White
IPC分类号： G06F15/173
CPC分类号： H04L45/16 , G06F15/173 , H04L12/28 , H04L12/66 , H04L45/02 , H04L45/54
摘要： A technique dynamically configures and verifies routing information of broadcast networks using link state protocols in a computer network. According to the novel technique, a router within the broadcast network receives a link state protocol routing information advertisement from an advertising router, e.g., a designated router or other adjacent neighbor. The router learns of a next-hop router (“next-hop”) to reach a particular destination from the advertisement, and determines whether the next-hop is located within the same broadcast network (e.g., subnet) as the designated router. If so, the router further determines whether the next-hop is directly addressable (i.e., reachable), such as, e.g., by checking for link adjacencies to the next-hop or by sending request/reply messages (e.g., echo messages or “ping” messages) to the next-hop. In the event the next-hop for the destination is not directly addressable by the router (e.g., no adjacency or reply), the router installs a route to the destination via the designated router. Otherwise, the router installs a route to the destination via the next-hop.
摘要翻译：技术使用计算机网络中的链路状态协议来动态地配置和验证广播网络的路由信息。根据该技术，广播网络内的路由器从广告路由器（例如，指定路由器或其他相邻邻居）接收链路状态协议路由信息广告。路由器学习下一跳路由器（“下一跳”）从广告到达特定目的地，并且确定下一跳是否位于与指定路由器相同的广播网络（例如，子网）内。如果是这样，则路由器进一步确定下一跳是否可直接寻址（即可达到），例如通过检查下一跳的链路邻接或通过发送请求/应答消息（例如，回波消息或“ ping“消息）到下一跳。在目的地的下一跳不能由路由器直接寻址的情况下（例如，没有邻接或回复），路由器经由指定的路由器安装到目的地的路由。否则，路由器将通过下一跳安装到目的地的路由。

9. 发明申请

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.

10. 发明申请

US20060007865A1 Arrangement for preventing count-to-infinity in flooding distance vector routing protocols 有权
标题翻译：用于防止洪泛距离矢量路由协议中的无穷大的排列
公开(公告)号：US20060007865A1
公开(公告)日：2006-01-12
申请号：US10887919
申请日：2004-07-12
申请人： Russell White , David Cook , Alvaro Retana
发明人： Russell White , David Cook , Alvaro Retana
IPC分类号： H04L12/26 , H04L12/28
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.
摘要翻译：网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息，以及指示已经发起可达性信息的路由器的始发路由器标识符。如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配，则在从网络计算最佳路径期间忽略接收到的路由器通告消息。如果始发路由器标识符识别另一个路由器，则路由器将接收的路由器通告消息洪泛到其他端口，并根据接收到的路由器通告消息输出自己的路由器通告消息，并从接收到的路由器通告消息中指定始发路由器标识符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式