公开(公告)号：US08351331B2

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

申请号：US12820825

申请日：2010-06-22

Applicant: Thomas Karagiannis ,  Christos Gkantsidis ,  Peter Bernard Key ,  Richard Harper ,  Abigail Sellen ,  Timothy Regan ,  Richard M. Banks ,  Ilias Raftopoulos ,  Dharmaiah Manjunath ,  Bozidar Radunovic

Inventor： Thomas Karagiannis ,  Christos Gkantsidis ,  Peter Bernard Key ,  Richard Harper ,  Abigail Sellen ,  Timothy Regan ,  Richard M. Banks ,  Ilias Raftopoulos ,  Dharmaiah Manjunath ,  Bozidar Radunovic

IPC: H04L12/28

CPC classification number: H04L47/14 ,  H04L43/045 ,  H04L43/0882 ,  H04L47/10 ,  H04L47/20 ,  H04L47/25 ,  H04L47/41 ,  H04W28/22 ,  H04W72/04 ,  H04W72/12

Abstract: A resource allocation framework for wireless/wired networks is described. In an embodiment, methods of end host based traffic management are described which operate separately from the underlying access control protocol within the network (e.g. wireless MAC protocol or TCP). The rate limits for each flow are set based on per-flow weights, which may be user specified, and based on an estimate of the utilization of the shared resource and the rate limits are adjusted periodically so that the resource is not underutilized or saturated. Some embodiments compute a virtual capacity of the resource which is adjusted to optimize the value of the utilization and then the virtual capacity is shared between flows according to the per-flow weights. Methods for estimating the utilization of a wireless network and the capacity of a broadband access link are also described.

Abstract translation: 描述了无线/有线网络的资源分配框架。 在一个实施例中，描述了基于终端主机的业务管理的方法，其与网络内的底层访问控制协议（例如，无线MAC协议或TCP）分开工作。 每个流的速率限制基于可以是用户指定的每流量权重，并且基于对共享资源的利用率的估计，并且周期性地调整速率限制，使得资源未被不充分利用或饱和。 一些实施例计算资源的虚拟容量，其被调整以优化利用的值，然后根据每流量权重在流之间共享虚拟容量。 还描述了用于估计无线网络的利用率的方法和宽带接入链路的容量。

公开(公告)号：US07912948B2

公开(公告)日：2011-03-22

申请号：US12097963

申请日：2006-12-02

Applicant: Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

Inventor： Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L29/06 ,  H04L67/108 ,  H04L67/22 ,  H04L67/24 ,  H04L69/329

Abstract: A wire protocol is described which implements connection management and other methods to give enhanced peer-to-peer content distribution. Connections between nodes can be placed in a “notify” state when they are idle but may soon yield useful content. This notify state is also used together with a content request/response cycle to allow a peer to evaluate content available at a neighbour. If no suitable content is available a notify state is entered. When new content is later received at the neighbour it is able to inform the requesting node to allow it to restart the content request/response cycle.

Abstract translation: 描述了一种实现连接管理和其他方法以提供增强的对等内容分发的有线协议。 节点之间的连接可以在空闲时处于“通知”状态，但可能会很快产生有用的内容。 该通知状态也与内容请求/响应周期一起使用，以允许对等体评估邻居可用的内容。 如果没有合适的内容可用，则输入通知状态。 当在邻居稍后接收到新内容时，能够通知请求节点允许其重启内容请求/响应周期。

公开(公告)号：US07849196B2

公开(公告)日：2010-12-07

申请号：US12097946

申请日：2006-12-04

Applicant: Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

Inventor： Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L67/06 ,  H04L67/1085

Abstract: A topology management process is implemented which involves removing or “tearing down” connections between nodes in certain situations in order to try to replace those connections with more optimal ones. Idle connections are torn down unless those are in a “notify” state; a notify state being one in which a request for content has been made to a neighbour but that neighbour has no available content as yet. Idle connections in a notify state are torn down only if they remain idle for a longer time than that required before an idle connection is torn down. To avoid problems caused by clusters of node forming and of loners being unable to join the cloud, network churn algorithms are taught. These involve requiring nodes to drop connections when specified conditions are met. Relative content distribution between connections is monitored and this information used to influence selection of those connections to drop.

Abstract translation: 实现了拓扑管理过程，其涉及在某些情况下删除或“拆除”节点之间的连接，以便尝试用更优选的连接替换这些连接。 空闲连接被拆除，除非它们处于“通知”状态; 通知状态是向邻居做出对内容的请求的通知状态，但是该邻居还没有可用的内容。 通知状态下的空闲连接只有在空闲连接断开之前保持空闲时间较长的时间才会被拆除。 为了避免由于节点形成的簇和不能加入云的孤岛造成的问题，教授了网络流失算法。 这些涉及要求节点在满足指定条件时删除连接。 监视连接之间的相对内容分配，并将此信息用于影响这些连接的选择。

公开(公告)号：US20090138486A1

公开(公告)日：2009-05-28

申请号：US12280872

申请日：2007-02-08

