Title :
Almost Peer-to-Peer Clock Synchronization
Author :
Sobeih, Ahmed ; Hack, Michel ; Liu, Zhen ; Zhang, Li
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL
Abstract :
In this paper, an almost peer-to-peer (AP2P) clock synchronization protocol is proposed. AP2P is almost peer-to-peer in the sense that it provides the desirable features of a purely hierarchical (client/server) clock synchronization protocol while avoiding the undesirable consequences of a purely peer-to-peer one. In AP2P, a unique node is elected as a leader in a distributed manner. Each non-leader node adjusts its clock rate based on message exchanges with its neighbors, taking into consideration that neighbors that are closer to the leader have more effect on the adjustment than the neighbors that are further away from the leader. We compare the performance of AP2P with that of the server time protocol (STP), which is a purely hierarchical clock synchronization protocol. Simulation results, which have been conducted on several network topologies, have shown that AP2P can provide a clock synchronization accuracy that is indistinguishable from that of STP. Furthermore, AP2P is more fault-tolerant because it can recover from certain types of failures that STP cannot recover from.
Keywords :
message passing; peer-to-peer computing; protocols; synchronisation; AP2P protocol; almost peer-to-peer clock synchronization; fault-tolerant; network topologies; Animals; Clocks; Computer networks; Delay effects; Frequency synchronization; Global Positioning System; Peer to peer computing; Protocols; Resilience; USA Councils;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
Conference_Location :
Long Beach, CA
Print_ISBN :
1-4244-0910-1
Electronic_ISBN :
1-4244-0910-1
DOI :
10.1109/IPDPS.2007.370211