Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for mobile computing systems

Authors:
Ravi Prakash;Mukesh Singhal
Affiliations:
Computer Science Program, The University of Texas at Dallas, Richardson, TX;Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue, Columbus, OH
Venue:
Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
Year:
1997

Citing 5
Cited 7

Concerning the size of logical clocks in distributed systems

Information Processing Letters
Logical Time: Capturing Causality in Distributed Systems

Computer
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
The Challenges of Mobile Computing

Computer
Detecting causal relationships in distributed computations: in search of the holy grail

Distributed Computing

Logical Time in Distributed Software Systems

Programming and Computing Software
On Implementation of Logical Time in Distributed Systems Operating over a Wireless IP Network

ICN '01 Proceedings of the First International Conference on Networking-Part 1
The Hash History Approach for Reconciling Mutual Inconsistency

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Mobi_Causal: a protocol for causal message ordering in mobile computing systems

ACM SIGMOBILE Mobile Computing and Communications Review
Improving causality logging in mobile computing networks

ACM SIGMOBILE Mobile Computing and Communications Review
A causal multicast protocol for dynamic groups in cellular networks

Proceedings of the 2008 Euro American Conference on Telematics and Information Systems
Tracking highly mobile users using replicated databases

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vector clocks have been used to capture causal dependencies between processes in distributed computing systems. Vector clocks are not suitable for mobile computing systems due to (i) lack of scalability: its size is equal to the number of nodes, and (ii) its inability to cope with fluctuations in the number of nodes. This paper presents two efficient alternatives to vector clock, namely, sets of dependency sequences, and hierarchical clock. Both the alternatives are scalable and are immune to fluctuations in the number of nodes in the system.