Efficient Recovery from Organizational Disconnects in SkipNet

  • Nicholas J. A. Harvey
  • Michael B. Jones
  • Marvin Theimer
  • Alec Wolman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2735)

Abstract

SkipNet is a scalable overlay network that provides controlled data placement and routing locality guarantees by organizing data primarily by lexicographic ordering of string names. A key side-effect of the SkipNet design is that all nodes from an organization form one or a few contiguous overlay segments. When an entire organization disconnects from the rest of the system, repair of only a few pointers quickly enables efficient routing throughout the disconnected organization; full repair is done as a subsequent background task. These same operations can be later used to efficiently reconnect an organization’s SkipNet back into the global one.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cabrera, L.F., Jones, M.B., Theimer, M.: Herald: Achieving a global event notification service. In: Proceedings of the Eighth Workshop on Hot Topics in Operating Systems, HotOS-VIII (May 2001)Google Scholar
  2. 2.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research (2002)Google Scholar
  3. 3.
    Harvey, N.J.A., Dunagan, J., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. Technical Report MSR-TR-2002-92, Microsoft Research (2002)Google Scholar
  4. 4.
    Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems, USITS 2003 (March 2003)Google Scholar
  5. 5.
    Keleher, P., Bhattacharjee, S., Silaghi, B.: Are virtualized overlay networks too much of a good thing? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 225. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Labovitzan, C., Ahuja, A.: Experimental Study of Internet Stability and Wide- Area Backbone Failures. In: Fault-Tolerant Computing Symposium, FTCS (June 1999)Google Scholar
  7. 7.
    Oppenheimer, D., Ganapathi, A., Patterson, D.A.: Why do Internet services fail, and what can be done about it? In: Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems, USITS 2003 (March 2003)Google Scholar
  8. 8.
    Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. In: Workshop on Algorithms and Data Structures, pp. 437–449 (1989)Google Scholar
  9. 9.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM 2001 Conference (August 2001)Google Scholar
  10. 10.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed 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
  11. 11.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, pp. 149–160 (August 2001)Google Scholar
  12. 12.
    Vahdat, A., Chase, J., Braynard, R., Kostic, D., Rodriguez, A.: Self-organizing subsets: From each according to his abilities, to each according to his needs. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 76. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley (April 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nicholas J. A. Harvey
    • 1
  • Michael B. Jones
    • 1
  • Marvin Theimer
    • 1
  • Alec Wolman
    • 1
  1. 1.Microsoft ResearchRedmondUSA

Personalised recommendations