Load-Balancing Content Distribution in Structured Peer-to-Peer Networks

被引:0
作者
Han, Seung Chul [1 ]
机构
[1] Myongii Univ, Dept Comp Engn, Yongin, Gyeonggi, South Korea
来源
NCM 2008: 4TH INTERNATIONAL CONFERENCE ON NETWORKED COMPUTING AND ADVANCED INFORMATION MANAGEMENT, VOL 2, PROCEEDINGS | 2008年
关键词
D O I
10.1109/NCM.2008.120
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multimedia streaming distribution over peer-to-peer networks stresses both the server and network because of large volume of data, high bandwidth requirement, and many concurrent peers. While the server limitation can be circumvented by replicating the data at more peers, the network resource limitation is far less easy to cope with, due to the difficulty in determining the cause and location of congestion and in provisioning extra resources. In this paper, we present a novel scheme for streaming distribution that partitions the client-peers into appropriate groups, so that the congestion-level of each session are reduced and also well balanced. The core problem is stated as partitioning the clients into disjoint subsets according to the degree of interference criterion, which reflects network resource usage and the congestion among the concurrent connections. Through simulation, we show that the algorithm is simple yet effective in achieving the design goals, particularly, (1) congestion balancing in the network, (2) the network bandwidth usage.
引用
收藏
页码:519 / 524
页数:6
相关论文
共 22 条
[1]  
CALVERT K, 1997, IEEE COMMUNICATI JUN
[2]  
CHERKASOVA L, 2003, P 4 USITS SEATTL WA
[3]  
CHUN B, 2006, P IPTPS FEBR
[4]  
Cormen T. H., 2001, Introduction to Algorithms, V2nd
[5]  
HAN S, J REV
[6]   Constructing an optimal server set in structured peer-to-peer networks [J].
Han, Seung Chul ;
Xia, Ye .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2007, 25 (01) :170-178
[7]  
HEFEEDA M, 2003, P ACM MULT BERK CA N
[8]  
KAASHOEK F, 2003, P IPTPS BERK CA FEB
[9]  
KUMAR A, 2003, P 11 IEEE INT C NETW
[10]  
LI DS, 2005, P IEEE INF MIAM FL M