Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs (original) (raw)

Abstract

The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach for EDP (BGAforEDP). The proposed algorithm outperforms by approximately 20% under the traditional fixed topology (NSFNET) and approximately 32% under random topologies, using the BGAforEDP algorithm.

This work was supported in parts by the Brain Korea 21 Project and University fundamental Research Program supported by Ministry of Information & Communication in republic of Korea in 2004.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-routed Optical WDM Networks. Optical Network Magazine 1, 47–60 (2000)
    Google Scholar
  2. Murthy, C.S.R.: WDM optical networks: Concepts, design, and algorithm. Prentice Hall PTR, Englewood Cliffs (2002)
    Google Scholar
  3. Ramaswami, K., Sivarajan, K.: Routing and Wavelength Assignment in All-Optical Networks. IEEE/ACM Trans. on Net. 3, 489–500 (1995)
    Article Google Scholar
  4. Kolliopoulos, S., Stein, C.: Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 153–168. Springer, Heidelberg (1998)
    Chapter Google Scholar
  5. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks from Edge Disjoint Path Algorithms. IEEE Commu. Lett. 5, 211–213 (2002)
    Article Google Scholar
  6. Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE JSAC 14, 903–908 (1996)
    Google Scholar
  7. Zhang, Y., Taira, K., Takagi, H., Das, S.K.: An Efficient Heuristic for Routin and Wavelength Assignment in Optical WDM Networks. IEEE ICC 5, 2734–2739 (2002)
    Google Scholar
  8. Swaminathan, M.D., Sivarajan, K.N.: Practical Routing and Wavelength Assignment Algorithms for All Optical Networks with Limited Wavelength Conversion. IEEE ICC 5, 2750–2755 (2002)
    Google Scholar
  9. Alanyali, M., Ayanoglu, E.: Provisioning algorithms for WDM optical networks. IEEE/ACM Trans. on Net. 7, 767–778 (1999)
    Article Google Scholar
  10. Chlamtac, I., Farago, A., Zhang, T.: Lightpath (wavelength) routing in large WDM networks. IEEE JSAC 14, 909–913 (1996)
    Google Scholar
  11. Kim, M.H., Choo, H.: A Practical RWA Algorithm Based on Lookup Table for Edge Disjoint Paths. LNCS, vol. 2713, pp. 138–147. Springer, Heidelberg (2003)
    Google Scholar
  12. Papadimitratos, P., Haas, Z.J., Sirer, E.G.: Path Set Selection in Mobile Ad Hoc Networks. MobiHoc (2002)
    Google Scholar
  13. Li, G., Simha, R.: The Partition Coloring Problem and its Application to Wavelength Routing and Assignment. In: Proc. of the First Workshop on Optical Networks (2000)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, 300, Chunchun-dong, Jangan-gu, Suwon, Kyunggi-do, 440-746, Korea
    Won Jin Yoon, Duk Hun Kim, Min Young Chung, Tae-Jin Lee & Hyunseung Choo

Authors

  1. Won Jin Yoon
  2. Duk Hun Kim
  3. Min Young Chung
  4. Tae-Jin Lee
  5. Hyunseung Choo

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada
    Marina L. Gavrilova
  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy
    Osvaldo Gervasi
  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA
    Vipin Kumar
  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK
    C. J. Kenneth Tan
  5. Clayton School of IT, Monash University, 3800, Clayton, Australia
    David Taniar
  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy
    Antonio Laganá
  7. School of Computing, Soongsil University, Seoul, Korea
    Youngsong Mun
  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea
    Hyunseung Choo

Rights and permissions

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoon, W.J., Kim, D.H., Chung, M.Y., Lee, TJ., Choo, H. (2006). Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588\_89

Download citation

Keywords

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.

Publish with us