Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
448355 | Computer Communications | 2013 | 12 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Philip Ginzboorg, Valtteri Niemi, Jörg Ott,