Optimal Gradient Clock Synchronization in Dynamic Networks

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

37 pages; conference version: 29th Annual ACM Symposium on Principles of Distributed Computing (PODC 2010)

Scientific paper

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 within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in this setting is to output a logical clock at each node, such that the logical clocks of any two nodes are not too far apart, and nodes that remain close to each other in the network for a long time are better synchronized than distant nodes. This property is called gradient clock synchronization. Gradient clock synchronization has been widely studied in the static setting, where the network topology does not change. We show that the asymptotically optimal bounds obtained for the static case also apply to our highly dynamic setting: if two nodes remain at distance d from each other for sufficiently long, it is possible to upper bound the difference between their clock values by O(d*log(D/d)), where D is the diameter of the network. This is known to be optimal for static networks, and since a static network is a special case of a dynamic network, it is optimal for dynamic networks as well. Furthermore, we show that our algorithm has optimal stabilization time: when a path of length d appears between two nodes, the time required until the clock skew between the two nodes is reduced to O(d*log(D/d)) is O(D), which we prove is optimal.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Optimal Gradient Clock Synchronization in Dynamic Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Gradient Clock Synchronization in Dynamic Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Gradient Clock Synchronization in Dynamic Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-298498

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.