Abstract
An efficient analytical method is presented for the calculation of blocking probabilities in a tandem queuing network with simultaneous resource possession. This queuing network model is motivated from the need to model optical burst switching networks, where the size of the data bursts varies and the link distance between two adjacent network elements also varies depending on the network's topology. A fast single-node decomposition algorithm is developed to compute the blocking probabilities in the network. The algorithm extends the popular link-decomposition method from teletraffic theory by allowing dynamic simultaneous link possession. Simulation is used to validate the accuracy of the algorithm.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
