Skip to main content
SpringerLink
Log in

A path-disjoint approach for blocking probability analysis in hybrid dynamic wavelength routed WDM grooming networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

The present article addresses a novel approach to enhance the overall performance of a WDM optical network. Centralized and distributed approaches for dynamic lightpath establishment are well studied in the literature. Both the approaches have some drawbacks. In this article a hybrid approach is proposed to accept the advantages and discard the disadvantages of both the approaches. With the proposed hybrid approach, a WDM optical network is divided into clusters of nodes. Within a cluster centralized mechanism is applicable whereas connection requests between the node pairs from different clusters follow the distributed mechanism. Also, in this article an analytical model is proposed to compute the expected blocking probability of the proposed hybrid network. First, blocking probabilities for the centralized and distributed approaches are computed and then it is extended for the hybrid approach. The distinguished feature of the proposed analytical model is that it efficiently utilizes the path information of the calls to determine the overall blocking probability of a WDM optical network. It extracts the necessary parameters of a network by simulation and utilize the information to analytically calculate the blocking probability of the network. The NSFNET T1 backbone network is used for the simulation study. To justify the analytical model, the simulation results are compared with that of the analytical model. The simulation results establish the effectiveness of the proposed hybrid approach over the distributed approach in merits of both the call setup time and 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

Similar content being viewed by others

