Hardness and approximation of traffic grooming

O Amini, S Pérennes, I Sau - Theoretical Computer Science, 2009 - Elsevier
Traffic grooming is a central problem in optical networks. It refers to packing low rate signals
into higher speed streams, in order to improve bandwidth utilization and reduce network …

The traffic grooming problem in optical networks with respect to ADMs and OADMs: complexity and approximation

M Flammini, G Monaco, L Moscardelli, M Shalom… - Algorithms, 2021 - mdpi.com
All-optical networks transmit messages along lightpaths in which the signal is transmitted
using the same wavelength in all the relevant links. We consider the problem of switching …

Hardness and approximation of traffic grooming

O Amini, S Pérennes, I Sau - International Symposium on Algorithms and …, 2007 - Springer
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals
into higher speed streams, in order to improve bandwidth utilization and reduce network …

Graph partitioning and traffic grooming with bounded degree request graph

Z Li, I Sau - International Workshop on Graph-Theoretic Concepts …, 2009 - Springer
We study a graph partitioning problem which arises from traffic grooming in optical networks.
We wish to minimize the equipment cost in a SONET WDM ring network by minimizing the …

Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs

X Munoz, Z Li, I Sau - SIAM Journal on Discrete Mathematics, 2011 - SIAM
We study the following graph partitioning problem: Given two positive integers C and Δ, find
the least integer M(C,Δ) such that the edges of any graph with maximum degree at most Δ …

Traffic grooming: Combinatorial results and practical resolutions

T Cinkler, D Coudert, M Flammini, G Monaco… - Graphs and Algorithms …, 2010 - Springer
In an optical network using the wavelength division multiplexing (WDM) technology, routing
a request consists of assigning it a route in the physical network and a wavelength. If each …

Optimization in graphs under degree constraints. application to telecommunication networks

I Sau Valls - 2009 - upcommons.upc.edu
La premi ere partie de cette th ese s' int eresse au groupage de tra c dans les r eseaux de t
el ecommunications. La notion de groupage de tra c correspond a l'agr egation de ux de …

A Novel Static Traffic Grooming Algorithm Based on Steady Elimination Evolutionary and Gaming

XW Wang, YJ Sun, WG Hou, M Huang… - Advanced Materials …, 2012 - Trans Tech Publ
In this paper, we propose a static traffic grooming method, where both wavelength layered
graph and evaluation function are deployed with the objective of maximizing Quality of …

All-Optical Multicast Routing in Wavelength Routed WDM Networks

F Zhou - 2010 - theses.hal.science
In this thesis, we studied the all-optical multicast routing (AOMR) problem in wavelength-
routed WDM networks. The objective is to find a set of light structures, for instance a light …

[PDF][PDF] Routage multicast tout optique dans les réseaux WDM

M MOLNAR, B COUSIN - 2010 - theses.hal.science
Résumé Dans cette thèse, nous étudions le routage multicast tout optique (AOMR) dans les
réseaux WDM. Notre objectif est de trouver un ensemble de structures de diffusion, par …