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

1. 发明授权

US07567547B2 Method and system for loop-free ad-hoc routing 有权
标题翻译：无循环自组织路由的方法和系统
公开(公告)号：US07567547B2
公开(公告)日：2009-07-28
申请号：US11517203
申请日：2006-09-07
申请人： Marc E. Mosko , Jose J. Garcia-Luna-Aceves
发明人： Marc E. Mosko , Jose J. Garcia-Luna-Aceves
IPC分类号： H04L12/28
CPC分类号： H04W40/28 , H04L45/18 , H04L45/20 , H04L45/32
摘要： One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.
摘要翻译：本发明的一个实施例提供了一种有助于无线网络中无环路自组织路由的系统。在操作期间，系统通告与目的地节点的本地节点相关联的本地序列号，并在本地节点处接收第一路由请求，其中路由请求指定源节点，目的地节点和第一序列号。该系统还选择性地维护指示源节点，目的地节点，第一序列号以及从其接收路由请求的节点的记录。所述系统还基于所接收的路由请求选择性地转发第二路由请求，其中所述第二路由请求指定所述源节点，所述目的地节点和小于所述第一序列号并小于或等于所述目的节点的第二序列号广告本地序列号。

2. 发明申请

US20080062916A1 Method and system for loop-free ad-hoc routing 有权
标题翻译：无循环自组织路由的方法和系统
公开(公告)号：US20080062916A1
公开(公告)日：2008-03-13
申请号：US11517203
申请日：2006-09-07
申请人： Marc E. Mosko , Jose J. Garcia-Luna-Aceves
发明人： Marc E. Mosko , Jose J. Garcia-Luna-Aceves
IPC分类号： H04Q7/00
CPC分类号： H04W40/28 , H04L45/18 , H04L45/20 , H04L45/32
摘要： One embodiment of the present invention provides a system that facilitates loop-free ad-hoc routing in a wireless network. During operation, the system advertises a local sequence number associated with a local node for a destination node, and receives a first route request at the local node, wherein the route request specifies a source node, the destination node, and a first sequence number. The system further selectively maintains a record, which indicates the source node, the destination node, the first sequence number, and a node from which the route request is received. The system also selectively forwards a second route request based on the received route request, wherein the second route request specifies the source node, the destination node, and a second sequence number which is less than the first sequence number and less than or equal to the advertised local sequence number.
摘要翻译：本发明的一个实施例提供了一种有助于无线网络中无环路自组织路由的系统。在操作期间，系统通告与目的地节点的本地节点相关联的本地序列号，并在本地节点处接收第一路由请求，其中路由请求指定源节点，目的地节点和第一序列号。该系统还选择性地维护指示源节点，目的地节点，第一序列号以及从其接收路由请求的节点的记录。所述系统还基于所接收的路由请求选择性地转发第二路由请求，其中所述第二路由请求指定所述源节点，所述目的地节点和小于所述第一序列号并小于或等于所述目的节点的第二序列号广告本地序列号。

3. 发明授权

US08423666B2 System and method for directing clients to optimal servers in computer networks 有权
公开(公告)号：US08423666B2
公开(公告)日：2013-04-16
申请号：US12645442
申请日：2009-12-22
申请人： Jose J. Garcia-Luna-Aceves , Srinivas Vutukury
发明人： Jose J. Garcia-Luna-Aceves , Srinivas Vutukury
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L45/12 , G06F12/1483 , G06F17/30902 , H04L12/18 , H04L29/12009 , H04L43/0805 , H04L43/0852 , H04L61/1582 , H04L67/1002 , H04L67/1006 , H04L67/1008 , H04L67/101 , H04L67/1014 , H04L67/1023 , H04L67/1038 , H04L67/2842
摘要： A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.

4. 发明授权

