Using importance sampling to simulate queuing networks with heavy-tailed service time distributions
Author(s)
Liman-Tinguiri, Karim
DownloadFull printable version (3.046Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Eytan H. Modiano.
Terms of use
Metadata
Show full item recordAbstract
Characterization of steady-state queue length distributions using direct simulation is generally computationally prohibitive. We develop a fast simulation method by using an importance sampling approach based on a change of measure of the service time in an M/G/1 queue. In particular, we present an algorithm for dynamically finding the optimal distribution within the parametrized class of delayed hazard rate twisted distributions of the service time. We run it on a M/G/1 queue with heavy-tailed service time distributions and show simulation gains of two orders of magnitude over direct simulation for a fixed confidence interval.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. Cataloged from PDF version of thesis. Includes bibliographical references (p. 81-82).
Date issued
2011Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.