Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology

  • Jan Sacha
  • Jim Dowling
  • Raymond Cunningham
  • René Meier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4025)

Abstract

Peer-to-peer (P2P) systems are characterised by a wide disparity in peer resources and capabilities. In particular, a number of measurements on deployed P2P systems show that peer stability (e.g. uptime) varies by several orders of magnitude between peers. In this paper, we introduce a peer utility metric and construct a self-organising P2P topology based on this metric that allows the efficient discovery of stable peers in the system. We propose and evaluate a search algorithm and we show that it achieves significantly better performance than random walking. Our approach can be used by certain classes of applications to improve the availability and performance of system services by placing them on the most stable peers, as well as to reduce the amount of network traffic required to discover and use these services. As a proof-of-concept, we demonstrate the design of a naming service on the gradient topology.

References

  1. 1.
    Sen, S., Wong, J.: Analyzing peer-to-peer traffic across large networks. Transactions on Networking 12, 219–232 (2004)CrossRefGoogle Scholar
  2. 2.
    Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of Symposium on Operating Systems Principles, pp. 314–329 (2003)Google Scholar
  3. 3.
    Pouwelse, J., Garbacki, P., Epema, D., Sips, H.: The bittorrent p2p file-sharing system: Measurements and analysis. In: The 4th International Workshop on Peer-To-Peer Systems (2005)Google Scholar
  4. 4.
    Bhagwan, R., Savage, S., Voelker, G.M.: Understanding availability. In: The 2nd International Workshop on Peer-to-Peer Systems (2003)Google Scholar
  5. 5.
    Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. In: Proceedings of the USENIX 2004 Annual Technical Conference, pp. 127–140 (2004)Google Scholar
  6. 6.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. SIGCOMM Computer Communication Review 31(4), 149–160 (2001)CrossRefGoogle Scholar
  7. 7.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of the Conference on Applications, Technologies, Trchitectures, and Protocols for Computer Communications, pp. 161–172 (2001)Google Scholar
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proceedings of the 19th International Conference on Data Engineering, pp. 49–60 (2003)Google Scholar
  10. 10.
    Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark routing on overlay networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 34–44. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Montresor, A.: A robust protocol for building superpeer overlay topologies. In: Proceedings of the 4th International Conference on Peer-to-Peer Computing, pp. 202–209 (2004)Google Scholar
  12. 12.
    Mizrak, A.T., Cheng, Y., Kumar, V., Savage, S.: Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In: Proceedings of the 3rd IEEE Workshop on Internet Applications, pp. 104–111 (2003)Google Scholar
  13. 13.
    Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, pp. 127–140 (2003)Google Scholar
  14. 14.
    Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 5–14 (2002)Google Scholar
  15. 15.
    Morselli, R., Bhattacharjee, B., Srinivasan, A., Marsh, M.A.: Efficient lookup on unstructured topologies. In: Proceedings of 24th ACM Symposium on Principles of Distributed Computing, pp. 77–86 (2005)Google Scholar
  16. 16.
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of the 9th international Conference on Architectural Support for Programming Languages and Operating Systems, pp. 190–201 (2000)Google Scholar
  17. 17.
    Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load balancing in structured p2p systems. In: The 2nd International Workshop on Peer-to-Peer Systems (2003)Google Scholar
  18. 18.
    Jelasity, M., Babaoglu, O.: T-man: Gossip-based overlay topology management. In: The 3rd International Workshop on Engineering Self-Organising Applications (2005)Google Scholar
  19. 19.
    Sacha, J., Dowling, J.: A self-organising topology for master-slave replication in p2p environments. In: Proceedings of the 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing, pp. 52–64 (2005)Google Scholar
  20. 20.
    Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)Google Scholar
  21. 21.
    Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Jan Sacha
    • 1
  • Jim Dowling
    • 1
  • Raymond Cunningham
    • 1
  • René Meier
    • 1
  1. 1.Distributed Systems GroupTrinity CollegeDublin

Personalised recommendations