Study of the Server Selection and Topology-Aware in P2P Network

When we construct the peer-to-peer network, we should consider the physical network layer with the combination of logical topology to reduce queries' cost. Topology-aware algorithms can solve this problem, but they only pay attention to how to divide the locality. Nodes which have the same distance in physical network have the same locality. Each joining node is initially guided to find neighbour of the same locality to connect to. Some landmarks are set to help determine the locality. Topology-aware algorithms don't consider the position of the landmarks and quantity standard. Server selection is an important function in any replication based infrastructure, aiming at redirecting client requests to the "best" server. Previous methods of server selection focus that client is responsible for the server selection. They don't focus on server-side redirection schemes. In this paper, we propose the novel strategy of landmark (server) selection and discuss how to choose landmarks and how many landmarks we should use. We use a Transit-Stub topology structure, which is more conformed to Chinese Internet topology. And by simulation, we found the number of landmarks had more relationship with the number of nodes in all transit domains. The location of landmarks conforms to the Chinese ISPs' distribution. The simulation result shows that our strategy can get better topology perception and proper gain ratio.

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

[2]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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

[5]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

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

[7]  Shahpour Alirezaee,et al.  PNR: New Position based Routing Algorithm for Mobile Ad Hoc Networks , 2009 .

[8]  Ranjeet Singh Tomar,et al.  Position Based Routing for Mobile Ad Hoc Networks , 2008, 2008 Second UKSIM European Symposium on Computer Modeling and Simulation.

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

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

[11]  Shi Zhou,et al.  Chinese Internet AS-level topology , 2005, IET Commun..

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

[13]  Shervin Shirmohammadi,et al.  A survey of application-layer multicast protocols , 2007, IEEE Communications Surveys & Tutorials.

[14]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..