Skip to main content

On Implementation of Logical Time in Distributed Systems Operating over a Wireless IP Network

  • Conference paper
  • First Online:
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2093))

Included in the following conference series:

  • 505 Accesses

Abstract

We address the problem of maintaining logical time in a distributed system operating over a special type of a network: one whose underlying graph is represented by fully-connected mesh of star-topology subgraphs. Such a graph is generated, for example, by a wireless IP networkin which mobility service agents, interconnected by an IP backbone, provide wireless connectivity to mobile hosts currently present in the associated location areas. We discuss the complementary logical clocks for the wireline and wireless segment of the networkand their integration into an isomorphic logical time system.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

references

  1. Leslie Lamport. Time, clocks, and the orderings of events in a distributed system. Communications of ACM, 21:558–564, 1978.

    Article  MATH  Google Scholar 

  2. Colin J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In Proc. 11th Australian Comp. Sci. Conf., pages 56–66, 1988.

    Google Scholar 

  3. Friedemann Mattern. Virtual time and global states of distributed systems. In M. Cosnard et al., editors, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215–226, Amsterdam, 1989. Elsevier Science Publishers.

    Google Scholar 

  4. Bernadette Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 39(1):11–16, September 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. Mukesh Singhal and Ajay Kshemkalyani. An efficient implementation of vector clocks. Information Processing Letters, 43(1):47–52, August 1992.

    Article  MATH  Google Scholar 

  6. J. Fowler and W. Zwaenepoel. Causal distributed breakpoints. In Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10), Paris, France, May-June 1990.

    Google Scholar 

  7. Toshimitsu Masuzawa and Nobuki Tokura. A causal distributed breakpoint algorithm for distributed debugger. In Proceedings of ICICE Fall Conference (SD-1-8), pages 373–374, 1992.

    Google Scholar 

  8. Francisco J. Torres-Rojas and Mustaque Ahamad. Plausible clocks: Constant size logical clocks for distributed systems. In Özalp Babaoglu and Keith Marzullo, editors, Distributed Algorithms, 10th International Workshop, WDAG’ 96, volume1151 of Lecture Notes in Computer Science, pages 71–88, Bologna, Italy, October 1996. Springer Verlag.

    Google Scholar 

  9. Denis A. Khotimsky and Igor A. Zhuklinets. Hierarchical vector clock: Scalable plausible clockfor detecting causality in large distrbuted systems. In ICATM’99. Proceedings of the 2nd International Conference on ATM, pages 156–163, Colmar, France, June 1999.

    Google Scholar 

  10. J. Ahuja, T. Carlson, and A. Gahlot. Passive-space and time view: Vector clocks for achieving higher performance, program correction, and distributed computing. IEEE Transactions on Software Engineering, 19(9):845–855, September 1993.

    Article  Google Scholar 

  11. Ravi Prakash and Mukesh Singhal. Dependency sequences and hierarchical clocks: Efficient alternatives to vector clockfor mobile computing systems. Wireless Networks, 3(5):349–360, 1997.

    Article  Google Scholar 

  12. Colin J. Fidge. Logical time in distributed computing systems. Computer, 24(8):28–33, 1991.

    Article  Google Scholar 

  13. Koenraad Audenaert. Clocktrees: Logical clocks for programs with nested parallelism. IEEE Transactions on Software Engineering, 23:646–658, October 1997.

    Article  Google Scholar 

  14. Charles E. Perkins, Editor. IP Mobility Support. Request for comments, RFC 2002. October 1996.

    Google Scholar 

  15. Denis A. Khotimsky and Igor A. Zhuklinets. Compact bit-matrix clock with O(n) complexity of the off-line timestamp restoration. Unpublished manuscript, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khotimsky, D.A., Zhuklinets, I.A. (2001). On Implementation of Logical Time in Distributed Systems Operating over a Wireless IP Network. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-47728-4_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42302-7

  • Online ISBN: 978-3-540-47728-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics