[图书][B] Dissemination of Information in Optical Networks:: From Technology to Algorithms

S Bandyopadhyay - 2007 - books.google.com
Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …

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 …

A 10/7+/spl epsi/approximation for minimizing the number of ADMs in SONET rings

M Shalom, S Zaks - First International Conference on …, 2004 - ieeexplore.ieee.org
SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous
papers on the topic concentrated on the number of wavelengths assigned to a given set of …

Approximation algorithms for grooming in optical network design

S Antonakopoulos, L Zhang - Theoretical Computer Science, 2011 - Elsevier
We study traffic grooming in optical network design, where the goal is to aggregate low-
bandwidth traffic streams to utilize efficiently high-bandwidth media such as wavelength …

Traffic grooming on the path

JC Bermond, L Braud, D Coudert - Theoretical Computer Science, 2007 - Elsevier
In a WDM network, routing a request consists in assigning it a route in the physical network
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …

Traffic grooming on the path

JC Bermond, L Braud, D Coudert - … 2005, Mont Saint-Michel, France, May …, 2005 - Springer
In a WDM network, routing a request consists in assigning it a route in the physical network
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …

Approximating the traffic grooming problem

M Flammini, L Moscardelli, M Shalom… - … and Computation: 16th …, 2005 - Springer
The problem of grooming is central in studies of optical networks. In graph-theoretic terms,
this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the …

On the complexity of the traffic grooming problem in optical networks

M Shalom, W Unger, S Zaks - … , FUN 2007, Castiglioncello, Italy, June 3-5 …, 2007 - Springer
A central problem in optical networks is to assign wavelengths to a given set of lightpaths, so
that at most g of them that share a physical link get the same wavelength (g is the grooming …

Approximating the traffic grooming problem with respect to adms and oadms

M Flammini, G Monaco, L Moscardelli… - … Conference on Parallel …, 2008 - Springer
We consider the problem of switching cost in optical networks, where messages are sent
along lightpaths. Given lightpaths, we have to assign them colors, so that at most g …

Low-cost, customized and flexible SRAM MBIST engine

A Van De Goor, C Jung, S Hamdioui… - … IEEE Symposium on …, 2010 - ieeexplore.ieee.org
This paper contributes to the field of test engineering: it shows the tradeoffs and engineering
aspects of a low-cost, flexible SRAM MBIST engine, applied to the 768 and 256 byte SRAMs …