US07565450B2 System and method for using a mapping between client addresses and addresses of caches to support content delivery 有权
公开(公告)号：US07565450B2
公开(公告)日：2009-07-21
申请号：US09843789
申请日：2001-04-26
申请人： Jose J. Garcia-Luna-Aceves , Bradley R. Smith
发明人： Jose J. Garcia-Luna-Aceves , Bradley R. Smith
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： G06F12/1483 , G06F17/30902 , H04L12/18 , H04L29/06 , H04L29/12009 , H04L29/12047 , H04L29/12066 , H04L29/12594 , H04L29/12811 , H04L61/1511 , H04L61/30 , H04L61/6009 , H04L67/1002 , H04L67/1008 , H04L67/101 , H04L2029/06054
摘要： Various information object repository selection procedures for determining which of a number of information object repositories should service a request for the information object include a direct cache selection process, a redirect cache selection process, a remote DNS cache selection process, or a local DNS cache selection process. Different combinations of these procedures may also be used. For example different combination may be used depending on the type of content being requested. The direct cache selection process may be used for information objects that will be immediately loaded without user action, while any of the redirect cache selection process, the remote DNS cache selection process and/or the local DNS cache selection process may be used for information objects that will be loaded only after some user action.

5. 发明授权

US07310335B1 Multicast routing in ad-hoc networks 失效
标题翻译：自组织网络中的组播路由
公开(公告)号：US07310335B1
公开(公告)日：2007-12-18
申请号：US09703074
申请日：2000-10-31
申请人： Jose J. Garcia-Luna-Aceves , Marcelo Spohn
发明人： Jose J. Garcia-Luna-Aceves , Marcelo Spohn
IPC分类号： H04L12/44
CPC分类号： H04L12/185 , H04L12/1854 , H04L45/16 , H04L45/48 , H04L47/15 , H04L47/17 , H04W40/246
摘要： Multicast routing in ad-hoc networks by exchange of multicast group update information and routing tree information among neighboring routers is disclosed. A router propagates multicast group update information based on the update information and the routing tree information. A router also determines whether to forward multicast data packets based on control information in the multicast data packets and the routing tree information.
摘要翻译：公开了通过在相邻路由器之间交换组播组更新信息和路由树信息的自组织网络中的组播路由。路由器根据更新信息和路由树信息传播组播组更新信息。路由器还根据组播数据包中的控制信息和路由树信息确定是否转发组播数据包。

6. 发明授权

US07908337B2 System and method for using network layer uniform resource locator routing to locate the closest server carrying specific content 有权
标题翻译：使用网络层统一资源定位器路由来定位最近承载特定内容的服务器的系统和方法
公开(公告)号：US07908337B2
公开(公告)日：2011-03-15
申请号：US09844856
申请日：2001-04-26
申请人： Jose J. Garcia-Luna-Aceves , Bradley R. Smith
发明人： Jose J. Garcia-Luna-Aceves , Bradley R. Smith
IPC分类号： G06F15/16
CPC分类号： G06F12/1483 , G06F17/30902 , H04L12/18 , H04L29/06 , H04L29/12009 , H04L29/12047 , H04L61/15 , H04L67/1002 , H04L67/1008 , H04L67/101 , H04L2029/06054
摘要： A request for an information object at an address identified by a uniform resource locator (URL) is received; and the URL is mapped to a corresponding anycast address for the information object. Thereafter, the anycast address for the information object may be resolved to a unicast address for the information object, and the information object sent to the client. The request may be received at an information object repository that is topologically closer to the client than any other information object repository. This closest information object repository may be selected according to specified performance metrics, such as: average delay from the selected information object repository to a source of the request, average processing delay at the selected information object repository, reliability of a path from the selected information object repository, available bandwidth in said path, and loads on the selected information object repository.
摘要翻译：接收在由统一资源定位符（URL）标识的地址处的信息对象的请求; 并将URL映射到信息对象的相应任播地址。此后，信息对象的任播地址可以解析为信息对象的单播地址，并将信息对象发送给客户端。该请求可以在比任何其他信息对象库更远离客户端的信息对象存储库处被接收。可以根据指定的性能度量来选择最接近的信息对象库，例如：从所选择的信息对象库到请求源的平均延迟，所选信息对象库的平均处理延迟，所选信息的路径的可靠性对象存储库，所述路径中的可用带宽，以及所选信息对象库上的加载。

