{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:20:04Z","timestamp":1737609604981,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423027"},{"type":"electronic","value":"9783540477280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47728-4_14","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T01:39:45Z","timestamp":1195004385000},"page":"137-146","source":"Crossref","is-referenced-by-count":0,"title":["On Implementation of Logical Time in Distributed Systems Operating over a Wireless IP Network"],"prefix":"10.1007","author":[{"given":"Denis A.","family":"Khotimsky","sequence":"first","affiliation":[]},{"given":"Igor A.","family":"Zhuklinets","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Leslie Lamport. Time, clocks, and the orderings of events in a distributed system. Communications of ACM, 21:558\u2013564, 1978.","journal-title":"Communications of ACM"},{"key":"14_CR2","unstructured":"Colin J. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In Proc. 11th Australian Comp. Sci. Conf., pages 56\u201366, 1988."},{"key":"14_CR3","first-page":"215","volume-title":"Proceedings of the International Workshop on Parallel and Distributed Algorithms","author":"F. Mattern","year":"1989","unstructured":"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\u2013226, Amsterdam, 1989. Elsevier Science Publishers."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B. Charron-Bost","year":"1991","unstructured":"Bernadette Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 39(1):11\u201316, September 1991.","journal-title":"Information Processing Letters"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(92)90028-T","volume":"43","author":"M. Singhal","year":"1992","unstructured":"Mukesh Singhal and Ajay Kshemkalyani. An efficient implementation of vector clocks. Information Processing Letters, 43(1):47\u201352, August 1992.","journal-title":"Information Processing Letters"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"J. Fowler and W. Zwaenepoel. Causal distributed breakpoints. In Proc. 10th Intl. Conf. Distributed Computing Systems (ICDCS-10), Paris, France, May-June 1990.","DOI":"10.1109\/ICDCS.1990.89277"},{"key":"14_CR7","unstructured":"Toshimitsu Masuzawa and Nobuki Tokura. A causal distributed breakpoint algorithm for distributed debugger. In Proceedings of ICICE Fall Conference (SD-1-8), pages 373\u2013374, 1992."},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-61769-8_6","volume-title":"Distributed Algorithms, 10th International Workshop, WDAG\u2019 96","author":"F. J. Torres-Rojas","year":"1996","unstructured":"Francisco J. Torres-Rojas and Mustaque Ahamad. Plausible clocks: Constant size logical clocks for distributed systems. In \u00d6zalp Babaoglu and Keith Marzullo, editors, Distributed Algorithms, 10th International Workshop, WDAG\u2019 96, volume1151 of Lecture Notes in Computer Science, pages 71\u201388, Bologna, Italy, October 1996. Springer Verlag."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Denis A. Khotimsky and Igor A. Zhuklinets. Hierarchical vector clock: Scalable plausible clockfor detecting causality in large distrbuted systems. In ICATM\u201999. Proceedings of the 2nd International Conference on ATM, pages 156\u2013163, Colmar, France, June 1999.","DOI":"10.1109\/ICATM.1999.786798"},{"issue":"9","key":"14_CR10","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/32.241768","volume":"19","author":"J. Ahuja","year":"1993","unstructured":"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\u2013855, September 1993.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"5","key":"14_CR11","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/A:1019134007206","volume":"3","author":"R. Prakash","year":"1997","unstructured":"Ravi Prakash and Mukesh Singhal. Dependency sequences and hierarchical clocks: Efficient alternatives to vector clockfor mobile computing systems. Wireless Networks, 3(5):349\u2013360, 1997.","journal-title":"Wireless Networks"},{"issue":"8","key":"14_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"C. J. Fidge","year":"1991","unstructured":"Colin J. Fidge. Logical time in distributed computing systems. Computer, 24(8):28\u201333, 1991.","journal-title":"Computer"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/32.637147","volume":"23","author":"K. Audenaert","year":"1997","unstructured":"Koenraad Audenaert. Clocktrees: Logical clocks for programs with nested parallelism. IEEE Transactions on Software Engineering, 23:646\u2013658, October 1997.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Charles E. Perkins, Editor. IP Mobility Support. Request for comments, RFC 2002. October 1996.","DOI":"10.17487\/rfc2002"},{"key":"14_CR15","unstructured":"Denis A. Khotimsky and Igor A. Zhuklinets. Compact bit-matrix clock with O(n) complexity of the off-line timestamp restoration. Unpublished manuscript, 2000."}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47728-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:11:58Z","timestamp":1737537118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47728-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423027","9783540477280"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-47728-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}