Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
A performance study of an optical burst switched network with dynamic simultaneous link possession
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
An adaptive approach to fast simulation of traffic groomed optical networks
WSC '04 Proceedings of the 36th conference on Winter simulation
Nonstationary analysis of circuit-switched communication networks
Performance Evaluation
Spare capacity provisioning for quasi-static traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
A performance study of an optical burst switched network with dynamic simultaneous link possession
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Analysis and provisioning of a circuit-switched link with variable-demand customers
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Performance analysis of traffic-groomed optical networks employing alternate routing techniques
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Deadline-based connection setup in wavelength-routed WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delays in a series of queues with correlated service times
Journal of Network and Computer Applications
| Hi-index | 0.00 |
In this paper, we consider an optical network consisting of N nodes arranged in tandem. We assume traffic grooming, which permits multiple sub-rate traffic streams to be carried on the same wavelength. This optical network is modeled by a tandem queueing network of multi-rate Erlang loss nodes with simultaneous resource possession, with a view to calculating call blocking probabilities. The queueing network is analyzed by decomposition using a modified version of Courtois' algorithm. Numerical comparisons of the decomposition algorithm against simulation show that the algorithm has good accuracy. Also, it is shown that the proposed algorithm is an improvement over the well-known single-node decomposition algorithm based on the link-independence assumption.