All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Shared protection in mesh WDM networks
IEEE Communications Magazine
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
A new analytical model for multifiber WDM networks
IEEE Journal on Selected Areas in Communications
Computing blocking probabilities in multiclass wavelength-routing networks with multicast calls
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.