公开(公告)号：US07738404B2

公开(公告)日：2010-06-15

申请号：US11656465

申请日：2007-01-23

申请人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

发明人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L45/46 ,  H04L67/1046 ,  H04L67/1051 ,  H04L67/12

摘要： A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

摘要翻译： 提供了一种在分布式网络内对节点进行分组的方法。 示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。 接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。 在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。 从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。 在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。 基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

公开(公告)号：US20080175169A1

公开(公告)日：2008-07-24

申请号：US11656465

申请日：2007-01-23

申请人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

发明人： Supratim Deb ,  Srinivas Kashyap ,  Naidu K V M ,  Rajeev Rastogi ,  Anand Srinivasan

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L45/46 ,  H04L67/1046 ,  H04L67/1051 ,  H04L67/12

摘要： A method of grouping nodes within a distributed network is provided. The example method includes performing a leader node self determination operation by which each node within the distributed network determines whether to become a leader node or a non-leader node, each leader node being the leader of a group including at least one node. Next, requests are sent, from each leader node, requesting at least one non-leader node to join the group associated with the leader node. First received requests are accepted, at each non-leader node, such that accepting non-leader nodes transition from a non-leader node to a dependent node dependent upon the requesting leader node. A next set of requests are sent, from each remaining non-leader node, requesting to join the group associated with at least one leader node. A determination is made, at each requested leader node, as to whether to accept the non-leader node into the group associated with the requested leader node. Based on the determination, at each requested leader node, the non-leader node is either accepted into the group associated with the requested leader node, or is alternatively rejected from the group.

摘要翻译： 提供了一种在分布式网络内对节点进行分组的方法。 示例性方法包括执行前导节点自我确定操作，通过该前导节点自我确定操作，分布式网络内的每个节点确定是否成为领导节点或非前导节点，每个首领节点是包括至少一个节点的组的首领。 接下来，从每个领导节点发送请求，请求至少一个非前导节点加入与该领导节点相关联的组。 在每个非前导节点处接收第一接收的请求，使得接受非前导节点从非前导节点到依赖于请求的领导节点的依赖节点的转换。 从每个剩余的非前导节点发送下一组请求，请求加入与至少一个前导节点相关联的组。 在每个请求的领导节点处，确定是否将非前导节点接受到与所请求的领导节点相关联的组中。 基于确定，在每个请求的领导节点处，非前导节点被接受到与所请求的领导节点相关联的组中，或者被替代地从组中被拒绝。

公开(公告)号：US20090210489A1

公开(公告)日：2009-08-20

申请号：US12032755

申请日：2008-02-18

申请人： Supratim Deb ,  Rajeev Rastogi ,  Anand Srinivasan ,  Prakash Linga

发明人： Supratim Deb ,  Rajeev Rastogi ,  Anand Srinivasan ,  Prakash Linga

IPC分类号： G06F15/16

CPC分类号： H04L67/104 ,  H04L67/1076

摘要： The invention improves query response latency in a peer-to-peer network. The invention augments core neighbors included in a neighbor list of a peer node by selecting auxiliary neighbors for inclusion in the neighbor list of the peer node of a peer-to-peer network. In one embodiment, a method includes maintaining query frequency information associated with each of a plurality of peer nodes of the peer-to-peer network, selecting at least one of the peer nodes of the peer-to-peer network as an auxiliary neighbor using the query frequency information, and updating a neighbor list to include the at least one peer node selected as the at least one auxiliary neighbor. The core neighbors stored at a peer node attempt to minimize the worst-case query latency for that peer node. The auxiliary neighbors stored at the peer node attempt to reduce the average query latency for that peer node. The auxiliary neighbors may be used in any peer-to-peer system, such as Pastry, Tapestry, Chord, SkipGraph, and the like.

摘要翻译： 本发明改进了对等网络中的查询响应等待时间。 本发明通过选择用于包括在对等网络的对等节点的邻居列表中的辅助邻居来增加包括在对等节点的邻居列表中的核心邻居。 在一个实施例中，一种方法包括维护与所述对等网络的多个对等节点中的每一个相关联的查询频率信息，将对等网络中的至少一个对等节点选择为辅助邻居，使用 所述查询频率信息，以及更新邻居列表以包括被选择为所述至少一个辅助邻居的所述至少一个对等节点。 存储在对等节点处的核心邻居尝试最小化该对等节点的最差情况查询延迟。 存储在对等节点处的辅助邻居尝试减少该对等节点的平均查询延迟。 辅助邻居可以用于任何对等系统，例如糕点，挂毯，和弦，SkipGraph等。

公开(公告)号：US08798896B2

