Computing approximate blocking probabilities for transparent waveband switching based WDM networks using hierarchical cross-connects

Khan, Akhtar Nawaz

doi:10.1016/j.aeue.2017.12.016

Cited by 2 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mathematical models have been proposed to compute ABPs in WDM networks considering link independence assumption and Poisson arrival process on each link 17‐21 . A numerical formula is considered in References 12 and 22 to compute the node BP in WDM networks. Similarly, an Erlang B formula has been utilized in the optimization problem in Reference 23 to compute the number of wavelength channels required for lightpath requests for a given threshold value of BP.…”

Section: Introductionmentioning

confidence: 99%

“…Similarly, an Erlang B formula has been utilized in the optimization problem in Reference 23 to compute the number of wavelength channels required for lightpath requests for a given threshold value of BP. A set of non‐linear equations are obtained which are solved using repeated substitution (or iterative) method in References 12 and 22. These models are good for WDM network with the heavy traffic between s‐d pairs so that each link is highly loaded.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An advanced iterative model for computing approximated blocking probabilities and measuring the quality of service in optical communication networks

Khan

Ali

Imtiaz

et al. 2021

Micro & Optical Tech Letters

Self Cite

View full text Add to dashboard Cite

Existing analytical models (EAMs) are used to find the quality of service of optical networks with wavelength division multiplexing (WDM). However, the convergence of EAMs decreases with an increase in traffic load and the numbers of wavelength (w) channels. EAMs are used to compute approximated numerical values of blocking probabilities (BPs) which are based on an iterative approach. There are cases in EAMs when numerical BP values do not converge to a single point after numerous iterations. In this paper, the converge issues of EAMs have been addressed by considering a recursive approximation based on iterative approach with the convergence criteria which is called an advance approximated BP model (AABPM). The accuracy of the AABPM for WDM optical networks is examined by comparing with an EAM as well as simulation results which shows that AABPM converges to give similar approximated numerical values with less convergence time.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An advanced iterative model for computing approximated blocking probabilities and measuring the quality of service in optical communication networks

Khan

Ali

Imtiaz

et al. 2021

Micro & Optical Tech Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…The networks must be designed to achieve a trade-off between network cost and network blocking probability (NBP). The objective of the designed problem must be to minimize network resources for a given designed value of the BP parameter, which has been extensively used in the literature for evaluating the performance of dynamic traffic [13][14][15][16].…”

mentioning

confidence: 99%

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Khan

Khattak

et al. 2021

ETRI Journal

Self Cite

View full text Add to dashboard Cite

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels ( 𝛾 w ) equal to 35.72 % , 39.09 % , and 36.93 % compared to shortest path first routing and 𝛾 w equal to 29.41 % , 37.35 % , and 27.47 % compared to alternate routing in three different networks.

show abstract

Computing approximate blocking probabilities for transparent waveband switching based WDM networks using hierarchical cross-connects

Cited by 2 publications

References 22 publications

An advanced iterative model for computing approximated blocking probabilities and measuring the quality of service in optical communication networks

An advanced iterative model for computing approximated blocking probabilities and measuring the quality of service in optical communication networks

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

Contact Info

Product

Resources

About