Advertisement

Photonic Network Communications

, Volume 4, Issue 3–4, pp 443–456 | Cite as

Topological Design and Lightpath Routing in WDM Mesh Networks: A Combined Approach

  • Nicolas Puech
  • Josué Kuri
  • Maurice Gagnaire
Article

Abstract

Multicommodity flow models are commonly used to formulate the logical topology design (LTD) problem and the lightpath routing (LR) problem as mixed integer linear programming (MILP) problems. In general, MILP formulations are intractable even for relatively small networks due to the combinatorial complexity of the problem. In this paper we propose improvements to these models and a method to solve the LTD and the LR problems in a combined manner. The interest is two fold: firstly, by tackling the two problems with separate models, problem instances of realistic size (up to 14 nodes in this paper) can be dealt with. Furthermore, different combinations of optimization models and objective functions can be investigated in a modular manner. Secondly, the mechanisms proposed to combine the problems allow to keep track of the global design problem when solving each individual step.

lightpath routing logical topology design mixed integer linear programming (MILP) network planning WDM 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Ammar, Virtual Path Network Design, in: Broadband Network Teletraffic, Final report of action COST 242, eds. J. Roberts, U. Mocci, J. Virtamo (Springer-Verlag, 1996).Google Scholar
  2. [2]
    R. Ramaswami, K. N. Sivarajan, Design of logical topologies for wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications, vol. 14,no. 5, (June 1996), pp. 840–851.Google Scholar
  3. [3]
    B. Mukherjee, D. Banerjee, S. Ramamurthy, A. Mukherjee, Some principles for designing a wide-area WDM optical network, IEEE/ACM Transactions on Networking, vol. 4,no. 5, (August 1996), pp. 684–696.Google Scholar
  4. [4]
    D. Banerjee, B. Mukherjee, Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study, IEEE/ACM Transactions on Networking, vol. 8,no. 5, (Oct. 2000), pp. 598–607.Google Scholar
  5. [5]
    Eurescom, Planning of optical network, Project P709, Deliverable 3, (April 2000). Available at http://www.eurescom.de/public/projectresults/P700-series/700s.aspGoogle Scholar
  6. [6]
    E. Leonardi, M. Mellia, M. A. Marsan, Algorithms for the logical topology design in WDM all-optical networks, Optical Networks Magazine, vol. 1,no. 1, (Jan. 2000), pp. 35–46.Google Scholar
  7. [7]
    R. Krishnaswamy, K. Sivarajan, Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers, IEEE/ACM Transactions on Networking, vol. 9,no. 2, (April 2001), pp. 186–-198.Google Scholar
  8. [8]
    M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M.A. Marsan, Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic, Proceedings of INFOCOM, (2001).Google Scholar
  9. [9]
    R. Ramaswami, K. N. Sivarajan, Routing and wavelength assignment in all-optical networks, IEEE/ACM Transaction on Networking, vol. 3,no. 5, (Oct. 1995), pp. 489–500.Google Scholar
  10. [10]
    D. Banerjee, B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications, vol. 14,no. 5, (Oct. 1996), pp. 903–908.Google Scholar
  11. [11]
    D. Banerjee, Design of WDM Wide Area Networks, Ph.D. Thesis, University of California, Davis, (1996).Google Scholar
  12. [12]
    S. Ohta, A. Greca, Comparison of routing and wavelength assignment algorithms for optical networks, Proceeding of the 2001 Workshop on High Performance Switching and Routing, (2001).Google Scholar
  13. [13]
    H. Zang, J. P. Jue, B. Mukherjee, A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks, Optical Networks Magazine, vol. 1,no. 1, (Jan. 2000), pp. 47-60.Google Scholar
  14. [14]
    P. Klein, N. Young, Approximation Algorithms for NP-Hard Optimization Problems (CRC Press, 1999).Google Scholar
  15. [15]
    D. Eppstein, Finding the k shortest paths, SIAM Journal of Computing, vol. 28,no. 2, (1998), pp. 652–673.Google Scholar
  16. [16]
    J. Kuri, N. Puech, M. Gagnaire, Resolution of a WDM network design problem using a decomposition approach and a size reduction method, Proceedings of ECUMN 2002, Colmar, France, (April 2002).Google Scholar
  17. [17]
    N. Puech, J. Kuri, M. Gagnaire, Models for the logical topology design problem. 2nd IFIP-TC6 Networking Conference, Pisa, Italy, (May 2002).Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Nicolas Puech
    • 1
    • 2
  • Josué Kuri
    • 2
  • Maurice Gagnaire
    • 2
  1. 1.I.U.T.University Paris 5ParisFrance
  2. 2.Department of Computer Science and NetworksEcole Nationale Supérieure des TélécommunicationsParis cedex 13France

Personalised recommendations