Drop cost and wavelength optimal two-period grooming with ratio 4

Jean-Claude Bermond 1 Charles J. Colbourn 2 Lucia Gionfriddo 3 Gaetano Quattrocchi 3 Ignasi Sau 4, 5
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
4 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming problem, during the first period of time, there is all-to-all uniform traffic among $n$ nodes, each request using $1/C$ of the bandwidth; and during the second period, there is all-to-all uniform traffic only among a subset $V$ of $v$ nodes, each request now being allowed to use $1/C'$ of the bandwidth, where $C' < C$. We determine the minimum drop cost (minimum number of ADMs) for any $n,v$ and $C=4$ and $C' \in \{1,2,3\}$. To do this, we use tools of graph decompositions. Indeed the two-period grooming problem corresponds to minimizing the total number of vertices in a partition of the edges of the complete graph $K_n$ into subgraphs, where each subgraph has at most $C$ edges and where furthermore it contains at most $C'$ edges of the complete graph on $v$ specified vertices. Subject to the condition that the two-period grooming has the least drop cost, the minimum number of wavelengths required is also determined in each case.
Type de document :
Rapport
[Research Report] RR-7101, INRIA. 2009, pp.24
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00432801
Contributeur : Ignasi Sau Valls <>
Soumis le : mardi 17 novembre 2009 - 12:46:17
Dernière modification le : jeudi 11 janvier 2018 - 16:02:50
Document(s) archivé(s) le : jeudi 17 juin 2010 - 20:41:02

Fichiers

RR-7101.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00432801, version 1
  • ARXIV : 0911.3475

Citation

Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau. Drop cost and wavelength optimal two-period grooming with ratio 4. [Research Report] RR-7101, INRIA. 2009, pp.24. 〈inria-00432801〉

Partager

Métriques

Consultations de la notice

345

Téléchargements de fichiers

190