7. 发明申请

US20100215051A1 NETWORK ROUTING WITH PATH IDENTIFIERS 有权
标题翻译：网络路由与路径识别器
公开(公告)号：US20100215051A1
公开(公告)日：2010-08-26
申请号：US12391841
申请日：2009-02-24
申请人： Ignacio Solis , Jose J. Garcia-Luna-Aceves , Rebecca L. Braynard Silberstein
发明人： Ignacio Solis , Jose J. Garcia-Luna-Aceves , Rebecca L. Braynard Silberstein
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/54 , H04L45/04
摘要： One embodiment of the present invention provides a system that communicates a data packet in a network to a target node. In doing so, the system receives a node identifier for the target node, and determines a first positional label, based in part on the node identifier, for reaching a first anchor node from a root node in the network. The first anchor node stores a second positional label for reaching the target node from the root node in the network, which comprises a number of nodes coupled to the root node in a tree topology. The system then retrieves the second positional label from the first anchor node, and communicates the data packet to the target node based in part on the second positional label.
摘要翻译：本发明的一个实施例提供一种将网络中的数据分组传送到目标节点的系统。在这样做时，系统接收目标节点的节点标识符，并且部分地基于节点标识确定第一位置标签，以从网络中的根节点到达第一锚节点。第一锚节点存储用于从网络中的根节点到达目标节点的第二位置标签，其包括耦合到树形拓扑中的根节点的多个节点。然后，系统从第一锚节点检索第二位置标签，并且部分地基于第二位置标签将数据分组传送到目标节点。

8. 发明授权

US07664876B2 System and method for directing clients to optimal servers in computer networks 有权
标题翻译：将客户端引导到计算机网络中的最佳服务器的系统和方法
公开(公告)号：US07664876B2
公开(公告)日：2010-02-16
申请号：US10241321
申请日：2002-09-10
申请人： Jose J. Garcia-Luna-Aceves , Srinivas Vutukury
发明人： Jose J. Garcia-Luna-Aceves , Srinivas Vutukury
IPC分类号： G06F15/173
CPC分类号： H04L45/12 , G06F12/1483 , G06F17/30902 , H04L12/18 , H04L29/12009 , H04L43/0805 , H04L43/0852 , H04L61/1582 , H04L67/1002 , H04L67/1006 , H04L67/1008 , H04L67/101 , H04L67/1014 , H04L67/1023 , H04L67/1038 , H04L67/2842
摘要： A communication protocol includes one or more messages passed between Web routers over a reliable transmission protocol used for inter-Web router communication. These messages include information that allows the Web routers to dynamically update mappings of client addresses or address ranges to information object repository addresses based on client-to-server distance and server load. The mappings are preferably optimal mappings of the client addresses or address ranges to the information object repository addresses and the messages report updated distances from these information object repository addresses to the client addresses or address ranges. For example, the messages may report, for each updated distance, an associated client address or address range and/or an associated anchor address of a Web router co-located with an information object repository that is the subject of the message.
摘要翻译：通信协议包括通过用于网络间路由器通信的可靠传输协议在Web路由器之间传递的一个或多个消息。这些消息包括允许Web路由器基于客户端到服务器的距离和服务器负载动态地更新客户端地址或地址范围到信息对象存储库地址的信息。映射优选地是客户端地址或地址范围对信息对象存储库地址的最佳映射，并且消息报告从这些信息对象库地址到客户端地址或地址范围的更新距离。例如，消息可针对每个更新的距离报告与作为消息主题的信息对象存储库共址的Web路由器的相关联的客户端地址或地址范围和/或相关联的锚定地址。

