Satisfying a maximum number of pre-routed requests in all-optical rings

Authors:
Christos Nomikos;Aris Pagourtzis;Stathis Zachos
Affiliations:
Department of Computer Science, University of Ioannina, P.O. Box 1186, 45 110 Ioannina, Greece;Institute for Theoretical Computer Science, ETH Zentrum, CH-8092 Zürich, Switzerland and Department of Computer Science, National Technical University of Athens, 15780 Athens, Greece;Department of Computer Science, National Technical University of Athens, 15780 Athens, Greece and CIS Department, Brooklyn College and Graduate Center, City University of New York, NY
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Year:
2003

Citing 11
Cited 8

An optimal greedy heuristic to color interval graphs

Information Processing Letters
Linear time algorithms on circular-arc graphs

Information Processing Letters
Avoiding matrix multiplication

WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the k-coloring of intervals

Discrete Applied Mathematics
Multiwavelength optical networks with limited wavelength conversion

IEEE/ACM Transactions on Networking (TON)
Optimal wavelength routing on directed fiber trees

Theoretical Computer Science
On optiml converter placement in wavelength-routed networks

IEEE/ACM Transactions on Networking (TON)
On the wavelength assignment problem in multifiber WDM star and ring networks

IEEE/ACM Transactions on Networking (TON)
Routing and path multicoloring

Information Processing Letters
Efficient access to optical bandwidth

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost

Computer Networks: The International Journal of Computer and Telecommunications Networking
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings

Information Processing Letters
Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost

Computer Networks: The International Journal of Computer and Telecommunications Networking
Wavelength management in WDM rings to maximize the number of connections

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Routing and wavelength assignment in generalized WDM tree networks of bounded degree

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Wavelength assignment for satisfying maximal number of requests in all-optical networks

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Maximizing the number of connections in multifiber WDM chain, ring and star networks

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
Randomized and approximation algorithms for blue-red matching

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing . We consider the case where requests are pre-routed and formulate it as the maximum path coloring problem. We study the problem for rings and present a (2/3)-approximation algorithm. Along the way we develop a fast matching technique for a special class of bipartite graphs. By using this technique we achieve an O( n + m log L ) time complexity for our approximation algorithm, where n is the number of nodes, m is the number of requests and L is the maximum load of requests on a single link.