DocumentCode
976596
Title
Proximity-Aware Superpeer Overlay Topologies
Author
Jesi, Gian Paolo ; Montresor, Alberto ; Babaoglu, Ozalp
Author_Institution
Univ. of Bologna, Bologna
Volume
4
Issue
2
fYear
2007
Firstpage
74
Lastpage
83
Abstract
The concept of superpeer has been introduced to improve the performance of popular P2P applications. A superpeer is a "powerful" node that acts as a server for a set of clients, and as an equal with respect to other superpeers. By exploiting heterogeneity, the superpeer paradigm can lead to improved efficiency, without compromising the decentralized nature of P2P networks. The main issues in constructing superpeer-based overlays are the selection of superpeers and the association between superpeers and clients. Generally, superpeers are either run voluntarily (without an explicit selection process), or chosen among the "best" nodes in the network, for example those with the most abundant resources, such as bandwidth or storage. In several contexts, however, shared resources are not the only factor; latency between clients and superpeers may play an important role, for example in online games and IP-Telephony applications. This paper presents SG-2, a novel protocol for building and maintaining proximity-aware superpeer topologies. SG-2 uses a gossip-based protocol to spread messages to nearby nodes and a biology-inspired task allocation mechanism to promote the "best" nodes to superpeer status. The paper includes extensive simulation experiments to prove the efficiency, scalability and robustness of SG-2.
Keywords
peer-to-peer computing; protocols; telecommunication network topology; P2P applications; SG-2; biology-inspired task allocation mechanism; gossip-based protocol; proximity-aware superpeer overlay topologies; Communication system control; Delay; Insects; Network topology; Peer to peer computing; Physics computing; Protocols; Telecommunication traffic; Telephony; Traffic control;
fLanguage
English
Journal_Title
Network and Service Management, IEEE Transactions on
Publisher
ieee
ISSN
1932-4537
Type
jour
DOI
10.1109/TNSM.2007.070904
Filename
4383309
Link To Document