Dynamic Routing and Wavelength Assignment Using First Policy Iteration, Inhomogeneous Traffic Case

  • Esa Hyytid
  • Jorma Virtamo
Conference paper


The routing and wavelength assignment problem (RWA) in WDM network can be viewed as a Markov Decision Process (MDP). The problem, however, defies calculation of the exact solution because of the huge size of the state space. Several heuristic algorithms have been presented in the literature. Generally, these algorithms, however, do not take into account the available extra information about the traffic, e.g. inhomogeneous arrival rates. In this paper we propose an approach where, starting from a given heuristic algorithm, one obtains a better algorithm by the first policy iteration. At each decision epoch a decision analysis is made where the costs of all the alternative actions are estimated by simulations on the fly. 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.


Wavelength Division Multiplex Markov Decision Process Wavelength Assignment Traffic Class Policy Iteration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Mukherjee (1997) Optical Communication Networks, McGraw-Hill series on computer communications, McGraw-HillGoogle Scholar
  2. 2.
    R. Ramaswami and K. Sivarajan (1998) Optical Networks, A Practical Perspective, Morgan Kaufmann Series in Networking, Morgan Kaufmann PublishersGoogle Scholar
  3. 3.
    A. Willner (1997) Mining the optical bandwidth for a terabit per second. IEEE Spectrum 34(3):32–41CrossRefGoogle Scholar
  4. 4.
    D. Banaree and B. Mukherjee (1996) A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE JSAC 14:903–908Google Scholar
  5. 5.
    S. Baroni (1998) Routing and wavelength allocation in WDM optical networks, PhD thesis, University College LondonGoogle Scholar
  6. 6.
    E. Karasan and E. Ayanoglu (1998) Effects of wavelength routing and selection algorithms on wavelength conversion gain in wdm optical networks. IEEE/ACM Trans Networking 6:186–196CrossRefGoogle Scholar
  7. 7.
    A. Mokhtar and M. Azizoğlu (1998) Adaptive wavelength routing in all-optical networks, IEEE/ACM Trans Networking 6:197–206CrossRefGoogle Scholar
  8. 8.
    R. Ramaswami and K. Sivarajan (1995) Routing and wavelength assignment in all-optical networks, IEEE/ACM Trans Networking 3:489–500CrossRefGoogle Scholar
  9. 9.
    G. Mohan and S. Murthy (1999) A time optimal wavelength rerouting algorithm for dynamic trafffic in wdm networks, IEEE J Lightwave Technol 17:406–417CrossRefGoogle Scholar
  10. 10.
    H. C. Tijms (1994) Stochastic Models, An Algorithmic Approach, John Wiley & Sons LtdMATHGoogle Scholar
  11. 11.
    Z. Dziong (1997) ATM Network resource management, McGraw-HillGoogle Scholar
  12. 12.
    E. Hyytid and J. Virtamo (2000) Dynamic routing and wavelength assignment using first policy iteration, ISCC’2000, the 5th IEEE Symposium on Computers and Communications, Antibes, Juan les Pins, France, 4–6 July, 2000Google Scholar

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • Esa Hyytid
    • 1
  • Jorma Virtamo
    • 1
  1. 1.Laboratory of Telecommunications TechnologyHelsinki University of TechnologyFinland

Personalised recommendations