Skip to main content
Log in

Computing blocking probabilities in survivable WDM optical networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

One of the most important performance measurements in wavelength-division multiplexing (WDM) networks is the call blocking probability. In this paper, we present an approximate analytical method to evaluate the blocking probabilities in survivable WDM networks with dynamically arriving connection requests. Our approach utilizes the wavelength independence whereby WDM network can be regarded as an aggregation of disjoint single wavelength sub-networks with a common physical topology. In each single wavelength sub-network, we derive the calculation of the blocking probability from an exact analysis. We assume dedicated protection with fixed routing and either first-fit or random wavelength assignment. Simulation results demonstrate the accuracy of the proposed method.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

Notes

  1. The generalized (not integral) Erlang-B formula \(E_{B}(\lambda ,N)=\frac{\lambda ^N e^{-\lambda }}{\int _\lambda ^{\infty }t^N e^{-t} dt}= \frac{\lambda ^N e^{-\lambda }}{\Gamma (N+1,\lambda )}\), where \(\Gamma (N+1, \lambda )\) is the incomplete Gamma function [21].

References

  1. Yamada, Y., Hasegawa, H., Sato, K.: Survivable hierarchical optical path network design with dedicated wavelength path protection. J. Lightw. Technol. 29, 3196–3209 (2011)

    Article  Google Scholar 

  2. Sato, K., Hasegawa, H.: Optical networking technologies that will create future bandwidth abundant networks. J. Opt. Commun. Netw. 1(2), A81–A93 (2009)

    Article  Google Scholar 

  3. Edwards, G.: Todays optical network research infrastructures for E-science applications. In: Proceeings of the Optical Fiber Communication Conference, 2006 and the 2006 National Fiber Optic Engineers Conference, Anaheim, CA (2006)

  4. Tanimoto, M.: FTV (free viewpoint TV) and creation of ray- based image engineering. ECTI Trans. Electr. Eng. Electron. Commun. 6(1), 3–14 (2008)

  5. Maier, G., Pattavina, A., Barbato, L., Cecini, F., Martinelli, M.: Routing algorithms in WDM networks under mixed static and dynamic lambda-traffic. Photonic Netw. Commun. 8(1), 69–87 (2004)

    Article  Google Scholar 

  6. Ho, P., Mouftah, H.: Shared protection in mesh WDM networks. IEEE Commun. Mag. 42(1), 70–76 (2004)

    Article  Google Scholar 

  7. Ou, C., Mukherjee, B.: Survivable Optical WDM Networks. Springer, Berlin (2005)

  8. Ramaswami, R., Sivarajan, K.: Optical Networks: A Practical Perspective, 2nd edn. Morgan Kaufmann, Los Altos, CA (2002)

  9. Ou, C., Zhang, J., Zang, H., Sahasrabuddhe, L., Mukherjee, B.: New and improved approaches for shared-path protection in WDM mesh networks. J. Lightw. Technol. 22(5), 1223–1232 (2004)

    Article  Google Scholar 

  10. Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks. Part I—Protection. In: Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol. 2, pp. 744–751 (1999)

  11. Birman, A.: Computing approximate blocking probabilities for a class of all optical networks. IEEE J. Sel. Areas Commun. 13, 852–857 (1996)

    Article  Google Scholar 

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

    Google Scholar 

  13. Zhu, Y., Rouskas, G., Peros, H.: A path decomposition approach for computing blocking probabilities in wavelength-routing networks. IEEE/ACM Trans. Netw. 8(6), 747–762 (2000)

    Google Scholar 

  14. Kamal, A., Al-Yatama, A.: Blocking probabilities in circuit-switched wavelength division multiplexing networks under multicast service. Perform. Eval. 47(1), 43–71 (2002)

    Article  MATH  Google Scholar 

  15. Ramesh, S., Rouskas, G., Perros, H.: Computing blocking probabilities in multiclass wavelength routing network. IEEE J. Sel. Areas Commun. 20, 89–96 (2002)

    Google Scholar 

  16. Xin, C., Qiao, C., Dixit, S.: Analysis of single-hop traffic grooming in mesh WDM optical networks. In: OptiComm2003, pp. 91–101 (2003)

  17. Ho, P., Jiang, X., Horiguchi, S., Tapolcai, J.: A novel network planning algorithm with fixed alternate routing for MPLS traffic engineering, dynamics of continuous. Discret. Impuls. Syst. (DCDIS) Ser. B Appl. Algorithms 13, 165–186 (2006)

    Google Scholar 

  18. Li, L., Somani, A.: A new analytical model for multifiber WDM networks. IEEE J. Sel. Areas Commun. 18(10), 2138–2145 (2000)

    Article  Google Scholar 

  19. Al-Yatama, A.: Wavelength decomposition approach for computing blocking probabilities in WDM optical networks without wavelength conversions. Comput. Netw. 49, 727–742 (2005)

    Article  Google Scholar 

  20. Girard, A.: Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley, Reading, MA (1990)

  21. ITU-D Study Group 2: Teletraffic Engineering Handbook. Geneva (2002)

  22. Waldman, H., Campelo, D., Almeida, R.: A new analytical approach for the estimation of blocking probabilities in wavelength routing networks. In: OptiComm2003, pp. 324–335 (2003)

  23. Thiagarajan, S., Somani, A.: Performance analysis of WDM optical networks with grooming capabilities. Proceedings of SPIE, vol. 4213, 253–262 (2000)

  24. Al-Yatama, A.: Computing the equivalent Poisson traffic for the wavelength decomposition method. J. High Speed Netw. 15(4), 399–414 (2006)

    Google Scholar 

  25. Yang, P., Zhang, J., Zhao, Y., Gu, W.: Improved wavelength decomposition approach for computing blocking probabilities in WRONs. J. China Univ. Posts Telecommun. 19, 119–123 (2012)

    Google Scholar 

  26. Kelly, F.P.: Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18(2), 473–505 (1986)

    Article  MATH  Google Scholar 

  27. Hulsermann, R., Jager, M., Krumke, S., Poensgen, D., Ramboui, J., Turchscherer, A.: Dynamic routing algorithms in transparent optical networks. In: Proceedings of ONDM 2003, pp. 293–312 (2003)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anwar Al-Yatama.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Al-Yatama, A. Computing blocking probabilities in survivable WDM optical networks. Photon Netw Commun 27, 34–46 (2014). https://doi.org/10.1007/s11107-013-0423-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-013-0423-1

Keywords

Navigation