Dynamic Routing and Wavelength Assignment Using First Policy Iteration

Authors:
Esa Hyytiä;Jorma Virtamo
Affiliations:
-;-
Venue:
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Year:
2000

Citing 7
Cited 1

Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Mining the optical bandwidth for a terabit per second

IEEE Spectrum
Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective

Optical networks: a practical perspective
ATM Network Resource Management

ATM Network Resource Management
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications

On dynamic wavelength assignment in WDM optical networks

Optical networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

With standard assumptions, the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution because of the huge size of the state space. Only heuristic algorithms have been presented up until now. In this paper, we propose an approach where, starting from a given heuristic algorithm, one obtains a better algorithm by the first policy iteration. In order to estimate the relative costs of states, we make a simulation on the fly studying, at each decision epoch, the consequences of all the alternative actions. Being computationally intensive, this method can be used in real time only for systems with slow dynamics. Off-line it can be used to assess how close the heuristic algorithms come to the optimal policy. Numerical examples are given about the policy improvement.