The Community for Technology Leaders
Simulation Symposium, Annual (2005)
San Diego, California, USA
Apr. 4, 2005 to Apr. 6, 2005
ISSN: 1080-241X
ISBN: 0-7695-2322-6
pp: 15-22
Alicia Nicki Washington , North Carolina State University
Chih-Chieh Hsu , North Carolina State University
Harry Perros , North Carolina State University
Michael Devetsikiotis , North Carolina State University
<p>We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with simultaneous resource possession. Two approximation methods are proposed for the analysis of this queueing network assuming that the total number of servers in each multi-rate loss queue is very large. The accuracy of these two approximation methods as well as the accuracy of the familiar link independence algorithm is verified by simulation.</p> <p>As an additional contribution, the simulation estimates have been obtained using adaptive rare-event simulation techniques based on importance sampling. This is because call blocking probabilities tend to be very small and it is not feasible to estimate them using standard simulation techniques</p>

M. Devetsikiotis, H. Perros, C. Hsu and A. N. Washington, "Approximation Techniques for the Analysis of Large Traffic-Groomed Tandem Optical Networks," Proceedings. 38th Annual Simulation Symposium(ANSS), San Diego, CA, USA, 2005, pp. 15-22.
95 ms
(Ver 3.3 (11022016))