References

  1. Mukherjee B.: Optical communication networks. McGraw-Hill, New York (1997)

    Google Scholar 

  2. Ramaswami R., Sivarajan K.N.: Optical networks: a practical perspective. Morgan Kaufman Publishers, San Francisco (1998)

    Google Scholar 

  3. Barry R.A., Humblet P.A.: Models of blocking probability in all-optical networks with and without wavelength changers. IEEE J. Select. Areas. Commun. 14(5), 858–867 (1996)

    Article  Google Scholar 

  4. Barry, R.A., Marquis, D.: An improved model of blocking probability in all-optical networks. In: 1995 Digest of the LEOS summer topical meetings, pp. 43–44, 7–1 Aug 1995

  5. Subramaniam S., Azizoglu M., Somani A.K.: All-optical networks with sparse wavelength conversion. IEEE/ACM Trans. Network. 4(4), 544–557 (1996)

    Article  Google Scholar 

  6. Birman A.: Computing approximate blocking probabilities for a class of all-optical networks. IEEE J. Select. Areas. Commun. 14(5), 852–857 (1996)

    Article  Google Scholar 

  7. Ramaswami R., Sivarajan K.N.: Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Network. 3(5), 858–867 (1996)

    Google Scholar 

  8. Mokhtar A., Azizoglu M.: Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network. 6(2), 197–206 (1996)

    Article  Google Scholar 

  9. Chung S., Kashper A., Ross K.W.: Computing approximate blocking probabilities for large loss networks with state-dependent routing. IEEE/ACM Trans. Network. 1(1), 105–115 (1993)

    Article  Google Scholar 

  10. Sridharan A., Sivarajan K.N.: Blocking in all-optical networks. IEEE/ACM Trans. Network. 12(2), 384–397 (2004)

    Article  Google Scholar 

  11. Ramamurthy R., Mukherjee B.: Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks. IEEE/ACM Trans. Network. 10(3), 351–367 (2002)

    Article  Google Scholar 

  12. Biswas U., Naskar M.K., Mukhopadhyay A., Maulik U.: A heuristic algorithm for static wavelength assignment in WDM optical networks. IETE Tech. Rev. 22(3), 199–204 (2005)

    Google Scholar 

  13. Naskar, M.K., Sarkar, T., Biswas, U., Sarkar, S.K.: An efficient heuristic for static wavelength assignment in WDM optical networks. In: Conference of HOT 2003, p. 83. Calcutta, India, Feb 2003

  14. Jana S., Chowdhury S., Naskar M.K., Saha D., Mukherjee A.: Assigning wavelengths in WDM optical networks using an efficient graph coloring algorithm. Int. J. Inform. Comput. Sci. 4(2), 1–7 (2001)

    Google Scholar 

  15. Saha, D., Naskar, M.K., Mukherjee, A.: Novel approach for assigning wavelengths in WDM all-optical networks (AON). In: International Conference of APOC 2001, China, Nov 2001.

  16. Roy, K., Naskar, M.K., Biswas, U.: Adaptive dynamic wavelength routing for WDM optical networks. In: Third international conference on wireless and optical communications networks (WOCN)—2006, IEEE Communication Society, Bangalore, India, 11–13 April 2006

  17. Li L., Somani A.K.: Dynamic wavelength routing using congestion and neighborhood information. IEEE/ACM Trans. Network. 7(5), 779–786 (1999)

    Article  Google Scholar 

  18. Subramaniam, S., Barry, R.A.: Dynamic wavelength assignment in fixed routing WDM networks. In: Proceedings of IEEE international conference on communications (ICC’97), pp. 406–410. Quebec, Canada, 11–13 April 1997

  19. Zhang, X., Qiao, C.: Wavelength assignment for dynamic traffic in multi-fiber WDM networks. In: IEEE ICCCN, pp. 479–485, Oct 1998

  20. Chan, K., Yum, T.P.: Analysis of least congested path routing in WDM lightwave networks. In: Proceedings of IEEE INFOCOM’94, pp. 962–969. Toronto, ON, Canada, June 1994

  21. Li, L., Somani, A.K.: Blocking performance analysis of fixed-paths least-congestion routing in multifiber WDM networks. In: Proceedings fo SPIE photonics East’99, pp. 56–67. Boston, MA, USA (1999)

  22. Sridharan, A., Sivarajan, K.N.: Blocking in all-optical networks. In: Proceedings of IEEE INFOCOM, pp. 990–999, March 2000

  23. Roy, K.: A simple approach for optimal allocation of wavelength converters in WDM optical networks. In: Fourth international conference on wireless and optical communications networks (WOCN)—2007, IEEE Communication Society. Grand Hyatt, Singapore, 2–4 July 2007

  24. Zhang, Y., Taira, K., Takagi, H., Das, S.K.: An efficient heuristic for routing and wavelength assignment in optical WDM networks. In: ICOIN 2002, LNCS 2343, pp. 291–304 (2002)

  25. Ramaswami, R., Segall, A.: Distributed network control for wavelength routed optical networks. In: Proceedings of IEEE INFOCOM’96, vol.1, pp. 138–147 (1996)

  26. Yuan X., Melhem R., Gupta R., Meim Y., Qiao C.: Distributed Control protocols for wavelength reservation and their performance evaluation. Photon. Network Commun. 1(3), 207–218 (1999)

    Article  Google Scholar 

  27. Sengupta A., Bandyopadhyay S., Balla A.R., Jackel A.: Algorithms for dynamic routing in all-optical networks. Photon. Network Commun. 2(2), 163–184 (2000)

    Article  Google Scholar 

  28. Mukhopadhyay, A., Biswas, U., Naskar, M.K.: Distributed routing and wavelength assignment algorithms for dynamic WDM all-optical networks. In: International conference on PHOTONICS—2004, page NET P.2. Cochin, India, Dec 2004

  29. Kejie L., Xiao G., Chlamtac I.: Analysis of blocking probability for distributed lightpath establishment in WDM optical networks. IEEE/ACM Trans. Network. 13(1), 187–197 (2005)

    Article  Google Scholar 

  30. Zhemin D., Hamdi M.: Routing and wavelength assignment in multi-segment WDM optical networks using clustering techniques. Photon. Network Commun. 8(1), 55–67 (2004)

    Article  Google Scholar 

  31. Fukushima Y., Harai H., Arakawa S., Murata M.: A distributed clustering method for hierarchical routing in large-scaled wavelength routed networks. IEICE Trans. Commun. E88-B(10), 3904–3913 (2005)

    Article  Google Scholar 

  32. Chiu A.L., Modiano E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. J. Lightwave Technol. 18(1), 2–12 (2000)

    Article  Google Scholar 

  33. Modiano E., Lin P.J.: Traffic grooming in WDM networks. IEEE Commun. Mag. 39(7), 124–129 (2001)

    Article  Google Scholar 

  34. BerryR. Modiano E.: Reducing electronic multiplexing costs in SNET/WDM rings with dynamically changing traffic. IEEE J. Select. Areas Commun. 18(10), 1961–1971 (2000)

    Article  Google Scholar 

  35. Srinivasan R., Somani A.K.: Dynamic routing in WDM grooming networks. Photon. Network Commun. 5(2), 123–135 (2003)

    Article  Google Scholar 

  36. Srinivasan, R., Somani, A.K.: Request-specific routing in WDM grooming networks. In: Proceedings of IEEE ICC, pp. 2876–2880, April–May 2002

  37. Zhemin D., Hamdi M.: Traffic grooming in optical WDM mesh networks using the blocking island paradigm. Opt. Networks Mag. 4(6), 7–15 (2003)

    Google Scholar 

  38. Mukhopadhyay, A., Singh, J.K., Biswas, U., Naskar, M.K.: Distributed approaches for dynamic traffic grooming in WDM optical networks. In: International conference on CODEC-04, pp. P–55. Calcutta, India, Jan 2004

  39. Mukhopadhyay, A., Singh, J.K., Biswas, U., Naskar, M.K.: Improved distributed approaches for dynamic traffic grooming in WDM optical networks. In: DPN’04, pp. 92–96. IIT Kharagpur, India, 11–13 June 2004

  40. Mukhopadhyay, A., Biswas, U., Naskar, M.K.: A genetic algorithm for traffic grooming in unidirectional SONET/WDM rings. In: IEEE India annual conference 2004, INDICON, pp. 252–255. IIT Kharagpur, India, 20–22 Dec 2004

  41. Wang J., Cho W., Rao Vemuri V., Mukherjee B.: Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections. J. Lightwave Technol. 19(11), 1645 (2001)

    Article  Google Scholar 

  42. Hu J.: Traffic grooming in wavelength-division-multiplexing ring networks: a linear programming solution. J. Opt. Network. 1(11), 397 (2002)

    Google Scholar 

  43. Roy K., Naskar M.K.: Genetic evolutionary algorithm for static traffc grooming to SONET over WDM optical networks. J. Comput. Commun. 30(17), 3392–3402 (2007)

    Article  Google Scholar 

  44. Roy K., Naskar M.K.: A heuristic solution to SONET ADM minimization for static traffic grooming in WDM uni-directional ring networks. Photon. Network Commun. 12(2), 153–160 (2006)

    Article  Google Scholar 

  45. Roy K., Naskar M.K.: Simulation-based SADM optimization approach for dynamic traffic grooming in WDM optical networks. Photon. Network Commun. 16(1), 11–21 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Tele-Communication Engineering, Jadavpur University, Kolkata, 700 032, India

    Kuntal Roy & Mrinal K. Naskar

Authors
  1. Kuntal Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mrinal K. Naskar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kuntal Roy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roy, K., Naskar, M.K. A path-disjoint approach for blocking probability analysis in hybrid dynamic wavelength routed WDM grooming networks. Photon Netw Commun 18, 363–377 (2009). https://doi.org/10.1007/s11107-009-0199-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-009-0199-5

Keywords

Search

Navigation