Applicant: Aamer Hydrie ,  John Miller ,  Anders E. Klemets ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Rebecca C. Weiss

Inventor： Aamer Hydrie ,  John Miller ,  Anders E. Klemets ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Rebecca C. Weiss

IPC: G06F17/00 ,  G06F15/16 ,  G06F15/00

CPC classification number: G06F21/50 ,  G06F21/10 ,  G06F21/64

Abstract: The invention describes a control node for a content distribution network and a method of automatically verifying content distributed over a network at a node in the network. In the method, a content description is received which comprises a content identifier, a publisher identifier, publisher authorisation information and content checking information. The integrity and validity of this information are checked and if both the checks are passed, the content description is stored.

Abstract translation: 本发明描述了一种用于内容分发网络的控制节点和一种在网络中的节点上自动验证通过网络分发的内容的方法。 在该方法中，接收包括内容标识符，发布者标识符，发行者授权信息和内容检查信息的内容描述。 检查该信息的完整性和有效性，并且如果两个检查都通过，则存储内容描述。

公开(公告)号：US20080320300A1

公开(公告)日：2008-12-25

申请号：US12097926

申请日：2006-12-04

Applicant: Christos Gkantsidis ,  John Miller ,  Stuart Ranson ,  Aamer Hydrie ,  Tan See-Mong ,  Pablo Rodriguez Rodriguez ,  Manuel Costa

Inventor： Christos Gkantsidis ,  John Miller ,  Stuart Ranson ,  Aamer Hydrie ,  Tan See-Mong ,  Pablo Rodriguez Rodriguez ,  Manuel Costa

IPC: H04L9/32 ,  H04L9/00

CPC classification number: G06F21/10 ,  G06F2221/0788

Abstract: The invention relates to content distribution over a network and provides methods of controlling the distribution, of receiving the content and of publishing content. The method of controlling distribution of content over a network includes receiving a content description and location information for a source of the content from a publisher, where the content description comprises authorisation details associated with the publisher. The validity of the authorisation details is checked and if found to be valid, the content description is provided to a node in the network

Abstract translation: 本发明涉及网络上的内容分发，并且提供了控制分发，接收内容和发布内容的方法。 通过网络控制内容分发的方法包括从发布者接收内容来源的内容描述和位置信息，其中内容描述包括与发布者相关联的授权细节。 检查授权细节的有效性，如果发现有效，则将内容描述提供给网络中的节点

公开(公告)号：US09729624B2

公开(公告)日：2017-08-08

申请号：US12097980

申请日：2006-12-04

Applicant: Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez ,  Stuart Ranson

Inventor： Christos Gkantsidis ,  John Miller ,  Manuel Costa ,  Pablo Rodriguez ,  Stuart Ranson

IPC: H04L29/08 ,  H03M13/37

CPC classification number: H04L67/104 ,  H03M13/3761 ,  H04L67/1076 ,  H04L67/108

Abstract: The invention provides methods of encoding content for distribution over a network and methods for decoding encoded content which has been distributed over the network. In a first example in which the content is divided into a plurality of segments and each segment comprising a plurality of blocks of data, the method comprises selecting a segment from the plurality of segments and selecting at least two blocks of the selected segment from a store of blocks. A new encoded block is created from a linear combination of the selected blocks.

公开(公告)号：US20120158858A1

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

申请号：US12969963

申请日：2010-12-16

Applicant: Christos Gkantsidis ,  Thomas Karagiannis ,  Dushyanth Narayanan ,  Antony Rowstron

Inventor： Christos Gkantsidis ,  Thomas Karagiannis ,  Dushyanth Narayanan ,  Antony Rowstron

IPC: G06F15/16 ,  G06F15/173

CPC classification number: H04L51/22

Abstract: Resource optimization for online services is described. In one example, objects (such as mailboxes or other data associated with an online service) are assigned to network elements (such as servers) by inferring a relationship graph from log data relating to usage of the online service. The graph has a node for each object, and connections between each pair of objects having data items in common. Each connection has a weight relating to the number of common data items. The graph is partitioned into a set of clusters, such that each cluster has nodes joined by connections with a high weight relative to the weight of connections between nodes in different clusters. The objects are then distributed to the network elements such that objects corresponding to nodes in the same cluster are located on the same network element.

Abstract translation: 描述了在线服务的资源优化。 在一个示例中，通过从与在线服务的使用相关的日志数据推断关系图，将对象（诸如邮箱或与在线服务相关联的其他数据）分配给网络元件（例如服务器）。 该图具有每个对象的节点，以及具有共同数据项的每对对象之间的连接。 每个连接具有与公共数据项的数量相关的权重。 该图被划分成一组集群，使得每个集群具有通过具有相对于不同集群中的节点之间的连接的权重的高权重的连接而连接的节点。 然后将对象分发到网络元件，使得与相同集群中的节点相对应的对象位于同一网络元件上。

公开(公告)号：US08059541B2

公开(公告)日：2011-11-15

申请号：US12125325

申请日：2008-05-22

