An Efficient Superpeer Overlay Construction and Broadcasting Scheme Based on Perfect Difference Graph

被引:10
作者
Li, Jung-Shian [1 ]
Chao, Chih-Hung [1 ]
机构
[1] Natl Cheng Kung Univ, Dept Elect Engn, Inst Comp & Commun Engn, Tainan 701, Taiwan
关键词
Unstructured peer-to-peer system; superpeer; perfect difference graph; forwarding algorithm; MANAGEMENT;
D O I
10.1109/TPDS.2009.94
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Two-layer hierarchy unstructured peer-to-peer (P2P) systems, comprising an upper layer of superpeers and an underlying layer of ordinary peers, are commonly used to improve the performance of large-scale P2P systems. However, the optimal superpeer network design involves several requirements including superpeer degree, network diameter, scalability, load balancing, and flooding performance. A perfect difference graph has desirable properties to satisfy the above design rationale of superpeers overlay network. This paper proposes a two-layer hierarchical unstructured P2P system in which a perfect difference graph (PDG) is used to dynamically construct and maintain the superpeer overlay topology. In addition, the broadcasting performance of the P2P system is enhanced through the use of a PDG-based forwarding algorithm, which ensures that each superpeer receives just one lookup query flooding message. The theoretical results show that the proposed system improves existing superpeer hierarchical unstructured P2P systems in terms of a smaller network diameter, fewer lookup flooding messages, and a reduced average delay, and the experimental results show that the proposed two-layer hierarchy P2P system performs very well in the dynamic network environment.
引用
收藏
页码:594 / 606
页数:13
相关论文
共 33 条
[1]  
[Anonymous], 2008, GNUTELLA PROTOCOL RE
[2]  
[Anonymous], 1998, Random graphs
[3]  
[Anonymous], IEEE COMM SURVEYS TU
[4]  
Baumert L.D., 1971, CYCLIC DIFFERENCE SE
[5]  
Chawathe Y., 2003, P ACM SIGCOMM
[6]  
CHU J, 2002, P SPIE
[7]   REVERSE PATH FORWARDING OF BROADCAST PACKETS [J].
DALAL, YK ;
METCALFE, RM .
COMMUNICATIONS OF THE ACM, 1978, 21 (12) :1040-1048
[8]   A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].
GALLAGER, RG ;
HUMBLET, PA ;
SPIRA, PM .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77
[9]  
GARTNER F, 2003, IC200338 SWISS FED I
[10]  
Kirkman T.P., 1857, T HIST SOC LANCASHIR, V9, P127