Average available capacity in structured peer-to-peer networks

被引：0

作者：

Information Security Lab., Shanghai Jiaotong University, Shanghai 200240, China ^{[1
]}

机构：

来源：

Jiefangjun Ligong Daxue Xuebao | 2009年 / 3卷 / 219-222期

关键词：

Available capacity - Average Distance - De Bruijn graphs - Out-degree - Uniform traffic;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

To describe the available capacity of the peer-to-peer networks the notion of average available capacity (AAC) was introduced to examine the effect of the application-level graphs on the available capacity of the peer-to-peer networks. AAC was defined as a strictly monotonic increasing function taking the average idle capacities as nodes and edges. In a uniform traffic network, the parameters determining AAC were found and expressed by the out-degree and the average distance of a graph. De Bruijn graph was proposed as an asymptotic optimal choice for maximum AAC. A lower bound on the out-degree in a peer-to-peer network which is higher than O (1) was also proposed to keep AAC of the network as high as that of Chord. It is proved that there is an unachievable upper bound on the average available capacity when the out-degree is higher than one.

引用