Skip to main content

Routing and Wavelength Assignment in All Optical Networks Based on Clique Partitioning

  • Conference paper
Book cover Distributed Computing and Networking (ICDCN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4904))

Included in the following conference series:

Abstract

Wavelength Division Multiplexing (WDM) offers the capability to handle the increasing demand of network traffic in a manner that takes the advantage of already deployed optical fibers. A lightpath is an all optical communication path between end-to-end over a same wavelength used on each intermediate link. Wavelengths are the main resources in WDM optical networks. The wavelength assignment problem has been solved by mapping it to a heuristic based clique partitioning problem under the wavelength continuity constraint. For routing, Dijkstra’s shortest-path algorithm is used. Here, we propose two new polynomial time heuristics for wavelength assignment called CPWA1 and CPWA2, based on clique partitioning concepts for static traffic demand with the objective of minimizing the number of wavelengths. The performance of our proposed algorithms are analyzed through extensive simulations on different set of traffic demands under a wide range of network topologies. The results show that proposed mechanism requires less number of wavelengths per fiber for a given set of traffic demand as compared to an existing well known algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks. SPIE Optical Networks Magazine 1(1), 47–60 (2000)

    Google Scholar 

  2. Murthy, C.S.R., Gurusamy, M.: WDM Optical Networks Concepts, Design and Algorithms. Prentice-Hall of India Pvt. Limited, Englewood Cliffs (2002)

    Google Scholar 

  3. Chlamtac, I., Ganz, A., Karmi, G.: Lightpath Communications: An Approach to High Bandwidth Optical WAN’s. IEEE Transactions on Communications. 40, 1171–1182 (1992)

    Article  Google Scholar 

  4. Ramaswami, R., Sivarajan, K.N.: Routing and Wavelength Assignment in All-Optical Networks. IEEE/ACM Transactions on Networking 3, 489–499 (1995)

    Article  Google Scholar 

  5. Kim, J.T., Shin, D.R.: New efficient Clique Partitioning Algorithms for Register-Transfer Synthesis of Data Paths. Journal of the Korean Physical Society 40(4), 754–758 (2002)

    MathSciNet  Google Scholar 

  6. Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE Journal on Selected Areas in Communications 14(5), 903–908 (1996)

    Article  Google Scholar 

  7. Zhang, Z., Acampora, A.: A Heuristic Wavelength Assignment Algorithm For Multihop WDM Networks with Wavelength Routing And Wavelength Reuse. IEEE/ACM Transactions On Networking 3(3), 281–288 (1995)

    Article  Google Scholar 

  8. Dutta, R., Mitra, B., Ghose, S., Sengupta, I.: An algorithm for Optimal Assignment of a Wavelength in a Tree Topology and Its Application in WDM Networks. IEEE Journal on Selected Areas in Communications 22(9), 1589–1600 (2004)

    Article  Google Scholar 

  9. Banerjee, N., Sharan, S.: A Evolutionary Algorithm for Solving The Single Objective Static Routing Wavelength Assignment Problem in WDM Routing Network. In: ICISIP 2004. IEEE 2nd International Conference on Intelligent Sensing and Information Processing, pp. 13–18 (2004)

    Google Scholar 

  10. Saha, D., Purkayastha, M.D., Mukherjee, A.: An approach to Wide area WDM Optical Network Desig using Genetic Algorithm. Computer Communication 22(2), 156–172 (1999)

    Article  Google Scholar 

  11. Baroni, S., Bayvel, P.: Wavelength Requirement in Arbitrarily Connected Wavelength-Routed Optical Networks. IEEE/OSA Journal of Lightwave Technology 15(2), 242–251 (1997)

    Article  Google Scholar 

  12. Siregar, J.H., Takagi, H., Zhang, Y.: Efficient Routing and Wavelength Assignment in Wavelength-Routed Optical Networks. In: APNOMS 2003. 7th Asia-Pasific Network Operations and Management Symposium (2003)

    Google Scholar 

  13. Alsuwaiyel, M.H.: Algorithms Design Techniques and Analysis. World Scientific publishing Ltd., Singapore (2000)

    Google Scholar 

  14. Zhou, J., Yuan, X.: A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information. In: ICPPW. International Conference on Parallel Processing Workshops, pp. 1–5 (2002)

    Google Scholar 

  15. Ngo, S.H., Jiang, X., Horiguchi, S.: An ant-based approach for dynamic RWA in optical WDM networks. Journal of Photonic Network Communications 11, 39–48 (2006)

    Article  Google Scholar 

  16. Pal, A., Patel, U.: Routing and Wavelength Assignment in Wavelength Division Multiplexing Networks. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds.) IWDC 2004. LNCS, vol. 3326, pp. 391–396. Springer, Heidelberg (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shrisha Rao Mainak Chatterjee Prasad Jayanti C. Siva Ram Murthy Sanjoy Kumar Saha

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De, T., Pal, A., Sengupta, I. (2007). Routing and Wavelength Assignment in All Optical Networks Based on Clique Partitioning. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77444-0_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77443-3

  • Online ISBN: 978-3-540-77444-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics