Analysis of Transmissions Scheduling with Packet Fragmentation - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2001

Analysis of Transmissions Scheduling with Packet Fragmentation

Abstract

We investigate a scheduling problem in which packets, or datagrams, may be fragmented. While there are a few applications to scheduling with datagram fragmentation, our model of the problem is derived from a scheduling problem present in data over CATV networks. In the scheduling problem datagrams of variable lengths must be assigned (packed) into fixed length time slots. One of the capabilities of the system is the ability to break a datagram into several fragments. When a datagram is fragmented, extra bits are added to the original datagram to enable the reassembly of all the fragments. We convert the scheduling problem into the problem of bin packing with item fragmentation, which we define in the following way: we are asked to pack a list of items into a minimum number of unit capacity bins. Each item may be fragmented in which case overhead units are added to the size of every fragment. The cost associated with fragmentation renders the problem NP-hard, therefore an approximation algorithm is needed. We define a version of the well-known Next-Fit algorithm, capable of fragmenting items, and investigate its performance. We present both worst case and average case results and compare them to the case where fragmentation is not allowed.
Fichier principal
Vignette du fichier
dm040207.pdf (110.93 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00958954 , version 1 (13-03-2014)

Identifiers

Cite

Nir Namman, Raphaël Rom. Analysis of Transmissions Scheduling with Packet Fragmentation. Discrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.139-156. ⟨10.46298/dmtcs.277⟩. ⟨hal-00958954⟩

Collections

TDS-MACS
50 View
788 Download

Altmetric

Share

More