research-article

Gradient clock synchronization in dynamic networks

Authors:

Rotem OshmanAuthors Info & Claims

SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Pages 270 - 279

https://doi.org/10.1145/1583991.1584059

Published: 11 August 2009 Publication History

Abstract

Over the last years, large-scale decentralized computer networks such as peer-to-peer and mobile ad hoc networks have become increasingly prevalent. The topologies of many of these networks are often highly dynamic. This is especially true for ad hoc networks formed by mobile wireless devices.

In this paper, we study the fundamental problem of clock synchronization in dynamic networks. We show that there is an inherent trade-off between the skew S guaranteed along sufficiently old links and the time needed to guarantee a small skew along new links. For any sufficiently large initial skew on a new link, there are executions in which the time required to reduce the skew on the link to O(S) is at least Ω(n/S).

We show that this bound is tight for moderately small values of S. Assuming a fixed set of $n$ nodes and an arbitrary pattern of edge insertions and removals, a weak dynamic connectivity requirement suffices to prove the following results. We present an algorithm that always maintains a skew of O(n) between any two nodes in the network. For a parameter S=Ω(√Án), where Á is the maximum hardware clock drift, it is further guaranteed that if a communication link between two nodes u, v persists in the network for Θ(n/S) time, the clock skew between u and v is reduced to no more than O(S).

References

[1]

H. Attiya, D. Hay, and J. Welch. Optimal clock synchronization under energy constraints in wireless ad-hoc networks. In Proc. of 9th Int. Conf. on Principles of Distributed Systems (OPODIS), pages 221--234, 2005.

Digital Library

[2]

H. Attiya, A. Herzberg, and S. Rajsbaum. Optimal clock synchronization under different delay assumptions. SIAM Journal on Computing, 25(2):369--389, 1996.

Digital Library

[3]

S. Biaz and J. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Information Processing Letters, 80(3):151--157, 2001.

Digital Library

[4]

D. Dolev, J. Halpern, B. Simons, and R. Strong. Dynamic fault-tolerant clock synchronization. Journal of the ACM, 42(1):143--185, 1995.

Digital Library

[5]

D. Dolev, J. Halpern, and H. Strong. On the possibility and impossibility of achieving clock synchronization. Journal of Computer and System Sciences, 32(2):230--250, 1986.

Digital Library

[6]

J. Elson, L. Girod, and D. Estrin. Fine-grained network time synchronization using reference broadcasts. ACM SIGOPS Operating Systems Review, 36(SI):147--163, 2002.

Digital Library

[7]

R. Fan, I. Chakraborty, and N. Lynch. Clock synchronization for wireless networks. In Proc of 8th Int. Conf. on Principles of Distributed Systems (OPODIS), pages 400--414, 2004.

Digital Library

[8]

R. Fan and N. Lynch. Gradient clock synchronization. Distributed Computing, 18(4):255--266, 2006.

Digital Library

[9]

D. K. Kaynar, N. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science). Morgan & Claypool Publishers, 2006.

Digital Library

[10]

F. Kuhn and R. Oshman. Gradient clock synchronization using reference broadcasts. arXiv:0905.3454v1, 2009. http://arxiv.org/abs/0905.3454v1.

[11]

L. Lamport and P. Melliar-Smith. Synchronizing clocks in the presence of faults. Journal of the ACM, 32(1):52--78, 1985.

Digital Library

[12]

C. Lenzen, T. Locher, and R. Wattenhofer. Clock synchronization with bounded global and local skew. In Prof. of 49th IEEE Symp. on Foundations of Computer Science (FOCS), pages 500--510, 2008.

Digital Library

[13]

C. Lenzen, T. Locher, and R. Wattenhofer. Tight bounds for clock synchronization. In Proc. of 28th ACM Symp. on Principles of Distributed Computing (PODC), 2009.

Digital Library

[14]

T. Locher and R. Wattenhofer. Oblivious gradient clock synchronization. In Proc. of 20th Int. Symp. on Distributed Computing (DISC), pages 520--533, 2006.

Digital Library

[15]

J. Lundelius and N. Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3):190--204, 1984.

[16]

N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996.

Digital Library

[17]

K. Marzullo and S. Owicki. Maintining the time in a distributed system. In Proc. of 2nd ACM Symp. on Principles of Distributed Computing (PODC), pages 44--54, 1983.

Digital Library

[18]

R. Ostrovsky and B. Patt-Shamir. Optimal and efficient clock synchronization under drifting clocks. In Proc. of 18th ACM Symp. on Principles of Distributed Computing (PODC), pages 400--414, 1999.

Digital Library

[19]

