Cooperative Content Distribution: Scalability Through Self-Organization
Cooperative Content Distribution: Scalability Through Self-Organization
复制标题
协作内容分发：通过自组织实现可扩展性
DOI：
10.1007/11428589_22
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
E. Biersack
中科院分区：
文献类型：
--
作者：
P. Felber;E. Biersack
对等网络经常被吹捧为可扩展性的最终解决方案。虽然协作技术最初几乎专门用于内容查找和共享，但是对等范例的最有前途的应用之一是利用客户端对等端的带宽来快速分发大内容并承受突发拥挤（即，某些在线内容的流行度突然增加）。协作内容分发的前提是，网络的容量与其节点的资源之和一样高：网络中的节点越多，其聚合带宽就越高，并且它可以更好地扩展和服务新的节点。因此，这些网络可以通过利用现有资源自发地适应需求。在本文中，我们评估使用对等网络的内容分发在各种系统的假设，如对等到达率，带宽容量，合作策略，或对等生命周期。我们认为，合作网络的自缩放和自组织特性为具有成本效益，但高效和鲁棒的内容分发铺平了道路。
Peer-to-peer networks have often been touted as the ultimate solution to scalability. Although cooperative techniques have been initially used almost exclusively for content lookup and sharing, one of the most promising application of the peer-to-peer paradigm is to capitalize the bandwidth of client peers to quickly distribute large content and withstand flash-crowds (i.e., a sudden increase in popularity of some online content). Cooperative content distribution is based on the premise that the capacity of a network is as high as the sum of the resources of its nodes: the more peers in the network, the higher its aggregate bandwidth, and the better it can scale and serve new peers. Such networks can thus spontaneously adapt to the demand by taking advantage of available resources. In this paper, we evaluate the use of peer-to-peer networks for content distribution under various system assumptions, such as peer arrival rates, bandwidth capacities, cooperation strategies, or peer lifetimes. We argue that theself-scalingandself-organizingproperties of cooperative networks pave the way for cost-effective, yet highly efficient and robust content distribution.