A Robust Algorithm for the Membership Management of Super-Peer Overlay
MMNS 2009 Proceedings of the 12th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Wired-Wireless Multimedia Networks and Services Management
A Two-Tiered Approach to Enabling Enhanced Service Discovery in Embedded Peer-to-Peer Systems
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
A case for content distribution in peer-to-peer networks
AMT'10 Proceedings of the 6th international conference on Active media technology
FloRA: flock-based resource allocation for decentralized distributed virtual environments
Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Adaptive service node placements in P2P-like architectures
ACACOS'12 Proceedings of the 11th WSEAS international conference on Applied Computer and Applied Computational Science
A self-similar super-peer overlay construction scheme for super large-scale P2P applications
Information Systems Frontiers
| Hi-index | 0.00 |
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.