B. Patt-Shamir and S. Rajsbaum. A theory of clock synchronization. In Proc. of 26th ACM Symp. on Theory of Computing (STOC), pages 810--819, 1994.

Digital Library

[20]

T. Srikanth and S. Toueg. Optimal clock synchronization. Journal of the ACM, 34(3):626--645, 1987.

Digital Library

Cited By

Zhang QTseng L(2024)Fault-tolerant Consensus in Anonymous Dynamic Network2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00021(128-138)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00021
Kartal YSchmidt ESchmidt K(2016)Modeling Distributed Real-Time Systems in TIOA and UPPAALACM Transactions on Embedded Computing Systems10.1145/296420216:1(1-26)Online publication date: 23-Oct-2016
https://dl.acm.org/doi/10.1145/2964202
Yildirim KGurcan O(2014)Efficient Time Synchronization in a Wireless Sensor Network by Adaptive Value TrackingIEEE Transactions on Wireless Communications10.1109/TWC.2014.231616813:7(3650-3664)Online publication date: Jul-2014
https://doi.org/10.1109/TWC.2014.2316168
Show More Cited By

Index Terms

Gradient clock synchronization in dynamic networks
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
      2. Network flows
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows
  2. Randomness, geometry and discrete structures

Recommendations

Optimal gradient clock synchronization in dynamic networks
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily ...
Gradient clock synchronization
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clocks with bounded drift. Nodes compute logical clock values based on their ...
Gradient clock synchronization

We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clocks with bounded drift. Nodes compute logical clock values based on their ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '09: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

August 2009

370 pages

ISBN:9781605586069

DOI:10.1145/1583991

General Chair:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany)
,
Program Chair:
Michael A. Bender
Stony Brook University and Tokutek, Inc., USA

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPAA 09

Sponsor:

SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures

August 11 - 13, 2009

AB, Calgary, Canada

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
229
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang QTseng L(2024)Fault-tolerant Consensus in Anonymous Dynamic Network2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS60910.2024.00021(128-138)Online publication date: 23-Jul-2024
https://doi.org/10.1109/ICDCS60910.2024.00021
Kartal YSchmidt ESchmidt K(2016)Modeling Distributed Real-Time Systems in TIOA and UPPAALACM Transactions on Embedded Computing Systems10.1145/296420216:1(1-26)Online publication date: 23-Oct-2016
https://dl.acm.org/doi/10.1145/2964202
Yildirim KGurcan O(2014)Efficient Time Synchronization in a Wireless Sensor Network by Adaptive Value TrackingIEEE Transactions on Wireless Communications10.1109/TWC.2014.231616813:7(3650-3664)Online publication date: Jul-2014
https://doi.org/10.1109/TWC.2014.2316168
Yildirim KKantarci A(2014)External Gradient Time Synchronization in Wireless Sensor NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.5825:3(633-641)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1109/TPDS.2013.58
Casteigts AFlocchini PMans BSantoro N(2014)Measuring Temporal Lags in Delay-Tolerant NetworksIEEE Transactions on Computers10.1109/TC.2012.20863:2(397-410)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1109/TC.2012.208
Yildirim K(2014)Efficient and Discrete Gradient SynchronizationIEEE Communications Letters10.1109/LCOMM.2014.234678718:11(1903-1906)Online publication date: Nov-2014
https://doi.org/10.1109/LCOMM.2014.2346787
Brandes Pauf der Heide FBlin LBusnel Y(2012)Distributed computing in fault-prone dynamic networksProceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems10.1145/2414815.2414818(9-14)Online publication date: 17-Dec-2012
https://dl.acm.org/doi/10.1145/2414815.2414818
Pari NKailas ANogueira M(2012)Bio-inspired time synchronization for cognitive radio ad hoc networks2012 IEEE Globecom Workshops10.1109/GLOCOMW.2012.6477710(980-985)Online publication date: Dec-2012
https://doi.org/10.1109/GLOCOMW.2012.6477710
Fernández Anta AMilani AMosteiro MZaks S(2012)Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchronyDistributed Computing10.1007/s00446-012-0165-925:4(279-296)Online publication date: 22-Feb-2012
https://doi.org/10.1007/s00446-012-0165-9
Farach-Colton MFernández Anta AMilani AMosteiro MZaks S(2012)Opportunistic information dissemination in mobile ad-hoc networksProceedings of the 10th Latin American international conference on Theoretical Informatics10.1007/978-3-642-29344-3_26(303-314)Online publication date: 16-Apr-2012
https://dl.acm.org/doi/10.1007/978-3-642-29344-3_26
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents