Constructing an optimal server set in structured peer-to-peer networks

To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each server in parallel. However, selecting the best set of servers from the set of all nodes that have the desired data is not a straightforward task, and the obtained performance can dramatically vary depending on the constructed server set. In this paper, we present two server selection schemes that generate optimal server sets with respect to the degree of interference(DOI) criterion and the worst link stress(WLS) criterion in a structured peer-to-peer network. After examining the correctness of the algorithms, we present simulation results demonstrating the benefits of the optimal server selection schemes. Through the simulation results, we conclude that the optimal selection schemes perform better than the random server-selection scheme in the following aspects: (1) load-balancing in the network and the worst-case link stress, (2) network resource used by the connections, including the number of links and total bandwidth, (3) response time, and (4) throughput of TCP connections.

[1]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[2]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[5]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[7]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[8]  Anees Shaikh,et al.  On the effectiveness of DNS-based server selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[10]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[11]  Rakesh Kumar,et al.  Optimal peer selection for P2P downloading and streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[12]  A. Zeitoun.  Scalable Parallel-Access for Mirrored Servers , 2002 .

[13]  Bharat K. Bhargava,et al.  PROMISE: peer-to-peer media streaming using CollectCast , 2003, MULTIMEDIA '03.

[14]  Sandhya Dwarkadas,et al.  Peer-to-peer information retrieval using self-organizing semantic overlay networks , 2003, SIGCOMM '03.

[15]  Allen Miu.  Performance Analysis of a Dynamic Parallel Downloading Scheme from Mirror Sites Throughout the Internet , 2000 .

[16]  Pablo Rodriguez,et al.  Parallel-access for mirror sites in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Honghui Lu,et al.  Peer-to-peer support for massively multiplayer games , 2004, IEEE INFOCOM 2004.

[18]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.