Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Computer Networks
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
