Description |
The aim of this toolbox is to compute blocking probabilities in WDM networks. This work was based on [1], [2], [3], [4] and user is referred to those papers for deeper study.
Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network.
Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for shortest path computation are also in this toolbox (they are used for traffic matrix creation).
References:
[1] Alexander Birman, "Computing Approximate Blocking Probabilities for a Class of All-Optical Network", IEEE Journal on Selected Areas in Communications, vol. 14, June 1996
[2] Tushar Tripathi, Kumar N. Sivarajan, "Computing Approximate Blocking Probabilities in Wavelength Routed All_optical Networks with Limited-Range Wavelength Conversion", IEEE Journal on Selected Areas in Communications, vol. 18, October 2000
[3] S. Chung, A. Kashper, K.W. Ross, "Computing Approximate Blocking Propabilities for large loss networks", IEEE/ACM Transactions on Networking, vol. 1, 1993
[4] F.P. Kelly, "Routing and capcity allocation in networks with trunk reservation", Matematics of Operation Research, vol. 15, no. 4, 1990
[5] Milan Kovaceviæ, Anthony Acampora, "Benefits of Wavelength translation in All-Optical Clear Channel Networks", IEEE Journal on Selected Areas in Communications, vol. 14, June 1996 |