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

1. 发明申请

US20050075104A1 Model and method for computing performance bounds in multi-hop wireless networks 有权
标题翻译：用于计算多跳无线网络中性能范围的模型和方法
公开(公告)号：US20050075104A1
公开(公告)日：2005-04-07
申请号：US10680549
申请日：2003-10-07
申请人： Kamal Jain , Jitendra Padhye , Venkata Padmanabhan , Lili Qiu
发明人： Kamal Jain , Jitendra Padhye , Venkata Padmanabhan , Lili Qiu
IPC分类号： H04L12/28 , H04L12/56 , H04W16/14 , H04Q7/20
CPC分类号： H04W16/14
摘要： Disclosed is a general model and method for computing performance bounds in multi-hop wireless networks. Rather than focusing on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, the present invention accommodates any given network, technology, interference model, routing paradigm, and workload. Using a conflict graph to formally characterize the impact of wireless interference on the performance of multi-hop wireless networks, methods for computing upper and lower bounds on the capacity of a given wireless network are detailed. Besides computing network capacity, the model and method disclosed can also enable or benefit other applications including maximizing fairness and minimizing maximum link utilization.
摘要翻译：公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。

2. 发明申请

US20060240835A1 Model and method for computing performance bounds in multi-hop wireless networks 有权
标题翻译：用于计算多跳无线网络中性能范围的模型和方法
公开(公告)号：US20060240835A1
公开(公告)日：2006-10-26
申请号：US11474666
申请日：2006-06-26
申请人： Kamal Jain , Jitendra Padhye , Venkata Padmanabhan , Lili Qiu
发明人： Kamal Jain , Jitendra Padhye , Venkata Padmanabhan , Lili Qiu
IPC分类号： H04Q7/20
CPC分类号： H04W16/14
摘要： Disclosed is a general model and method for computing performance bounds in multi-hop wireless networks. Rather than focusing on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, the present invention accommodates any given network, technology, interference model, routing paradigm, and workload. Using a conflict graph to formally characterize the impact of wireless interference on the performance of multi-hop wireless networks, methods for computing upper and lower bounds on the capacity of a given wireless network are detailed. Besides computing network capacity, the model and method disclosed can also enable or benefit other applications including maximizing fairness and minimizing maximum link utilization.
摘要翻译：公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。

3. 发明申请

US20060215572A1 Available bandwidth estimation 有权
标题翻译：可用带宽估计
公开(公告)号：US20060215572A1
公开(公告)日：2006-09-28
申请号：US11088130
申请日：2005-03-23
申请人： Jitendra Padhye , Venkata Padmanabhan
发明人： Jitendra Padhye , Venkata Padmanabhan
IPC分类号： H04L1/00
CPC分类号： H04L43/12 , H04L43/0858 , H04L43/0882
摘要： A new system and method of available bandwidth estimation applies even where the narrow link and tight link in a network path are in different locations. In embodiments of the invention, a unique packet probe series structure and processing is employed to estimate available bandwidth. In an embodiment of the invention, the spacing between probe packets is adjusted at the source to account for dilation caused by links leading to the tight link, so that the spacing is appropriate when the probes arrive at the tight link. Moreover, the multi-packet probe comprises a large packet followed by two much smaller packets. The large packet is then dropped once it has traversed the tight link. The two small packets, which are impacted little by subsequent narrow links, preserve the spacing set by the tight link, encoding the delay induced by the tight link, all the way to the destination.
摘要翻译：即使在网络路径中的窄链路和紧密链路位于不同位置的情况下，也可以使用新的可用带宽估计系统和方法。在本发明的实施例中，使用唯一的分组探测器序列结构和处理来估计可用带宽。在本发明的一个实施例中，探测分组之间的间距在源处被调节以考虑由导致紧密连接的链路引起的扩张，使得当探头到达紧密连接时，间隔是适当的。此外，多分组探测器包括大分组，后面是两个小得多的分组。一旦该数据包已经穿过紧密链接，该数据包将被丢弃。两个小包被后续的窄链接影响很小，保留了紧密链接设置的间距，将由紧密链接引起的延迟编码到目的地。

4. 发明申请

US20060215574A1 Bandwidth estimation in broadband access networks 有权
标题翻译：宽带接入网络带宽估计
公开(公告)号：US20060215574A1
公开(公告)日：2006-09-28
申请号：US11089246
申请日：2005-03-24
申请人： Venkata Padmanabhan , Jitendra Padhye
发明人： Venkata Padmanabhan , Jitendra Padhye
IPC分类号： H04J1/16 , H04J3/22
CPC分类号： H04L41/0896 , H04L43/10 , H04L43/50
摘要： Measurement systems according to embodiments of the invention allow accurate bandwidth estimation even in non-FIFO scheduling and frame-level contention environments. In an embodiment of the invention, the approximate fraction of time that a link is idle is found by probing for idle periods (“gaps”). The fraction of idle time is then multiplied by the capacity to obtain an estimate of the available bandwidth. Gap time is estimated in an embodiment of the invention fraction by gathering samples of one-way delay (OWD) over the link in question. After the OWD is normalized and plotted, the knee in the cumulative distribution function (CDF) of OWD samples is used to identify the fraction of time that the channel is idle.
摘要翻译：根据本发明的实施例的测量系统即使在非FIFO调度和帧级争用环境中也允许精确的带宽估计。在本发明的一个实施例中，链路空闲时间的近似分数是通过探测空闲时段（“间隙”）找到的。然后将空闲时间的一部分乘以容量以获得可用带宽的估计。通过在所讨论的链路上收集单向延迟（OWD）的样本，在本发明的一个实施例中估计间隙时间。在OWD被归一化和绘制之后，使用OWD样本的累积分布函数（CDF）中的膝盖来识别信道空闲的时间部分。

