[图书][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 …
Constructing shared objects that are both robust and high-throughput
Shared counters are among the most basic coordination structures in distributed computing.
Known implementations of shared counters are either blocking, non-linearizable, or have a …
Known implementations of shared counters are either blocking, non-linearizable, or have a …
Selfishness, collusion and power of local search for the ADMs minimization problem
We consider non-cooperative games in all-optical networks where users share the cost of
the used ADM switches for realizing given communication patterns. We show that the two …
the used ADM switches for realizing given communication patterns. We show that the two …
On minimizing the number of ADMs–tight bounds for an algorithm without preprocessing
Minimizing the number of electronic switches in optical networks is a main research topic in
recent studies. In such networks we assign colors to a given set of lightpaths. Thus the …
recent studies. In such networks we assign colors to a given set of lightpaths. Thus the …
On minimizing the number of ADMs—Tight bounds for an algorithm without preprocessing
Minimizing the number of electronic switches in optical networks is a main research topic in
recent studies. In such networks we assign colors to a given set of lightpaths. Thus the …
recent studies. In such networks we assign colors to a given set of lightpaths. Thus the …
[HTML][HTML] Optimal on-line colorings for minimizing the number of adms in optical networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous
theoretical studies of this problem dealt with the off-line case, where all the lightpaths are …
theoretical studies of this problem dealt with the off-line case, where all the lightpaths are …
Optimal on-line colorings for minimizing the number of ADMs in optical networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous
theoretical studies of this problem dealt with the off-line case, where all the lightpaths are …
theoretical studies of this problem dealt with the off-line case, where all the lightpaths are …
Traffic grooming: Combinatorial results and practical resolutions
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 …
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 …
el ecommunications. La notion de groupage de tra c correspond a l'agr egation de ux de …
Selfishness, collusion and power of local search for the ADMs minimization problem
S Di Giannantonio, M Flammini, G Monaco… - … Workshop on Web and …, 2007 - Springer
We consider non cooperative games in all-optical networks where users share the cost of
the used ADM switches for realizing given communication patterns. We show that the two …
the used ADM switches for realizing given communication patterns. We show that the two …