An improved approximate network blocking probability model for all-optical WDM Networks with heterogeneous link capacities☆

Abstract Currently, analytical models are used to compute approximate blocking probabilities in opaque and all-optical WDM networks with the homogeneous link capacities. Existing analytical models can also be extended to opaque WDM networking with heterogeneous link capacities due to the wavelength conversion at each switch node. However, existing analytical models cannot be utilized for all-optical WDM networking with heterogeneous structure of link capacities due to the wavelength continuity constraint and unequal numbers of wavelength channels on different links. In this work, a mathematical model is extended for computing approximate network blocking probabilities in heterogeneous all-optical WDM networks in which the path blocking is dominated by the link along the path with fewer number of wavelength channels. A wavelength assignment scheme is also proposed for dynamic traffic, termed as last-fit-first wavelength assignment, in which a wavelength channel with maximum index is assigned first to a lightpath request. Due to heterogeneous structure of link capacities and the wavelength continuity constraint, the wavelength channels with maximum indexes are utilized for minimum hop routes. Similarly, the wavelength channels with minimum indexes are utilized for multi-hop routes between source and destination pairs. The proposed scheme has lower blocking probability values compared to the existing heuristic for wavelength assignments. Finally, numerical results are computed in different network scenarios which are approximately equal to values obtained from simulations.

[1]  Moshe Zukerman,et al.  Blocking Probability Estimation for Trunk Reservation Networks , 2007, 2007 IEEE International Conference on Communications.

[2]  Yuefeng Ji,et al.  CSO: cross stratum optimization for optical as a service , 2015, IEEE Communications Magazine.

[3]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[4]  Kumar N. Sivarajan,et al.  Routing and dimensioning in optical networks under traffic growth models: an asymptotic approach , 2003, IEEE J. Sel. Areas Commun..

[5]  J.S. Vardakas,et al.  Loss models in traffic-groomed WDM all-optical networks , 2008, 2008 6th International Symposium on Communication Systems, Networks and Digital Signal Processing.

[6]  Steven S. Lumetta,et al.  Resource dimensioning in WDM networks under state-based routing schemes , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[7]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[8]  Anthony S. Acampora,et al.  On wavelength translation in all-optical networks , 1995, Proceedings of INFOCOM'95.

[9]  Kalyan Kuppuswamy,et al.  An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks , 2009, TNET.

[10]  Yi Lin,et al.  SUDOI: software defined networking for ubiquitous data center optical interconnection , 2016, IEEE Communications Magazine.

[11]  Chien Chen,et al.  A Blocking Probability Model in Multigranularity Cross-connect Optical Networks , 2007, 2007 Workshop on High Performance Switching and Routing.

[12]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[13]  J. Berthold,et al.  Optical Networking: Past, Present, and Future , 2008, Journal of Lightwave Technology.

[14]  Poompat Saengudomlert,et al.  Design based routing and wavelength assignment in WDM networks using link-based multiplexing gain , 2015, Opt. Switch. Netw..

[15]  Nicolás A. Jara,et al.  Blocking probability evaluation of end-to-end dynamic WDM networks , 2011, Photonic Network Communications.

[16]  Jorma T. Virtamo,et al.  A recursive formula for multirate systems with elastic traffic , 2005, IEEE Communications Letters.

[17]  Subir Bandyopadhyay,et al.  Dissemination of Information in Optical Networks:: From Technology to Algorithms (Texts in Theoretical Computer Science. An EATCS Series) , 2007 .

[18]  Sun-il Kim,et al.  Dimensioning WDM Networks for Dynamic Routing of Evolving Traffic , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[19]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.

[20]  Reinaldo Vallejos,et al.  Join routing and dimensioning heuristic for dynamic WDM optical mesh networks with wavelength conversion , 2014 .

[21]  L. H. Bonani,et al.  An improved least cost routing approach for WDM optical network without wavelength converters , 2016 .

[22]  Moshe Zukerman,et al.  Computation of Blocking Probability for Large Circuit Switched Networks , 2012, IEEE Communications Letters.

[23]  András Faragó,et al.  Efficient blocking probability computation of complex traffic flows for network dimensioning , 2008, Comput. Oper. Res..