5. 发明申请

US20060203739A1 Profiling wide-area networks using peer cooperation 审中-公开
标题翻译：使用同伴合作分析广域网
公开(公告)号：US20060203739A1
公开(公告)日：2006-09-14
申请号：US11079792
申请日：2005-03-14
申请人： Venkata Padmanabhan , Jitendra Padhye , Narayanan Ramabhadran
发明人： Venkata Padmanabhan , Jitendra Padhye , Narayanan Ramabhadran
IPC分类号： H04J1/16 , H04L12/28
CPC分类号： H04L43/0852 , H04L41/0631 , H04L43/06 , H04L43/0829 , H04L43/0864 , H04L43/0888 , H04L43/10
摘要： End hosts share network performance and reliability information with their peers over a peer-to-peer network. The aggregated information from multiple end hosts is shared in the peer-to-peer network in order for each end host to process the aggregated information so as to profile network performance. A set of attributes defines hierarchies associated with end hosts and their network connectivity. Information on the network performance and failures experienced by end hosts is then aggregated along these hierarchies, to identify patterns (e.g., shared attributes) that are indicative of the source of the problem. In some cases, such sharing of information also enables end hosts to resolve problems by themselves.
摘要翻译：终端主机通过对等网络与对等体共享网络性能和可靠性信息。来自多个终端主机的聚合信息在对等网络中共享，以便每个终端主机处理聚合信息，以便对网络性能进行归类。一组属性定义与终端主机及其网络连接相关联的层次结构。关于终端主机所经历的网络性能和故障的信息然后沿着这些层次聚合，以识别指示问题源的模式（例如，共享属性）。在某些情况下，这种信息共享也使终端主机能够自己解决问题。

6. 发明申请

US20090185514A1 WIRELESS COMMUNICATIONS ENVIRONMENT OVERLAY 有权
标题翻译：无线通信环境覆盖
公开(公告)号：US20090185514A1
公开(公告)日：2009-07-23
申请号：US12018723
申请日：2008-01-23
申请人： Ranveer Chandra , Jitendra Padhye , Lenin Ravindranath Sivalingam
发明人： Ranveer Chandra , Jitendra Padhye , Lenin Ravindranath Sivalingam
IPC分类号： H04B7/00
CPC分类号： H04W84/12 , H04L12/189 , H04W8/186 , H04W48/16 , H04W72/005
摘要： A method is provided, wherein the method comprises identifying nearby wireless communication access points (APs) to which a client computing environment can cooperate with to communicate and receive data through a subscription to a neighborcast group from indentified nearby cooperating access points such that illustratively the neighborcast group comprises a communications overlay between cooperating client computing environments employing the identified nearby wireless communications access points. In an illustrative implementation, a wireless communications environment comprises at least two client computing environments comprising a communications overlay engine operable to process at least one instruction from an exemplary instruction set to perform one or more wireless communications operations over the exemplary communications overlay comprising scanning for cooperating client computing environments and/or wireless access points and/or RSS servers, subscribing to the communications overlay group, and publishing data for consumption by cooperating components of the wireless communications overlay.
摘要翻译：提供了一种方法，其中所述方法包括识别客户端计算环境可以与之合作的附近的无线通信接入点（AP），以通过从识别的附近协作接入点订阅邻居组来传送和接收数据，从而说明邻居组合包括使用所识别的附近的无线通信接入点的合作的客户端计算环境之间的通信覆盖。在说明性实现中，无线通信环境包括至少两个客户端计算环境，包括通信覆盖引擎，其可操作以处理来自示例性指令集的至少一个指令，以在示例性通信覆盖层上执行一个或多个无线通信操作，包括扫描协作客户端计算环境和/或无线接入点和/或RSS服务器，订阅通信覆盖组，以及通过协作无线通信覆盖的组件发布用于消费的数据。

7. 发明申请

