Maximizing the number of connections in multifiber WDM chain, ring and star networks

Authors:
Katerina Potika
Affiliations:
Computer Science, ECE, National Technical University of Athens, Greece
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 5
Cited 0

On the k-coloring of intervals

Discrete Applied Mathematics
Routing and path multicoloring

Information Processing Letters
Call Control in Rings

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Maximizing the Number of Connections in Optical Tree Networks

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Satisfying a maximum number of pre-routed requests in all-optical rings

Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a wavelength assignment maximization problem in multifiber WDM networks. Given a network G, a set of requests, the number of fibers per link and the number of wavelengths, we want to maximize the number of requests that can be satisfied simultaneously. We propose polynomial time algorithms, that are either optimal or have a guaranteed worst case performance in basic topologies, such as chain, ring and star networks.