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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.139-156
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00958954
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 16:52:41
Dernière modification le : dimanche 31 décembre 2017 - 09:44:02
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:04:15

Fichier

dm040207.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958954, version 1

Collections

Citation

Nir Namman, Raphaël Rom. Analysis of Transmissions Scheduling with Packet Fragmentation. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.139-156. 〈hal-00958954〉

Partager

Métriques

Consultations de la notice

62

Téléchargements de fichiers

86