公开(公告)日：2014-08-05

申请号：US13498178

申请日：2009-10-27

申请人： Vikram Srinivasan ,  Avhishek Chatterjee ,  Samik Datta ,  Supratim Deb ,  Sharad Jaiswal

发明人： Vikram Srinivasan ,  Avhishek Chatterjee ,  Samik Datta ,  Supratim Deb ,  Sharad Jaiswal

IPC分类号： G08G1/00

CPC分类号： G08G1/0104

摘要： A method and system for increasing accuracy in estimating average time taken to travel through a chosen road segment is provided. The method includes determination of time taken by one or more vehicles to travel through the road segments. Further, correlated road segments for which time taken to travel through the correlated road segments is correlated with the time taken to travel through the chosen road segment, are identified. A data repository stores a list of the one or more correlated road segments. Among the correlated road segments, one or more preferred road segments that increases the accuracy in determining the average time taken to travel through the chosen road segment, is determined by at least one processor. Further, the processor estimates the average time taken to travel through the chosen road segment using, data corresponding to time taken to travel through, the preferred road segments and the chosen road segment.

摘要翻译： 提供了一种用于提高估计通过所选路段所需的平均时间的精度的方法和系统。 该方法包括确定一个或多个车辆行进通过道路段所花费的时间。 此外，识别通过相关道路段行驶的时间的相关路段与通过所选择的道路段所需的时间相关联。 数据存储库存储一个或多个相关道路段的列表。 在相关的道路段中，由至少一个处理器确定增加在确定通过所选道路段所需的平均时间的精度的一个或多个优选道路段。 此外，处理器估计通过所选道路段所需的平均时间，对应于通过所需时间，优选路段和所选路段的数据。

公开(公告)号：US20110299479A1

公开(公告)日：2011-12-08

申请号：US12801363

申请日：2010-06-04

申请人： Supratim Deb ,  Vikram Srinivasan

发明人： Supratim Deb ,  Vikram Srinivasan

IPC分类号： H04W8/00

CPC分类号： H04W28/18 ,  H04W16/14

摘要： Disclosed is a method and apparatus for allocating a whitespace spectrum associated with a plurality of access points. The method includes reporting a signal strength associated with each of a plurality of other access points to a central controller. The method includes aggregating a plurality of demands to produce an aggregate demand. Each of the plurality of demands is associated with one of a plurality of users. The method includes reporting the aggregated demand to the central controller. The method includes associating one of the plurality of users with the access point based on a user setting or associating one of the plurality of users based on an allocation by the central controller. The allocation from the central controller is based on the signal strength and the aggregated demand. The allocation indicates a frequency band from the set of frequency bands to be allocated by the access point to the user.

摘要翻译： 公开了一种用于分配与多个接入点相关联的空白频谱的方法和装置。 该方法包括将与多个其他接入点中的每一个相关联的信号强度报告给中央控制器。 该方法包括聚合多个需求以产生总需求。 多个需求中的每一个都与多个用户中的一个相关联。 该方法包括向中央控制器报告汇总的需求。 该方法包括基于用户设置或者基于中央控制器的分配关联多个用户中的一个来将多个用户中的一个与接入点相关联。 中央控制器的分配基于信号强度和总需求。 该分配指示由接入点分配给用户的频带组的频带。

公开(公告)号：US08375102B2

公开(公告)日：2013-02-12

申请号：US13267764

申请日：2011-10-06

申请人： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

发明人： Muriel Medard ,  Supratim Deb ,  Ralf Koetter

IPC分类号： G06F15/16

CPC分类号： H04L67/1095 ,  G06F17/30209 ,  H04L67/104

摘要： A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.

公开(公告)号：US08364188B2

公开(公告)日：2013-01-29

申请号：US12801365

申请日：2010-06-04

申请人： Vikram Srinivasan ,  Supratim Deb

发明人： Vikram Srinivasan ,  Supratim Deb

IPC分类号： H04W72/08

CPC分类号： H04W28/26 ,  H04J11/0023 ,  H04L5/0037

摘要： Disclosed is a method and apparatus for allocating a set of frequency bands to a plurality of access points. The method includes generating an interference map associated with the set of frequency bands and associated with the plurality of access points. The method includes aggregating a plurality of demands to produce an aggregate demand. Each of the plurality of demands associated with one of the plurality of access points. The method includes dynamically allocating the set of frequency bands to each of the plurality of access points based on the interference map and the aggregate demand.

