Message fragmentation for a chain of disrupted links

被引：7
作者：
Ginzboorg, Philip [1 ,2 ]
Niemi, Valtteri [3 ]
Ott, Jorg [2 ]
机构：
[1] Huawei Technol OY, FIN-00180 Helsinki, Finland
[2] Aalto Univ, FIN-02150 Espoo, Finland
[3] Univ Turku, Dept Math & Stat, FIN-20014 Turku, Finland
来源：
COMPUTER COMMUNICATIONS | 2014年 / 48卷
关键词：
Fragmentation; Channel with failures; DTN;
D O I：
10.1016/j.comcom.2014.03.015
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate the problem of estimating the transmission time of fragmented messages over multiple disrupted links. We build a system model for the case where a single message is sent over a chain of links and the disruptions in these links are identically and independently distributed. For this case, we derive approximation formulas for the mean transmission time, based on number of links, length of fragments and distributions of disruptions. The formulas are verified against simulation experiments in the cases of uniform and exponential distributions for disruptions. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：84 / 97
页数：14
相关论文
共 11 条
[1]  
[Anonymous], 1975, Queueing Systems
[2]  
Fall K, 2003, ACM SIGCOMM COMP COM, V33, P27
[3]  
Ginzboorg P., 2011, P EUR WIR 2011 APR 2, P415
[4]   Fragmentation algorithms for DTN links [J].
Ginzboorg, Philip ;
Niemi, Valtteri ;
Ott, Jorg .
COMPUTER COMMUNICATIONS, 2013, 36 (03) :279-290
[5]  
Jelenkovic PR, 2008, MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P73
[6]  
McCann J., 1996, 1981 RFC
[7]  
Nair J., 2010, P INFOCOM 2010
[8]  
Pitkanen M., 2008, P 2 WOWMOM WORKSH AU
[9]  
Prabhu NU., 1998, STOCHASTIC STORAGE P, V15
[10]  
Renyi A., 1998, FDN PROBABILITY
12