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

1. 发明申请

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.
摘要翻译：公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。

2. 发明申请

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.
摘要翻译：公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。

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. 发明申请

US20050157706A1 System and method for evaluating and enhancing source anonymity for encrypted web traffic 失效
标题翻译：用于评估和增强加密Web流量的源匿名的系统和方法
公开(公告)号：US20050157706A1
公开(公告)日：2005-07-21
申请号：US11064677
申请日：2005-02-24
申请人： Yi-Min Wang , Oixiang Sun , Daniel Simon , Wilfred Russell , Lili Qiu , Venkata Padmanabhan
发明人： Yi-Min Wang , Oixiang Sun , Daniel Simon , Wilfred Russell , Lili Qiu , Venkata Padmanabhan
IPC分类号： H04L29/06 , H04L12/66
CPC分类号： H04L63/0407 , G06F2221/2107 , G06F2221/2119 , G06Q20/10 , G06Q20/102 , G06Q20/1085 , G06Q20/40 , H04L63/1408
摘要： A system and method is provided for evaluating the effectiveness of data encryption for hiding the identity of the source of Web traffic. A signature is constructed from encrypted Web traffic for a Web page sent by a target Web site, and the signature is compared with archived traffic signatures obtained by accessing various Web pages of interest in advance. If the signature of the detected encrypted Web traffic matches a stored traffic signature beyond a pre-set statistical threshold, a positive match is found, and the source of the traffic is identified. Countermeasures for reducing the reliability of source identification based on traffic signature matching are provided.
摘要翻译：提供了一种系统和方法，用于评估数据加密的有效性，以隐藏Web流量来源的身份。由目标网站发送的网页的加密Web流量构建签名，并将签名与通过预先访问各种感兴趣的网页获得的归档流量签名进行比较。如果检测到的加密Web流量的签名与存储的流量签名匹配超过预定的统计阈值，则找到正匹配，并且识别流量的来源。提供了基于流量特征匹配降低源识别可靠性的对策。

7. 发明申请

US20060059091A1 System and method for evaluating and enhancing source anonymity for encrypted web traffic 审中-公开
公开(公告)号：US20060059091A1
公开(公告)日：2006-03-16
申请号：US11263673
申请日：2005-10-31
申请人： Yi-Min Wang , Qixiang Sun , Daniel Simon , Wilfred Russell , Lili Qiu , Venkata Padmanabhan
发明人： Yi-Min Wang , Qixiang Sun , Daniel Simon , Wilfred Russell , Lili Qiu , Venkata Padmanabhan
IPC分类号： H04L9/00
CPC分类号： H04L63/0407 , G06F2221/2107 , G06F2221/2119 , G06Q20/10 , G06Q20/102 , G06Q20/1085 , G06Q20/40 , H04L63/1408
摘要： A system and method is provided for evaluating the effectiveness of data encryption for hiding the identity of the source of Web traffic. A signature is constructed from encrypted Web traffic for a Web page sent by a target Web site, and the signature is compared with archived traffic signatures obtained by accessing various Web pages of interest in advance. If the signature of the detected encrypted Web traffic matches a stored traffic signature beyond a pre-set statistical threshold, a positive match is found, and the source of the traffic is identified. Countermeasures for reducing the reliability of source identification based on traffic signature matching are provided.

8. 发明申请

US20110227704A1 RFID-BASED ENTERPRISE INTELLIGENCE 有权
标题翻译：基于RFID的企业智能化
公开(公告)号：US20110227704A1
公开(公告)日：2011-09-22
申请号：US13118997
申请日：2011-05-31
申请人： Venkata Padmanabhan , Lenin Ravindranath Sivalingam , Piyush Agrawal
发明人： Venkata Padmanabhan , Lenin Ravindranath Sivalingam , Piyush Agrawal
IPC分类号： G06K7/01
CPC分类号： H04Q9/00 , H04Q2209/47 , H04Q2209/845
摘要： An “RFID-Based Inference Platform” provides various techniques for using RFID tags in combination with other enterprise sensors to track users and objects, infer their interactions, and provide these inferences for enabling further applications. Specifically, observations are collected from combinations of RFID tag reads and other enterprise sensors including electronic calendars, user presence identifiers, cardkey access logs, computer logins, etc. Given sufficient observations, the RFID-Based Inference Platform automatically differentiates between tags associated with or affixed to people and tags affixed to objects. The RFID-Based Inference Platform then infers additional information including identities of people, ownership of specific objects, the nature of different “zones” in a workspace (e.g., private office versus conference room). These inferences are then used to enable various applications including object tracking, automated object ownership determinations, automated object cataloging, automated misplaced object alerts, video annotations, automated conference room scheduling, semi-automated object image catalogs, object interaction query systems, etc.
摘要翻译： “基于RFID的推理平台”提供了使用RFID标签与其他企业传感器结合跟踪用户和对象，推断其交互作用并提供这些推论以实现其他应用的各种技术。具体来说，从RFID标签读取和其他企业传感器的组合（包括电子日历，用户存在标识符，卡密钥访问日志，计算机登录等）收集观察结果。给定足够的观察结果，基于RFID的推理平台自动区分与或相关的标签贴在物体上的人和标签。然后，基于RFID的推理平台推出了包括人的身份，特定对象的所有权，工作空间（例如，私人办公室与会议室）中的不同“区域”的性质的附加信息。然后将这些推论用于启用各种应用程序，包括对象跟踪，自动对象所有权确定，自动对象编目，自动放错对象警报，视频注释，自动会议室调度，半自动对象图像目录，对象交互查询系统等。

