On optimally reducing search costs for placing replicas in Symphony P2P networks

On optimally reducing search costs for placing replicas in Symphony P2P networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Peer-to-peer (P2P) overlay networks are widely employed in distributed systems. Furthermore, the number of hops required by a node for searching an object is the fundamental search cost of a P2P network. Hence, since placing replicas can efficiently reduce such a cost of the whole system, how to deploy replicas to reduce it as much as possible becomes a critical problem of P2P networks. In this study, the authors investigate this centre problem for the randomised P2P network ‘Symphony’. Particularly, the authors present a stochastic analysis on optimal replica placements, in terms of number of total hops, as well as proposing an optimal replica placement algorithm to perform a simulation study on this issue. Both the theoretical and experimental results show that locations of optimal replica placements in Symphony are not necessarily closest to the target node in the identifier space. Hence, based on the results, the authors evaluate one existing simple but experimentally efficient replica placement strategy, which exactly allocates replicas at nodes closest to the target node, to provide some guidelines on designing more efficient strategy applicable to the real-world Symphony.


    1. 1)
    2. 2)
    3. 3)
      • 3. Manku, G.S., Bawa, M., Raghavan, P.: ‘Symphony: distributed hashing in a small world’. Proc. USENIX Symp. Internet Technologies and Systems, 2003, pp. 127140.
    4. 4)
      • 4. Dabek, F., Kaashoek, M.F., Karger, D.R., Morris, R., Stoica, I.: ‘Wide area cooperative storage with CFS’. Proc. ACM Symp. Operating Systems Principles (SOSP), 2001, pp. 202215.
    5. 5)
      • 5. Ramasubramanian, V., Sirer, E.G.: ‘The design and implementation of a next generation name service for the Internet’. Proc. ACM SIGCOMM, August 2004, pp. 331342.
    6. 6)
      • 6. Gnutella,, 2012.
    7. 7)
      • 7. Freenet,, 2012.
    8. 8)
    9. 9)
    10. 10)
      • 10. Rowstron, A., Druschel, P.: ‘Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems’. Proc. the 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware 2001), November 2001, pp. 329350.
    11. 11)
      • 11. Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: ‘A scalable content-addressable network’. Proc. ACM SIGCOMM, 2001, pp. 161172.
    12. 12)
    13. 13)
      • 13. Chen, J.-B.: ‘Fuzzy based approach for P2P file sharing detection’, J. Internet Technol., 2011, 12, (6), pp. 921929.
    14. 14)
    15. 15)
    16. 16)
      • 16. Yang, C.-T., Leu, F.-Y., Yang, M.-F.: ‘A peer-to-peer video file resource sharing system for mobile devices’, J. Internet Technol., 2010, 11, (1), pp. 6978.
    17. 17)
      • 17. Cheng, X., Liu, J.: ‘NetTube: exploring social networks for peer-to-peer short video sharing’. Proc. INFOCOM 2009, 2009, pp. 11521160.
    18. 18)
      • 18. Thain, D., Bent, J., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H., Livny, M.: ‘Pipeline and batch sharing in grid workloads’. Proc. 12th IEEE Int'l ACM Symp. High-Performance Parallel and Distributed Computing, 2003, pp. 152161.
    19. 19)
    20. 20)
      • 20. Mondal, A., Lifu, Y., Kitsuregawa, M.: ‘On improving the performance dependability of unstructured P2P systems via replication’, in Takizawa, M., Traunmüller, R. (Eds.): ‘Data base and expert systems applications’ (Springer-Verlag, Berlin, Germany, 2004), vol. 3180, pp. 601610.
    21. 21)
      • 21. Rowstron, A.I.T., Druschel, P.: ‘Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility’. Proc. ACM Symp. Operating Systems Principles (SOSP), 2001, pp. 188201.
    22. 22)
      • 22. Ramasubramanian, V., Sirer, E.G.: ‘Beehive: exploiting power law query distributions for O(1) lookup performance in peer to peer overlays’. Int. Symp. Networked Systems Design and Implementation, San Francisco CA, March 2004, pp. 331342.
    23. 23)
      • 23. Ghodsi, A., Alima, L.O., Haridi, S.: ‘Symmetric replication for structured peer-to-peer systems’. Proc. Int. Workshops on Databases, Information Systems, and Peer-to-Peer Computing, 2005, pp. 7485.
    24. 24)
      • 24. Saroiu, S., Gummadi, K., Gribble, S.: ‘A measurement study of peer-to-peer file sharing systems’. Proc. Multimedia Computing and Networking Conf. (MMCN), January 2002, pp. 156170.
    25. 25)
    26. 26)
      • 26. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: ‘Introduction to algorithms’ (MIT Press and McGraw-Hill, 2001, 2nd edn.).
    27. 27)
      • 27. Zink, M., Suh, K., Gu, Y., Kurose, J.: ‘Watch global cache local: YouTube network traces at a campus network – measurements and implications’. ACM/SPIE Conf. Multimedia Computing and Networking, 2008.
    28. 28)
      • 28. Knuth, D.E.: ‘The art of computer programming vol 4, Fascicle 1: bitwise tricks & techniques; binary decision diagrams’ ‘(Addison-Wesley Professional, 2009).
    29. 29)
      • 29. Bertsekas, D.P.: ‘Nonlinear programming’ (Athena Scientific, Cambridge, MA, 1999, 2nd edn.).

Related content

This is a required field
Please enter a valid email address