Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks

Authors:
Keqin Li
Affiliations:
State University of New York at New Paltz, New York
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2008

Citing 19
Cited 0

A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use

IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Optical networks: a practical perspective

Optical networks: a practical perspective
Online computation and competitive analysis

Online computation and competitive analysis
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Competitive non-preemptive call control

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

IEEE/ACM Transactions on Networking (TON)
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
Mobile Software Agents for Control in Telecommunications Networks

BT Technology Journal
On-Line Routing in All-Optical Networks

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Disjoint paths in densely embedded graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Topological Characteristics of Random Multihop Wireless Networks

Cluster Computing
Coloring inductive graphs on-line

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On-line admission control and circuit routing for high performance computing and communication

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of online routing and wavelength assignment and the related throughput maximization problem in wavelength division multiplexing optical networks. It is pointed out that these problems are highly inapproximable, that is, the competitive ratio of any algorithm is at least a polynomial. We evaluate the average-case performance of several online algorithms, which have no knowledge of future arriving connection requests when processing the current connection request. Our experimental results on a wide range of optical networks demonstrate that the average-case performance of these algorithms are very close to optimal.