US20070242643A1 Using a wireless beacon broadcast to provide a media message 审中-公开
标题翻译：使用无线信标广播来提供媒体消息
公开(公告)号：US20070242643A1
公开(公告)日：2007-10-18
申请号：US11404639
申请日：2006-04-14
申请人： Ranveer Chandra , Jitendra Padhye , Alastair Wolman
发明人： Ranveer Chandra , Jitendra Padhye , Alastair Wolman
IPC分类号： H04Q7/24
CPC分类号： H04H20/61 , H04H20/93 , H04W4/06 , H04W28/065 , H04W48/12
摘要： A system and method for using a wireless beacon broadcast to provide a media message is disclosed. A first beacon broadcast is provided from a wireless access point, the first beacon broadcast having a first beacon component with a first portion of media. A second beacon broadcast is provided from the wireless access point, the second beacon broadcast having a second beacon component with a second portion of media. The first portion of media and the second portion of media are combinable to provide a complete media message.
摘要翻译：公开了一种使用无线信标广播来提供媒体消息的系统和方法。从无线接入点提供第一信标广播，第一信标广播具有具有媒体的第一部分的第一信标分量。从无线接入点提供第二信标广播，第二信标广播具有具有媒体的第二部分的第二信标分量。媒体的第一部分和媒体的第二部分可以组合来提供完整的媒体信息。

8. 发明申请

US20050286426A1 System and method for link quality routing using a weighted cumulative expected transmission time metric 失效
标题翻译：使用加权累积预期传输时间度量的链路质量路由的系统和方法
公开(公告)号：US20050286426A1
公开(公告)日：2005-12-29
申请号：US11081120
申请日：2005-03-15
申请人： Jitendra Padhye , Richard Draves , Brian Zill
发明人： Jitendra Padhye , Richard Draves , Brian Zill
IPC分类号： H04L12/28 , H04L12/56 , H04L12/26
CPC分类号： H04L45/00 , H04L45/124 , H04W16/14 , H04W40/02 , H04W84/18
摘要： A system and method for link quality routing uses a weighted cumulative expected transmission time path metric. A system for routing in a multi-hop ad hoc network, and a method for measuring the link quality of a route in the network, include assignment of a weight to a link in accordance with an expected transmission time of a packet over the link, and a combining of individual link weights for a route into a path metric. The path metric accounts for interference among links that use a shared channel. In the calculation of the path metric, the expected transmission times of links that interfere with one another are added, while the expected transmission times for non-interfering links are considered separately.
摘要翻译：用于链路质量路由的系统和方法使用加权累积期望传输时间路径度量。一种用于在多跳自组织网络中路由的系统以及用于测量网络中的路由的链路质量的方法包括根据链路上的分组的预期传输时间向链路分配权重，以及将路由的各个链路权重组合成路径度量。路径度量考虑到使用共享通道的链路之间的干扰。在路径度量的计算中，添加了彼此干扰的链路的预期传输时间，而非干扰链路的预期传输时间被分别考虑。

9. 发明授权

US09246982B2 Reducing network usage of computing device 有权
标题翻译：减少计算设备的网络使用
公开(公告)号：US09246982B2
公开(公告)日：2016-01-26
申请号：US13615603
申请日：2012-09-14
申请人： Sharad Agarwal , Christopher Riederer , Lenin Ravindranath Sivalingam , Jitendra Padhye
发明人： Sharad Agarwal , Christopher Riederer , Lenin Ravindranath Sivalingam , Jitendra Padhye
IPC分类号： G06F15/173 , H04L29/08
CPC分类号： H04L67/06 , H04L67/325 , H04L67/34
摘要： Methods and systems for reducing network usage of a computing device are provided herein. The method includes receiving a network call relating to a network transfer from an application at an application programming interface of the computing device. The method also includes determining whether the network transfer is relevant to a current state of the application and procrastinating the network transfer if it is not relevant to the current state of the application.
摘要翻译：本文提供了用于减少计算设备的网络使用的方法和系统。该方法包括从计算设备的应用编程接口处的应用接收与网络传输有关的网络呼叫。该方法还包括确定网络传输是否与应用的当前状态相关，并且如果与应用的当前状态无关，则拖延网络传输。

10. 发明授权

US08966063B2 Operating a sleep management service 有权
标题翻译：操作睡眠管理服务
公开(公告)号：US08966063B2
公开(公告)日：2015-02-24
申请号：US13366387
申请日：2012-02-06
申请人： Jacob R. Lorch , Jitendra Padhye , Brian Zill , Wenbiao Xing , Wei Wan , Li Chen
发明人： Jacob R. Lorch , Jitendra Padhye , Brian Zill , Wenbiao Xing , Wei Wan , Li Chen
IPC分类号： G06F15/173
CPC分类号： G06F1/3209 , H04L12/12 , Y02D50/40
摘要： The claimed subject matter provides a method for operating a sleep management service. The method include identifying a set of guardians based on a local state for each of a plurality of compute nodes. The method also includes sending a wake request to all sleeping compute nodes in the identified set. The method further includes sending a request to become a guardian to all compute nodes in the identified set. Additionally, the method includes stopping a current guardian from being a guardian if the current guardian is less suitable than a threshold number of current guardians.
摘要翻译：所要求保护的主题提供了一种操作睡眠管理服务的方法。该方法包括基于多个计算节点中的每一个的本地状态识别一组监护人。该方法还包括向所识别的集合中的所有睡眠计算节点发送唤醒请求。该方法还包括向所识别的集合中的所有计算节点发送成为监护人的请求。此外，该方法包括如果当前监护人不如当前监护人的门槛数目那样适合，则阻止当前监护人成为监护人。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式