-
1.发明申请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
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.发明申请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.发明申请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
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流量的签名与存储的流量签名匹配超过预定的统计阈值，则找到正匹配，并且识别流量的来源。 提供了基于流量特征匹配降低源识别可靠性的对策。
-
4.发明申请公开(公告)号：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.
-
5.发明授权Method for determining placement of internet taps in wireless neighborhood networks 有权确定无线邻居网络中互联网点击的位置的方法公开(公告)号：US08315196B2
公开(公告)日：2012-11-20
申请号：US10780262
申请日：2004-02-17
申请人： Lili Qiu , Kamal Jain , Ranveer Chandra , Mohammad Mahdian
发明人： Lili Qiu , Kamal Jain , Ranveer Chandra , Mohammad Mahdian
IPC分类号： H04H20/71
摘要： Disclosed is a method for determining the placement of ITAPs in wireless neighborhood networks. The method disclosed provides for efficient integration of multi-hop wireless networks with the Internet by placing ITAPs at strategic locations. Initially the method provides for the formulation of the ITAP placement problem under three wireless models. For each model, methods are developed to efficiently place ITAPs in the networks. The methods aim to minimize the number of required ITAPs while guaranteeing users' bandwidth requirements. Next, a fault tolerance version of the placement method is presented that provides bandwidth guarantees in the presence of failures. Finally the methods are extended to take into account variable traffic demands by developing an approximation algorithm to simultaneously optimize ITAP placement based on demands over multiple periods.
摘要翻译： 公开了一种用于确定ITAP在无线邻域网络中的位置的方法。 所公开的方法通过将ITAP放置在战略位置来提供多跳无线网络与因特网的有效集成。 最初，该方法提供了三种无线模型下ITAP放置问题的制定。 对于每个模型，开发了有效地将ITAP放置在网络中的方法。 这些方法旨在最大限度地减少所需的ITAP数量，同时保证用户的带宽需求。 接下来，介绍了在出现故障时提供带宽保证的布局方法的容错版本。 最后，通过开发近似算法来扩展方法以考虑可变流量需求，以便在多个时期内根据需求同时优化ITAP布局。
-
6.发明授权Model and method for computing performance bounds in multi-hop wireless networks 失效用于计算多跳无线网络中性能范围的模型和方法公开(公告)号：US07860506B2
公开(公告)日：2010-12-28
申请号：US12273082
申请日：2008-11-18
IPC分类号： H04W40/00
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.
摘要翻译： 公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。 本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。 使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。 除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。
-
7.发明申请MODEL AND METHOD FOR COMPUTING PERFORMANCE BOUNDS IN MULTI-HOP WIRELESS NETWORKS 失效用于计算多层无线网络性能边界的模型和方法公开(公告)号：US20090086652A1
公开(公告)日：2009-04-02
申请号：US12273082
申请日：2008-11-18
IPC分类号： H04W84/00
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.
摘要翻译： 公开了一种用于计算多跳无线网络中的性能界限的通用模型和方法。 本发明不考虑在网络拓扑和/或工作负载中的均匀性或随机性假设下计算渐近性能界限，而是适应任何给定的网络，技术，干扰模型，路由范例和工作负载。 使用冲突图形式表征无线干扰对多跳无线网络性能的影响，详细描述了计算给定无线网络容量的上限和下限的方法。 除了计算网络容量之外，所公开的模型和方法还可以实现或受益于其他应用，包括最大化公平性并最小化最大链路利用率。
-
8.发明申请Method for determining placement of internet taps in wireless neighborhood networks 有权确定无线邻居网络中互联网点击的位置的方法公开(公告)号：US20050180329A1
公开(公告)日：2005-08-18
申请号：US10780262
申请日：2004-02-17
申请人： Lili Qiu , Kamal Jain , Ranveer Chandra , Mohammad Mahdian
发明人： Lili Qiu , Kamal Jain , Ranveer Chandra , Mohammad Mahdian
摘要： Disclosed is a method for determining the placement of ITAPs in wireless neighborhood networks. The method disclosed provides for efficient integration of multi-hop wireless networks with the Internet by placing ITAPs at strategic locations. Initially the method provides for the formulation of the ITAP placement problem under three wireless models. For each model, methods are developed to efficiently place ITAPs in the networks. The methods aim to minimize the number of required ITAPs while guaranteeing users' bandwidth requirements. Next, a fault tolerance version of the placement method is presented that provides bandwidth guarantees in the presence of failures. Finally the methods are extended to take into account variable traffic demands by developing an approximation algorithm to simultaneously optimize ITAP placement based on demands over multiple periods.
摘要翻译： 公开了一种用于确定ITAP在无线邻域网络中的位置的方法。 所公开的方法通过将ITAP放置在战略位置来提供多跳无线网络与因特网的有效集成。 最初，该方法提供了三种无线模型下ITAP放置问题的制定。 对于每个模型，开发了有效地将ITAP放置在网络中的方法。 这些方法旨在最大限度地减少所需的ITAP数量，同时保证用户的带宽需求。 接下来，介绍了在出现故障时提供带宽保证的布局方法的容错版本。 最后，通过开发近似算法来扩展方法以考虑可变流量需求，以便在多个时期内根据需求同时优化ITAP布局。
-
公开(公告)号：US07715353B2
公开(公告)日：2010-05-11
申请号：US11409132
申请日：2006-04-21
申请人： Kamal Jain , Paramvir Bahl , Lili Qiu , Vahab Mirrokni , Mohammadtaghi Hajiaghayi , Amin Saberi
发明人： Kamal Jain , Paramvir Bahl , Lili Qiu , Vahab Mirrokni , Mohammadtaghi Hajiaghayi , Amin Saberi
IPC分类号： H04Q7/24
CPC分类号： H04W28/16 , H04W48/12 , H04W52/325
摘要： Utilization of wireless access points (APs) is optimized by dynamically managing transmitted AP power levels of beacon packets to control wireless AP coverage. This permits traffic congestion at one wireless AP to be reduced and shifted to other wireless APs. AP coverage management is provided by a centralized mechanism that employs various interpretations and/or measurements of client received power to handle dynamic changes in client workloads. The control does not require protocol changes to clients that utilize a wireless AP and can also incorporate hand-off costs and/or manufacturer specified power level constraints. Thus, these techniques can be employed in existing wireless LANs without impacting clients. Various instances are employable with continuous power and/or discrete power based wireless APs, providing a non-client impacted means to increase throughput and/or load balance.
摘要翻译： 无线接入点（AP）的利用通过动态管理信标分组的传输AP功率级别来优化，以控制无线AP覆盖。 这允许一个无线AP的业务拥塞减少并转移到其他无线AP。 AP覆盖管理由集中式机制提供，该机制采用客户接收功率的各种解释和/或测量来处理客户端工作负载中的动态变化。 该控制不需要对使用无线AP的客户端进行协议更改，并且还可以包含切换成本和/或制造商规定的功率级别约束。 因此，这些技术可以在现有的无线LAN中使用，而不影响客户端。 基于连续功率和/或离散功率的无线AP可采用各种实例，提供非客户端影响的装置以增加吞吐量和/或负载平衡。
-
公开(公告)号：US07469143B2
公开(公告)日：2008-12-23
申请号：US10680549
申请日：2003-10-07
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.
-
-
-
-
-
-
-
-
-
搜索结果
43 条记录 (耗时 0.027 秒)