9. 发明申请

US20080037536A1 SYSTEM AND METHOD FOR DETERMINING THE GEOGRAPHIC LOCATION OF INTERNET HOSTS 有权
标题翻译：用于确定互联网主机地理位置的系统和方法
公开(公告)号：US20080037536A1
公开(公告)日：2008-02-14
申请号：US11778490
申请日：2007-07-16
申请人： Venkata Padmanabhan , Lakshminarayanan Subramanian
发明人： Venkata Padmanabhan , Lakshminarayanan Subramanian
IPC分类号： H04L12/28
CPC分类号： H04L45/04 , H04L29/12066 , H04L41/12 , H04L61/1511 , H04L61/609 , H04L67/18 , H04W4/02
摘要： A system and methodologies are disclosed for determining the geographic location of an Internet host. A first method infers host location based on the DNS names of the host of interest or other nearby network nodes. A second method employs network delay measurements from geographically distributed locations to triangulate the coordinates of the host. A third method couples partial host-to-location mapping information obtained from one or more sources with BGP or other routing information in order to infer location of the host of interest.
摘要翻译：公开了用于确定因特网主机的地理位置的系统和方法。第一种方法根据感兴趣的主机的DNS名称或其他附近的网络节点来推断主机位置。第二种方法采用来自地理分布位置的网络延迟测量来对主机的坐标进行三角测量。第三种方法将从一个或多个源获得的部分主机到位置映射信息与BGP或其他路由信息相耦合，以便推断感兴趣的主机的位置。

10. 发明申请

US20050185578A1 Methods and systems for streaming data 有权
标题翻译：流数据的方法和系统
公开(公告)号：US20050185578A1
公开(公告)日：2005-08-25
申请号：US10787612
申请日：2004-02-25
申请人： Venkata Padmanabhan , Jiahe Wang , Philip Chou
发明人： Venkata Padmanabhan , Jiahe Wang , Philip Chou
IPC分类号： G01R31/08 , H04L12/18 , H04L12/56
CPC分类号： H04L12/185 , H04L41/5009 , H04L41/5035 , H04L43/0829 , H04L47/10 , H04L47/11 , H04L47/12 , H04L67/104 , H04L67/1089
摘要： A technique is disclosed that can efficiently control congestion, while supporting heterogeneity for streaming data among multiple computers in a network. A plurality of nodes is divided into a plurality of distribution trees within a computer network, wherein the data is divided into a plurality of prioritized layers. When a node experiences packet loss, the location of the congestion is inferred. If the congestion is at or near the outgoing link, outgoing traffic is shed to alleviate the congestion by shedding child node(s) receiving descriptions in the least important layer of data that the child node(s) are receiving. Similarly, if the congestion is at or near the incoming link, incoming traffic is shed by shedding parent nodes that are sending descriptions in the least important layer of data that the node is receiving. Nodes with available bandwidth are further instructed to subscribe to additional descriptions.
摘要翻译：公开了一种可以有效地控制拥塞的技术，同时支持网络中的多个计算机之间的流数据的异构性。多个节点被划分成计算机网络内的多个分配树，其中数据被分成多个优先化层。当节点遇到数据包丢失时，推断出拥塞的位置。如果拥塞处于或接近输出链路，则流出流量被减轻，以减轻子节点在子节点正在接收的最不重要的数据层中接收描述的缓冲来减轻拥塞。类似地，如果拥塞处于或接近传入链路，则通过在发送节点正在接收的最不重要的数据层中发送描述的父节点脱离传入流量。进一步指示具有可用带宽的节点订阅附加描述。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式