9. 发明授权

US06791997B2 System and method for collision-free transmission scheduling using neighborhood information and advertised transmission times 有权
标题翻译：使用邻域信息进行无碰撞传输调度的系统和方法，并通告传输时间
公开(公告)号：US06791997B2
公开(公告)日：2004-09-14
申请号：US10228173
申请日：2002-08-26
申请人： David Beyer , Jose J. Garcia-Luna-Aceves
发明人： David Beyer , Jose J. Garcia-Luna-Aceves
IPC分类号： H04L12413
CPC分类号： H04W72/1278 , H04L45/20 , H04W8/245 , H04W40/24 , H04W72/1257 , H04W80/02 , H04W84/18
摘要： The present invention provides a medium access control (MAC) protocol for the collision-free transmission of packets into a channel, such that nodes are assigned time slots for collision-free transmission based on the knowledge that they acquire regarding the constituency of their local neighborhoods and the advertisements of the time slots when nodes in local neighborhoods will attempt to transmit again. The scheduling procedure may utilize an age of the network together with the unique identifiers of nodes. The candidate transmission times for each node are determined using a list of the subsequent transmission times advertised by other nodes. The node discards the advertised transmission times from the list of potential transmission times, and computes its candidate transmission times using a function that provides a varying (pseudorandom) distribution of outputs for a varying sample of inputs. This function ay be a hash function, an encryption function, or a table lookup function. The computation of the candidate transmission times uses the identifiers of those nodes for which no advertised transmission time has been obtained.
摘要翻译：本发明提供了一种媒体接入控制（MAC）协议，用于将数据包无冲突地传输到信道中，使得节点被分配用于无碰撞传输的时隙，这是基于他们获取的关于其本地邻域的选区的知识以及当地邻域中的节点将尝试再次发送的时隙的广告。调度过程可以利用网络的年龄以及节点的唯一标识符。使用由其他节点发布的后续传输时间的列表来确定每个节点的候选传输时间。节点从潜在传输时间列表中丢弃所通告的传输时间，并且使用为变化的输入样本提供输出的变化（伪随机数）分布的函数来计算其候选传输时间。此函数可以是散列函数，加密函数或表查找函数。候选传输时间的计算使用未获得通告的传输时间的那些节点的标识符。

10. 发明授权

US06658479B1 Load-balanced anycasting and routing in a network 有权
标题翻译：在网络中负载均衡的任播和路由
公开(公告)号：US06658479B1
公开(公告)日：2003-12-02
申请号：US09607639
申请日：2000-06-30
申请人： William T. Zaumen , Jose J. Garcia-Luna-Aceves
发明人： William T. Zaumen , Jose J. Garcia-Luna-Aceves
IPC分类号： G06F1300
CPC分类号： H04L67/101 , H04L29/06 , H04L45/12 , H04L45/121 , H04L45/123 , H04L45/22 , H04L67/1002 , H04L67/1023 , H04L2029/06054
摘要： A method for determining the cost of routing data is described herein, where a communication cost for routing data from a current node to a successor node over a communication channel is computed, and then a processing node cost for processing data at the current node is computed, where the processing node cost represents a ratio of data input rates to data output rates at the current node. The two computations are combined to formulate a link cost for the current node, or the cost of routing data through that node. The link cost can then be used in a routing algorithm for routing data.
摘要翻译：本文描述了用于确定路由数据成本的方法，其中计算通过通信信道从当前节点到后继节点路由数据的通信成本，然后计算用于处理当前节点处的数据的处理节点成本，其中处理节点成本表示当前节点处的数据输入速率与数据输出速率的比率。这两个计算被组合以制定当前节点的链路成本，或通过该节点路由数据的成本。然后可以在用于路由数据的路由算法中使用链路成本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式