摘要翻译： 公开了一种用于将一组频带分配给多个接入点的方法和装置。 所述方法包括生成与所述一组频带相关联并与所述多个接入点相关联的干涉图。 该方法包括聚合多个需求以产生总需求。 与多个接入点中的一个接入点相关联的多个需求中的每一个。 该方法包括基于干涉图和总需求来动态地将多组频带中的每一个频带分配给多个接入点。

公开(公告)号：US20120147822A1

公开(公告)日：2012-06-14

申请号：US12962926

申请日：2010-12-08

申请人： Supratim Deb ,  Vikram Srinivasan ,  Kanthi Nagaraj ,  Piyush Gupta

发明人： Supratim Deb ,  Vikram Srinivasan ,  Kanthi Nagaraj ,  Piyush Gupta

IPC分类号： H04W72/04

CPC分类号： H04W74/085 ,  H04W74/002 ,  H04W74/0833 ,  H04W74/0875

摘要： The present invention relates to a system and method for proportional-fair resource allocation for multi-rate random access. The method includes receiving, by a device, data packets to be transmitted to an access point on a shared uplink channel, and determining, by the device, whether or not to contend for access to the shared uplink channel based on a probability of access. The probability of access is based on a data transmission rate between the device and the access point.

摘要翻译： 本发明涉及用于多速率随机访问的比例公平资源分配的系统和方法。 该方法包括：通过设备接收要发送到共享上行链路信道上的接入点的数据分组，以及由设备基于接入概率确定是否竞争接入共享的上行链路信道。 访问的概率基于设备和接入点之间的数据传输速率。

公开(公告)号：US20060146791A1

公开(公告)日：2006-07-06

申请号：US11026483

申请日：2004-12-30

申请人： Supratim Deb ,  Muriel Medard

发明人： Supratim Deb ,  Muriel Medard

IPC分类号： H04L12/66

CPC分类号： H04L1/0041

摘要： A method, apparatus and computer program product for providing rapid information dissemination using network coding is presented. A coded message including a payload and a code vector, is transmitted from a first node of the network to a second node of the network. The information thus stored can also be retrieved by collecting code vectors from at least one node and viewing the collected code vectors as a matrix. A determination is made regarding whether a dimension of the matrix is equal to a predefined number. When the dimension of the matrix equals the predefined number, the information is retrieved using the collection of code vectors in the matrix.

摘要翻译： 提出了一种使用网络编码提供快速信息传播的方法，装置和计算机程序产品。 包括有效载荷和码矢量的编码消息从网络的第一节点传送到网络的第二节点。 这样存储的信息也可以通过收集来自至少一个节点的代码矢量并且将所收集的代码矢量作为矩阵来查看。 确定矩阵的尺寸是否等于预定数量。 当矩阵的维度等于预定义数量时，使用矩阵中的代码向量的集合来检索信息。

公开(公告)号：US09282464B2

公开(公告)日：2016-03-08

申请号：US14110612

申请日：2011-04-08

申请人： Supratim Deb ,  Piyush Gupta ,  Kanthi C N ,  Vikram Srinivasan

发明人： Supratim Deb ,  Piyush Gupta ,  Kanthi C N ,  Vikram Srinivasan

IPC分类号： H04W16/14 ,  H04W72/04 ,  H04W72/08 ,  H04W16/10

CPC分类号： H04W16/14 ,  H04W16/10 ,  H04W72/0453 ,  H04W72/085 ,  H04W72/087

摘要： QoS aware multi radio access point for operation in TV whitespaces is disclosed. The present invention relates to operation of access points and, particularly, to operation of access points in TV whitespaces. The AP is configured to intelligently choose the radios, determine available whitespaces in the spectrum and allocate radios to the available whitespaces in the spectrum. The method determines clients that need to be serviced by the AP and assigns each client associated with AP to one of the radios. In addition, the method also takes care of QoS requirements for different services and hence every service is addressed to satisfy its QoS requirements. The method ensures that there is maximum utilization of available whitespace spectrum by accounting for the spectrum specific characteristics. The method considers bands for operation are spread across the spectrum and allocates the clients based on the availability of bands throughout the spectrum.

摘要翻译： 公开了在电视空白中操作的QoS感知多无线接入点。 本发明涉及接入点的操作，特别涉及电视空间中接入点的操作。 AP被配置为智能地选择无线电，确定频谱中的可用空白，并将频谱中的可用空格分配无线电。 该方法确定AP需要服务的客户端，并将与AP关联的每个客户端分配给其中一个无线电。 另外，该方法还可以满足不同业务的QoS要求，从而满足其QoS要求。 该方法通过考虑频谱特性来确保可用空白频谱的最大利用。 该方法将波段的操作分散在频谱上，并根据频谱范围内的频带的可用性来分配客户端。