Fragmentation algorithms for DTN links

Philip Ginzboorg; Valtteri Niemi; Jörg Ott

doi:10.1016/j.comcom.2012.10.001

Fragmentation algorithms for DTN links

Philip Ginzboorg
, Valtteri Niemi
, Jörg Ott

Alcatel-Lucent's Access Division
Helsinki University of Technology

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments.

Original language	English
Pages (from-to)	279-290
Number of pages	12
Journal	Computer Communications
Volume	36
Issue number	3
DOIs	https://doi.org/10.1016/j.comcom.2012.10.001
State	Published - 1 Feb 2013
Externally published	Yes

Keywords

Channel with failures
DTN
Fragmentation

Access to Document

10.1016/j.comcom.2012.10.001

Cite this

@article{1b2963f89cce41f3a41ab7440aaed0ff,

title = "Fragmentation algorithms for DTN links",

abstract = "In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments.",

keywords = "Channel with failures, DTN, Fragmentation",

author = "Philip Ginzboorg and Valtteri Niemi and J{\"o}rg Ott",

note = "Funding Information: The authors thank J. Virtamo and S. Aalto for help, and P. Thiran, M. Grossglauser and M. Rinne for comments. This work was supported by TEKES as part of the Future Internet program of TIVIT (Finnish Strategic Centre for Science, Technology and Innovation in the field of ICT). ",

year = "2013",

month = feb,

day = "1",

doi = "10.1016/j.comcom.2012.10.001",

language = "English",

volume = "36",

pages = "279--290",

journal = "Computer Communications",

issn = "0140-3664",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Fragmentation algorithms for DTN links

AU - Ginzboorg, Philip

AU - Niemi, Valtteri

AU - Ott, Jörg

N1 - Funding Information: The authors thank J. Virtamo and S. Aalto for help, and P. Thiran, M. Grossglauser and M. Rinne for comments. This work was supported by TEKES as part of the Future Internet program of TIVIT (Finnish Strategic Centre for Science, Technology and Innovation in the field of ICT).

PY - 2013/2/1

Y1 - 2013/2/1

N2 - In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments.

AB - In this paper we show how the problem of in-time transmission of fragmented messages in disrupted networks can be solved in the simplest case of transmission over a single disrupted link. To this end, we: (1) classify fragmentation algorithms based on the knowledge available at the sending node and design example algorithms in each class; and (2) compare the performance of four fragmentation algorithms in six simulated environments.

KW - Channel with failures

KW - DTN

KW - Fragmentation

UR - https://www.scopus.com/pages/publications/84872148848

U2 - 10.1016/j.comcom.2012.10.001

DO - 10.1016/j.comcom.2012.10.001

M3 - Article

AN - SCOPUS:84872148848

SN - 0140-3664

VL - 36

SP - 279

EP - 290

JO - Computer Communications

JF - Computer Communications

IS - 3

ER -

Fragmentation algorithms for DTN links

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this