skip to main content
research-article

Structured overlay for heterogeneous environments: Design and evaluation of oscar

Published:25 February 2010Publication History
Skip Abstract Section

Abstract

Recent years have seen advances in building large Internet-scale index structures, generally known as structured overlays. Early structured overlays realized distributed hash tables (DHTs) which are ill suited for anything but exact queries. The need to support range queries necessitates systems that can handle uneven load distributions. However such systems suffer from practical problems—including poor latency, disproportionate bandwidth usage at participating peers, or unrealistic assumptions on peers' homogeneity, in terms of available storage or bandwidth resources. In this article we consider a system that is not only able to support uneven load distributions but also to operate in heterogeneous environments, where each peer can autonomously decide how much of its resources to contribute to the system. We provide the theoretical foundations of realizing such a network and present a newly proposed system Oscar based on these principles. Oscar can construct efficient overlays given arbitrary load distributions by employing a novel scalable network sampling technique. The simulations of our system validate the theory and evaluate Oscar's performance under typical challenges, encountered in real-life large-scale networked systems, including participant heterogeneity, faults, and skewed and dynamic load-distributions. Thus the Oscar distributed index fills in an important gap in the family of structured overlays, bringing into life a practical Internet-scale index, which can play a crucial role in enabling data-oriented applications distributed over wide-area networks.

Skip Supplemental Material Section

Supplemental Material

References

  1. Aberer, K. 2001. P-Grid: A self-organizing access structure for P2P information systems. In Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aberer, K., Datta, A., Hauswirth, M., and Schmidt, R. 2005. Indexing data-oriented overlay networks. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB). VLDB Endowment, 685--696. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Angluin, D., Aspnes, J., Chen, J., Wu, Y., and Yin, Y. 2005. Fast construction of overlay networks. In Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Aspnes, J., Diamadi, Z., and Shah, G. 2002. Fault-tolerant routing in peer-to-peer systems. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC). 223--232. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Aspnes, J., Kirsch, J., and Krishnamurthy, A. 2004. Load balancing and locality in range-queriable data structures. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC). 115--124. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Aspnes, J. and Shah, G. 2003. Skip graphs. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia, PA, 384--393. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Barbella, D., Kachergis, G., Liben-Nowell, D., Sallstrom, A., and Sowell, B. 2007. Depth of field and cautious-greedy routing in social networks. In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07). 574--586. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Barrière, L., Fraigniaud, P., Kranakis, E., and Krizanc, D. 2001. Efficient routing in networks with long range contacts. In Proceedings of the 15th International Conference on Distributed Computing (DISC'01). Springer-Verlag, London, UK, 270--284. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Bharambe, A. R., Agrawal, M., and Seshan, S. 2004. Mercury: supporting scalable multiattribute range queries. SIGCOMM Comput. Comm. Rev. 34, 4, 353--366. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Breslau, L., Cao, P., Fan, L., Phillips, G., and Shenker, S. 1999. Web caching and Zipf-like distributions: evidence and implications. In Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), vol. 1, 126--134.Google ScholarGoogle Scholar
  11. Ganesan, P., Bawa, M., and Garcia-Molina, H. 2004. Online balancing of range-partitioned data with applications to peer-to-peer systems. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). VLDB Endowment, 444--455. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ghodsi, A. 2006. Distributed k-ary System: Algorithms for distributed hash tables. Ph.D. thesis, KTH—Royal Institute of Technology.Google ScholarGoogle Scholar
  13. Giakkoupis, G. and Hadzilacos, V. 2005. A scheme for load balancing in heterogenous distributed hash tables. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). 302--311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Giakkoupis, G. and Hadzilacos, V. 2007. On the complexity of greedy routing in ring-based peer-to-peer networks. In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (PODC). 99--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Girdzijauskas, S., Datta, A., and Aberer, K. 2005. On small world graphs in non-uniformly distributed key spaces. In Proceedings of the 21st International Conference on Data Engineering Workshops (ICDEW). 1187. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Girdzijauskas, S., Datta, A., and Aberer, K. 2006. Oscar: Small-world overlay for realistic key distributions. In Proceedings of the 4th International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P).Google ScholarGoogle Scholar
  17. Godfrey, B., Lakshminarayanan, K., Surana, S., Karp, R., and Stoica, I. 2004. Load balancing in dynamic structured P2P systems. In Proceedings of IEEE INFOCOM.Google ScholarGoogle Scholar
  18. Guerraoui, R., Handurukande, S. B., Huguenin, K., Kermarrec, A.-M., Fessant, F. L., and Riviere, E. 2006. Gosskip, an efficient, fault-tolerant and self organizing overlay using gossip-based construction and skip-lists principles. In Proceedings of the IEEE International Conference on Peer-to-Peer Computing 12--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Harvey, N. J. A., Jones, B., M., Saroiu, S., Theimer, M., and Wolman, A. 2003. Skipnet: A scalable overlay network with practical locality properties. In Proceedings of the USENIX Symposium on Internet Technologies. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Hellerstein, J. M. 2003. Toward network data independence. SIGMOD Rec. 32, 3, 34--40. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Statis. Assoc. 58, 13--30.Google ScholarGoogle ScholarCross RefCross Ref
  22. Hui, K. Y., Lui, J. C., and Yau, D. K. October, 2006. Small-world overlay p2p networks: Construction and handling dynamic flash crowd. Comput. Netw. J. 50, 15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Karger, D. R. and Ruhl, M. 2004. Simple efficient load balancing algorithms for peer-to-peer systems. In Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'04). 36--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Kleinberg, J. 2000. The small-world phenomenon: an algorithm perspective. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'00). 163--170. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Li, X., Misra, J., and Plaxton, C. G. 2004. Active and concurrent topology maintenance. In Proceedings of the 18th Annual Conference on Distributed Computing (DISC). Springer, 320--334.Google ScholarGoogle Scholar
  26. Liben-Nowell, D., Balakrishnan, H., and Karger, D. 2002. Analysis of the evolution of peer-to-peer systems. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC). 233--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Manku, G. S., Bawa, M., Raghavan, P., and Inc, V. 2003. Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems. 127--140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Manku, G. S., Naor, M., and Wieder, U. 2004. Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC'04). 54--63. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Mitzenmacher, M., Richa, A. W., and Sitaraman, R. 2001. The power of two random choices: a survey of techniques and results. In Handbook of Randomized Computing, Kluwer, 255--312.Google ScholarGoogle Scholar
  30. Novak, D. and Zezula, P. 2006. M-chord: a scalable distributed similarity search structure. In Proceedings of the 1st International Conference on Scalable Information Systems (InfoScale). 19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., and Stoica, I. 2003. Load balancing in structured p2p systems. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS).Google ScholarGoogle Scholar
  32. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. 2001. A scalable content-addressable network. SIGCOMM Comput. Commun. Rev. 31, 4, 161--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Rowstron, A. and Druschel, P. 2001. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Shaker, A. and Reeves, D. S. 2005. Self-stabilizing structured ring topology p2p systems. In Proceedings of the IEEE International Conference on Peer-to-Peer Computing. IEEE Computer Society, 39--46. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM). 149--160. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Stutzbach, D., Rejaie, R., and Sen, S. 2005. Characterizing unstructured overlay topologies in modern p2p file-sharing systems. In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement (IMC). USENIX Association, Berkeley, CA, 5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Zipf, G. K. 1929. Relative frequency as a determinant of phonetic change. Harvard Studies Classical Philology 40, 1--95.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Structured overlay for heterogeneous environments: Design and evaluation of oscar

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!