Applicant: Thomas Karagiannis ,  Christos Gkantsidis ,  Peter Key ,  Elias Athanasopoulos

Inventor： Thomas Karagiannis ,  Christos Gkantsidis ,  Peter Key ,  Elias Athanasopoulos

IPC: G01R31/08

CPC classification number: H04L43/0817 ,  H04L41/14 ,  H04L43/026 ,  H04L47/10 ,  H04L47/125

Abstract: An end-host based network management system and methods are described. The methods are performed independently at each end-host within the network based on data on local flows which is shared between end-hosts. In an embodiment, an end-host shares data on constrained local flows with other end-hosts and receives such data from other end-hosts. Based on this data, the end-host determines which flows from other nodes are competing for a shared resource with a constrained local flow and allocates the capacity of the shared resource between all the competing flows. This allocation is then enforced for the local flow by the end-host. Other end-hosts with competing flows perform similar methods and through an iterative process the contention for the shared resource is resolved and the utilization of the shared resource is optimized.

Abstract translation: 描述基于终端主机的网络管理系统和方法。 基于在终端主机之间共享的本地流的数据，在网络内的每个终端主机上独立地执行这些方法。 在一个实施例中，终端主机与其他终端主机共享受限本地流上的数据，并从其他终端主机接收这样的数据。 基于该数据，终端主机确定来自其他节点的哪些流量与受约束的本地流竞争共享资源，并在所有竞争流之间分配共享资源的容量。 然后，该分配由终端主机强制执行本地流。 具有竞争流的其他终端主机执行类似的方法，并通过迭代过程解决共享资源的争用，并优化共享资源的利用。

公开(公告)号：US20100027424A1

公开(公告)日：2010-02-04

申请号：US12182493

申请日：2008-07-30

Applicant: Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

Inventor： Bozidar Radunovic ,  Christos Gkantsidis ,  Dinan Gunawardena ,  Peter B. Key

IPC: H04J3/14

CPC classification number: H04W40/04 ,  H04L45/127

Abstract: Methods and algorithms for path estimation in a wireless mesh network are described. In an embodiment, each node calculates its cost for a packet flow based on the back-log at the node and the cost of downstream neighbor nodes for the flow. The cost is communicated to the upstream neighbor nodes for the flow. When a node has an opportunity to transmit a packet, a flow is selected by the node based on the back-log at the node and the costs received from each of the downstream neighbor nodes. These costs are then also used to select a downstream neighbor node is selected based on the costs received from each of the downstream neighbor nodes. A packet re-ordering algorithm is also described which intercepts packets received at a node and delays delivery of the packet to the IP layer if an earlier packet in the sequence of packets has not been received.

Abstract translation: 描述了无线网状网络中路径估计的方法和算法。 在一个实施例中，每个节点基于节点的反向日志和流的下游邻居节点的成本来计算分组流的成本。 成本被传送到流的上游邻居节点。 当节点有传送数据包的机会时，节点根据节点的反向日志和从每个下游邻居节点接收的成本选择一个流。 这些成本然后也用于选择下游邻居节点，其基于从每个下游邻居节点接收的成本来选择。 还描述了分组重新排序算法，其拦截在节点处接收的分组，并且如果尚未接收到分组序列中的较早分组，则将分组的传送延迟到IP层。

公开(公告)号：US20090198825A1

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

申请号：US12301462

申请日：2007-04-05

Applicant: John L. Miller ,  Armando Garcia-Mendoza ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

Inventor： John L. Miller ,  Armando Garcia-Mendoza ,  Christos Gkantsidis ,  Pablo Rodriguez Rodriguez ,  Stuart Ranson

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L67/06 ,  H04L67/108

Abstract: Managing content by influencing its distribution in the form of blocks or other units is crucial to the performance of a peer-to-peer content distribution system. We provide a content management module at each peer node to achieve this. The content management module implements a content request/response cycle in order to negotiate about blocks of content with other peer nodes. This cycle comprises an offer request, offer reply and a block request. These steps are preferably followed by data exchange and verification. The negotiation protocol used by our content management module provides a generic method that is advantageously used in conjunction with different encoding schemes such as full network coding and group network coding. In one embodiment we use group network coding and add information to the offer request and offer reply to facilitate efficient content distribution. Block request messages are selected to promote the use of on-the-fly decoding where possible.

Abstract translation: 通过以块或其他单元的形式影响其分发来管理内容对于对等内容分发系统的性能至关重要。 我们在每个对等节点提供一个内容管理模块来实现这一点。 内容管理模块实现内容请求/响应周期，以便与其他对等节点协商内容块。 该周期包括报价请求，报价回复和块请求。 这些步骤最好是进行数据交换和验证。 我们的内容管理模块使用的协商协议提供了有利地与诸如全网络编码和组网络编码的不同编码方案结合使用的通用方法。 在一个实施例中，我们使用组网络编码并向提供请求添加信息并提供回复以促进有效的内容分发。 选择块请求消息以在可能的情况下促进即时解码的使用。