Skip to main content
SpringerLink
Log in

An Analysis Framework for Distributed Hierarchical Directories

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We provide a novel analysis framework for distributed hierarchical directories for an arbitrary set of dynamic (online) requests. We first present a generic algorithm for implementing a distributed directory that can support dynamic requests and prove an upper bound on the competitive ratio for communication cost experienced by this algorithm using the analysis framework. We then give bounds for the dynamic performance of several known distributed directory protocols. For the protocols that work in general network topologies, we obtain \(\mathcal {O}(\log^{2} n\cdot\log D)\) competitive ratio, where n and D are the number of nodes and the diameter, respectively, of the network. Moreover, for the protocols that work in specific network topologies, we obtain \(\mathcal {O}(\log D)\) competitive ratio. Our analysis framework captures both the time and the distance restrictions in ordering dynamic requests through a notion of time windows, which may be of independent interest. To the best of our knowledge, this is the first competitive dynamic analysis for distributed hierarchical directories.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Algorithm 1
Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. As the algorithm forms a distributed queue, the predecessor node of a requesting node is the node that issued the request that is ordered before the request from the requesting node in the distributed queue; see Sect. 3 for details.

References

  1. Abraham, I., Dolev, D., Malkhi, D.: Lls: a locality aware location service for mobile ad hoc networks. In: Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 75–84. ACM, New York (2004)

    Chapter  Google Scholar 

  2. Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L.J.: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theor. Comput. Sci. 130(1), 175–201 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Amouris, K., Papavassiliou, S., Li, M.: A position-based multi-zone routing protocol for wide area mobile ad-hoc networks. In: Proceedings of the IEEE 49th Vehicular Technology Conference (VTC), vol. 2, pp. 1365–1369 (1999)

    Google Scholar 

  4. Attiya, H., Gramoli, V., Milani, A.: A provably starvation-free distributed directory protocol. In: Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 405–419 (2010)

    Chapter  Google Scholar 

  5. Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), vol. 2, pp. 503–513 (1990)

    Chapter  Google Scholar 

  6. Awerbuch, B., Peleg, D.: Online tracking of mobile users. J. ACM 42(5), 1021–1058 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp. 184–193 (1996)

    Google Scholar 

  8. Bejerano, Y., Cidon, I.: An efficient mobility management strategy for personal communication systems. In: Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pp. 215–222 (1998)

    Chapter  Google Scholar 

  9. Demirbas, M., Arora, A., Nolte, T., Lynch, N.: Brief announcement: Stalk: a self-stabilizing hierarchical tracking service for sensor networks. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC), p. 378. ACM, New York (2004)

    Chapter  Google Scholar 

  10. Demirbas, M., Arora, A., Nolte, T., Lynch, N.: A hierarchy-based fault-local stabilizing algorithm for tracking in sensor networks. In: Higashino, T. (ed.) Principles of Distributed Systems. Lecture Notes in Computer Science, vol. 3544, pp. 299–315. Springer, Berlin (2005)

    Chapter  Google Scholar 

  11. Demmer, M.J., Herlihy, M.: The arrow distributed directory protocol. In: Proceedings of the 12th International Symposium on Distributed Computing (DISC), pp. 119–133 (1998)

    Google Scholar 

  12. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485–497 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gupta, A.: Steiner points in tree metrics don’t (really) help. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 220–227 (2001)

    Google Scholar 

  14. Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195–208 (2007)

    Article  MATH  Google Scholar 

  15. Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. 39(6), 875–901 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kuhn, F., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 294–301 (2004)

    Chapter  Google Scholar 

  17. Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, R.: A scalable location service for geographic ad hoc routing. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 120–130. ACM, New York (2000)

    Google Scholar 

  18. Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036–1053 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  19. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61–77 (1989)

    Article  MathSciNet  Google Scholar 

  20. Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R., Sinha, P. (eds.) Distributed Computing and Networking. Lecture Notes in Computer Science, vol. 7730, pp. 378–392. Springer, Berlin (2013)

    Chapter  Google Scholar 

  21. Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: Proceedings of the 2012 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1045–1056 (2012)

    Chapter  Google Scholar 

  22. Zhang, B., Ravindran, B.: Brief announcement: Relay: a cache-coherence protocol for distributed transactional memory. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), pp. 48–53 (2009)

    Chapter  Google Scholar 

  23. Zhang, B., Ravindran, B.: Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory. In: Proceedings of the 2010 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1–11 (2010)

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for their careful reading and very constructive suggestions.

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Louisiana State University, Baton Rouge, LA, 70803, USA

    Gokarna Sharma & Costas Busch

Authors
  1. Gokarna Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Costas Busch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gokarna Sharma.

Additional information

This paper extends a preliminary version that appeared in The 14th International Conference on Distributed Computing and Networking (ICDCN), January 3–6, 2013 [20].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sharma, G., Busch, C. An Analysis Framework for Distributed Hierarchical Directories. Algorithmica 71, 377–408 (2015). https://doi.org/10.1007/s00453-013-9803-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-013-9803-2

Keywords

Search

Navigation