OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs (original) (raw)

Abstract

The design of scalable and robust overlay topologies has been a main research subject since the very origins of peerto-peer (p2p) computing. Today, the corresponding optimization tradeoffs are fairly well-understood, at least in the static case and from a worst-case perspective.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (25)

  1. Y. Afek, H. Kaplan, B. Korenfeld, A. Morrison, and R. E. Tarjan. Cbtree: a practical concurrent self-adjusting search tree. In Proc. 26th International Conference on Distributed Computing (DISC), pages 1-15, 2012.
  2. V. Aggarwal, A. Feldmann, and C. Scheideler. Can isps and p2p users cooperate for improved performance? SIGCOMM Comput. Commun. Rev., 37(3):29-40, 2007.
  3. B. Allen and I. Munro. Self-organizing binary search trees. J. ACM, 25:526-535, 1978.
  4. J. Aspnes and G. Shah. Skip graphs. ACM Transactions on Algorithms (TALG), 3(4), 2007.
  5. C. Avin, B. Haeupler, Z. Lotker, C. Scheideler, and S. Schmid. Locally self-adjusting tree networks. In Proc. 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013.
  6. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. Scribe: a large-scale and decentralized application-level multicast infrastructure. Selected Areas in Communications, IEEE Journal on, 20(8):1489 -1499, 2002.
  7. E. Demaine, D. Harmon, J. Iacono, and M. Patrascu. Dynamic optimality-almost. In Proc. Annual Symposium on Foundations of Computer Science (FOCS), volume 45, pages 484-490, 2004.
  8. J. Díaz, J. Petit, and M. Serna. A survey of graph layout problems. ACM Comput. Surv., 34(3):313-356, 2002.
  9. P. Druschel and A. Rowstron. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
  10. R. Eidenbenz, T. Locher, S. Schmid, and R. Wattenhofer. Boosting market liquidity of peer-to-peer systems through cyclic trading. In Proc. 12th IEEE International Conference on Peer-to-Peer Computing (P2P), 2012.
  11. H. Farvaresh and M. Sepehri. A branch and bound algorithm for bi- level discrete network design problem. Networks and Spatial Economics, 13(1):67-106, 2013.
  12. U. Feige and J. Lee. An improved approximation ratio for the minimum linear arrangement problem. Information Processing Letters, 101(1):26- 29, 2007.
  13. C. Gross, D. Stingl, B. Richerzhagen, A. Hemel, R. Steinmetz, and D. Hausheer. Geodemlia: A robust peer-to-peer overlay supporting location-based search. In Proc. 12th IEEE International Conference on Peer-to-Peer Computing (P2P), pages 25-36, 2012.
  14. L. H. Harper. Optimal assignment of numbers to vertices. J. SIAM, (12):131-135, 1964.
  15. R. Jacob, A. Richa, C. Scheideler, S. Schmid, and H. Täubig. A poly- logarithmic time algorithm for distributed self-stabilizing skip graphs. In Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), 2009.
  16. M. T. C. S. JIS. Computers and intractability a guide to the theory of np-completeness. 1979.
  17. D. Knuth. Optimum binary search trees. Acta informatica, 1(1):14-25, 1971.
  18. F. Kuhn, S. Schmid, and R. Wattenhofer. Towards worst-case churn resistant peer-to-peer systems. Distributed Computing Journal (DC), 22(4):249-267, 2010.
  19. J. Leitao, J. Marques, J. Pereira, and L. Rodrigues. X-bot: A protocol for resilient optimization of unstructured overlay networks. IEEE Transactions on Parallel and Distributed Systems, 99, 2012.
  20. T. Locher, R. Meier, S. Schmid, and R. Wattenhofer. Push-to-pull peer-to-peer live streaming. In Proc. 21st International Symposium on Distributed Computing (DISC), pages 388-402, 2007.
  21. K. Mehlhorn. Nearly optimal binary search trees. Acta Informatica, 5(4):287-295, 1975.
  22. C. Scheideler and S. Schmid. A distributed and oblivious heap. In Proc. 36th ICALP, 2009.
  23. D. Sleator and R. Tarjan. Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652-686, 1985.
  24. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM workshop on Online social networks, WOSN '09, pages 37-42, New York, NY, USA, 2009. ACM.
  25. C. Zhang, P. Dhungel, D. Wu, and K. W. Ross. Unraveling the BitTorrent Ecosystem. IEEE Transactions on Parallel and Distributed Systems, 22:1164-1177, 2011.