Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks
Nicola, Victor F. and Zaburnenko, Tatiana S. (2006) Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks. In: First International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS '2006, 11-13 October 2006, Pisa, Italy.
Restricted to UT campus only: Request a copy
|Abstract:||In this paper we propose state-dependent importance sampling heuristics to estimate the probability of population overﬂow in Markovian networks of series and parallel queues. These heuristics capture state-dependence along the boundaries (when one or more queues are empty) which is critical for the asymptotic optimality of the change of measure. The approach does not require difﬁcult (and often intractable) mathematical analysis or costly optimization involved in adaptive importance sampling methodologies. Experimental results on tandem and parallel networks with a moderate number of nodes yield asymptotically efﬁcient estimates (often with bounded relative error) where no other state-independent importance sampling techniques are known to be efﬁcient. Insight drawn from simulating basic networks in this paper promises the applicability of the proposed methodology to larger networks with more general topologies.
|Item Type:||Conference or Workshop Item|
|Copyright:||© 2006 ACM|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/63921|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 237922