TY - GEN
T1 - Network clock frequency synchronization
AU - Gurewitz, Omer
AU - Cidon, Israel
AU - Sidi, Moshe
PY - 2006/12/1
Y1 - 2006/12/1
N2 - The emergence of network convergence emphasizes the need to support distributed synchronous servers such as TDMoIP (pseudo-wire) and 3G cellular gateways over a packet switched infrastructure. Consequently, we formalize the problem of network wide clock frequency synchronization and introduce novel and efficient algorithms to synchronize the frequency among all the clocks in the network with respect to a single frequency. The common thread of our solutions is that they take a network-wide view that accounts for all the clocks in the network and measurements taken over all links to estimate the frequency difference of each clock with respect to the reference clock. The various presented algorithms introduce different trade-offs between the accuracy and the computation complexity. While all our schemes are global, they employ simple pair-wise measurements between neighboring nodes. Consequently, all the algorithms presented in the paper, are simple, easy to implement and require a modest amount of measurement and control traffic.
AB - The emergence of network convergence emphasizes the need to support distributed synchronous servers such as TDMoIP (pseudo-wire) and 3G cellular gateways over a packet switched infrastructure. Consequently, we formalize the problem of network wide clock frequency synchronization and introduce novel and efficient algorithms to synchronize the frequency among all the clocks in the network with respect to a single frequency. The common thread of our solutions is that they take a network-wide view that accounts for all the clocks in the network and measurements taken over all links to estimate the frequency difference of each clock with respect to the reference clock. The various presented algorithms introduce different trade-offs between the accuracy and the computation complexity. While all our schemes are global, they employ simple pair-wise measurements between neighboring nodes. Consequently, all the algorithms presented in the paper, are simple, easy to implement and require a modest amount of measurement and control traffic.
UR - http://www.scopus.com/inward/record.url?scp=39049141580&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2006.160
DO - 10.1109/INFOCOM.2006.160
M3 - Conference contribution
AN - SCOPUS:39049141580
SN - 1424402212
SN - 9781424402212
T3 - Proceedings - IEEE INFOCOM
BT - Proceedings - INFOCOM 2006
T2 - INFOCOM 2006: 25th IEEE International Conference on Computer Communications
Y2 - 23 April 2006 through 29 April 2006
ER -