[图书][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 …
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 …
into higher speed streams, in order to improve bandwidth utilization and reduce network …
Placing regenerators in optical networks to satisfy multiple sets of requests
The placement of regenerators in optical networks has become an active area of research
during the last few years. Given a set of lightpaths in a network G and a positive integer d …
during the last few years. Given a set of lightpaths in a network G and a positive integer d …
Optimal solution of the maximum all request path grooming problem
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem
motivated by a traffic grooming application. The MARPG problem consists in finding the …
motivated by a traffic grooming application. The MARPG problem consists in finding the …
Maximum number of requests on a path with a given grooming factor
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem
motivated by a traffic grooming application and for its interest for computing lower bounds for …
motivated by a traffic grooming application and for its interest for computing lower bounds for …
Locality-aware consistency maintenance for heterogeneous P2P systems
Replication and caching have been deployed widely in current P2P systems. In update-
allowed P2P systems, a consistency maintenance mechanism is strongly demanded …
allowed P2P systems, a consistency maintenance mechanism is strongly demanded …
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring …
disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring …
Traffic grooming on the path
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 …
and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we …
Approximating the traffic grooming problem
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 …
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
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 …
that at most g of them that share a physical link get the same wavelength (g is the grooming …