Skip to main content
SpringerLink
Log in

A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems capable of providing huge amounts of bandwidth across long distances. In this scenario, dynamic routing for direct provisioning of optical paths at the WDM layer becomes a challenging problem. Any distributed algorithm for routing dynamic traffic demands on optical transport infrastructures should be simple, flexible, efficient and scalable. The contribution of this paper is a novel integrated routing and grooming scheme for setting-up bandwidth guaranteed paths on hybrid wavelength and label switched networks. Our proposal exploits and refines the minimum interference routing idea according to an improved and re-optimized resource and traffic-aware approach, where critical links are detected and weighted according to a low complexity all-pairs minimum cut strategy that substantially reduce the overall number of calculations and hence the computational cost. The valuable results achieved in the comparison against other well-known reference techniques clearly demonstrate that our algorithm is very time-efficient while performing better in terms of blocking probability.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: an approach to high-bandwidth optical WANs. IEEE Trans. Commun. 40, 1171–1182 (1992)

    Article  Google Scholar 

  2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co. (1979)

  3. Kodialam, M., Lakshman, T.V.: Minimum interference routing with applications to MPLS traffic engineering. In: Proceedings of IEEE Infocom (2000)

  4. Chen, S., Nahrstedt, K.: An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Netw. 12(6), 64–79 (1998)

    Article  Google Scholar 

  5. Dharma Rao, S., Siva Ram Murthy, C.: Distributed dynamic QoS-aware routing in WDM optical networks. Elsevier Comput. Netw. 48(4), 585–604 (2004)

    Google Scholar 

  6. Suri, S., Waldvogel, M., Warkhede, P.R.: Profile-based routing: a new framework for mpls traffic engineering. In: Quality of Future Internet Services, Lecture Notes in Computer Science 2156. Springer Verlag (2001)

  7. Zhemin, D., Hamdi, M., Lee, J.Y.B., Li, V.O.K.: Integrated routing and grooming in GMPLS-based optical networks. In: Proceedings of ICC (2004)

  8. Felsayed, K.M.: HCASP: a hop-constrained adaptive shortest-path algorithm for routing bandwidth-guaranteed tunnels in MPLS networks. In: Proceedings of the Ninth international Symposium on Computers and Communications 2004 (2004)

  9. Gong, Y., Lee, P., Yi, W.: A novel adaptive RWA algorithm in wavelength-routed network. In: Proceedings of GLOBECOM 2003, pp. 2580–2584 (2003)

  10. Guan, X.H., Zhai, S.G., Gong, W., Qiao, C.: A new method for solving routing and wavelength assignment problems in optical networks. IEEE/OSA J. Lightwave Technol. 25, 1895–1909 (2007)

    Article  Google Scholar 

  11. Palmieri, F., Fiore, U., Ricciardi, S.: SPARK: a smart parametric online RWA algorithm. J. Commun. Netw. 9(4), 368–376 (2007)

    Google Scholar 

  12. Mannie, E.: Generalized multi-protocol label switching (GMPLS) architecture. IETF RFC 3945 (2004)

  13. Kompella, K.: OSPF extensions in support of generalized MPLS. IETF RFC 4203 (2005)

  14. Koo, S., Sahin, G., Subramanian, S.: Dynamic lsp provisioning in overlay, augmented and peer architectures for IP/MPLS over WDM networks. In: Proceedings of IEEE Infocom (2004)

  15. Balasubramanian, S., Somani, A.K.: On traffic grooming choices for IP over WDM networks. IEEE Broadnets (2006)

  16. Kar, K., Kodialam, M., Lakshman, T.V.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE JSAC: QoS Internet 18(12), 921–940 (2000)

    Google Scholar 

  17. Kar, K., Kodialam, M., Lakshman, T.V.: Integrated dynamic IP and wavelength routing in IP over WDM networks. IEEE Infocom (2001)

  18. Wang, B., Su, X., Chen, C.P.: A new bandwidth guaranteed routing algorithm for MPLS traffic engineering. In: Proceedings of ICC, vol. 2, pp. 1001–1005 (2002)

  19. Boutaba, R., Szeto, W., Iraqi, Y.: DORA: efficient routing for MPLS traffic engineering. J. Netw. Syst. Manage. 10(3), 309–325 (2002)

    Article  Google Scholar 

  20. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing. J. ACM 35(4) (1988)

  21. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993)

  22. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    MATH  MathSciNet  Google Scholar 

  23. Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. In: Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pp. 165–174. ACM, New York (1992)

  24. Nagamochi, H., Ibaraki, T.: Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583–596 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  25. Stoer, M., Wagner, F.: A simple min cut algorithm. In: Proceedings of the 1994 European Symposium on Algorithms, pp. 141–147. Springer-Verlag (1994)

  26. Ashwood-Smith, P.: Generalized MPLS: signaling functional description. IETF RFC 3471 (2003)

  27. Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for traffic engineering over MPLS. RFC 2702, Sep. (1999)

  28. Lewis, H.R., Denenberg, L.: Data Structures and Their Algorithms. HarperCollins, New York (1991)

    Google Scholar 

  29. NSFNet, http://www.nsf.gov/about/history/nsf0050/internet/launch.htm

  30. GÉANT2 network, http://www.geant2.net/

Download references

Author information

Authors and Affiliations

  1. Università degli Studi di Napoli Federico II, CSI, Complesso Universitario Monte S. Angelo, Via Cinthia, 80126, Napoli, Italy

    Francesco Palmieri, Ugo Fiore & Sergio Ricciardi

Authors
  1. Francesco Palmieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ugo Fiore
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergio Ricciardi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Palmieri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Palmieri, F., Fiore, U. & Ricciardi, S. A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks. J Netw Syst Manage 16, 421–448 (2008). https://doi.org/10.1007/s10922-008-9097-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-008-9097-x

Keywords

Search

Navigation