DTP: Double-pairwise Time Protocol for Disruption Tolerant Networks

被引:6
作者
Ye, Qing [1 ]
Cheng, Liang [1 ]
机构
[1] Lehigh Univ, Dept Comp Sci & Engn, Bethlehem, PA 18015 USA
来源
28TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, VOLS 1 AND 2, PROCEEDINGS | 2008年
关键词
D O I
10.1109/ICDCS.2008.73
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Network time synchronization (NTS) is essential for any distributed systems, including Disruption Tolerant Networks (DTNs). The feature of frequent contact disruptions and discontinuous network connections in DTNs raises a new challenge in providing the NTS service: synchronization operations may be interrupted for a long period of time when links between the time synchronization peers are opportunistic. To address this challenge, we propose Double-pairwise Time Protocol (DTP) that can achieve better clock estimations and synchronization results in DTNs than NTP-Core, which models the major functionality of processing synchronization messages in Network Time Protocol (NTP) that is the time-keeping standard in the Internet. The characteristics of DTP include: i) DTP achieves approximately half of the maximum time error achieved by NTP-Core; and ii) DTP only, requires minor modifications to be implemented in the current architecture of NTP Simulation results based on trace data collected from existing DTN testbeds validate such characteristics of DTP.
引用
收藏
页码:345 / 352
页数:8
相关论文
共 25 条
[1]  
[Anonymous], 2001, P 15 PAR DISTR PROC
[2]  
[Anonymous], 2004, DELAY TOLERANT NETWO
[3]   Autonomous enhancement of disruption tolerant networks [J].
Burns, Brendan ;
Brock, Oliver ;
Levine, Brian Neil .
2006 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), VOLS 1-10, 2006, :2105-2110
[4]   Accurate bandwidth measurement in xDSL service networks [J].
Cheng, L ;
Marsic, I .
COMPUTER COMMUNICATIONS, 2002, 25 (18) :1699-1710
[5]  
Chuah MC, 2005, GLOB TELECOMM CONF, P807
[6]   PROBABILISTIC CLOCK SYNCHRONIZATION [J].
CRISTIAN, F .
DISTRIBUTED COMPUTING, 1989, 3 (03) :146-158
[7]  
ELSON LGJ, 2002, P OSDI 02 DEC, P147
[8]  
Fall K., 2003, P SIGCOMM 03
[9]  
FALL K, 2004, IRBTR04019
[10]  
Fan R., 2004, P 23 ANN ACM S PRINC, P320, DOI 10.1145/1011767.1011815