Scalable supernode selection in peer-to-peer overlay networks

被引:47
作者
Lo, V [1 ]
Zhou, DY [1 ]
Liu, YH [1 ]
GauthierDickey, C [1 ]
Li, J [1 ]
机构
[1] Univ Oregon, Network Res Grp, Eugene, OR 97403 USA
来源
Second International Workshop on Hot Topics in Peer-to-Peer Systems, Proceedings | 2005年
关键词
D O I
10.1109/HOT-P2P.2005.17
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We define a problem called the supemode selection problem which has emerged across a variety of peer-to-peer applications. Supernode selection involves selection of a subset of the peers to serve a special role. The supernodes must be well-dispersed throughout the peer-to-peer overlay network, and must fulfill additional requirements such as load balance, resource needs, adaptability to churn, and heterogeneity. While similar to dominating set and p-centers problems, the supernode selection problem must meet the additional challenge of operating within a huge, unknown and dynamically, changing network We describe three generic supernode selection protocols we have developed for peer-topeer environments: a label-based scheme for structured overlay networks, a distributed protocol for coordinate-based overlay networks, and a negotiation protocol for unstructured overlays. We believe an integrated approach to the supemode selection problem can benefit the peer-to-peer community through cross-fertilization of ideas and sharing of protocols.
引用
收藏
页码:18 / 25
页数:8
相关论文
共 23 条
[1]  
Dabek F., 2004, SIGCOMM'04
[2]  
Das B, 1997, ICC'97: 1997 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS - TOWARDS THE KNOWLEDGE MILLENNIUM, CONFERENCE RECORD - VOLS 1-3, P376, DOI 10.1109/ICC.1997.605303
[3]  
Estrin D., MOBICOM 99
[4]  
FERREIRA RA, 2004, ICPADS
[5]  
FRANCIS P, INFOCOM 99
[6]  
Handler G.Y., 1979, MIT Press Series in Signal Processing, Optimization, and Control
[7]  
Haynes T. W., 1998, FUNDAMENTALS DOMINAT
[8]  
KANG X, SIGCOMM 04
[9]  
KARLSSON M, INFOCOM 02
[10]  
LO V, IPTPS 04