{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/66438"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/66438","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Using importance sampling to simulate queuing networks with heavy-tailed service time distributions","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Liman-Tinguiri, Karim"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Eytan H. Modiano."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-07-22T22:22:17Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/66438","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Eytan H. Modiano."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Liman-Tinguiri, Karim"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2011-10-17T21:26:02Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2011-10-17T21:26:02Z"]},{"key":"dc:date.issued","label":"Date","values":["2011"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/66438"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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)."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Using importance sampling to simulate queuing networks with heavy-tailed service time distributions"]}]}],"canonical_facts":{"dc:contributor.advisor":["Eytan H. Modiano."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Liman-Tinguiri, Karim"],"dc:date.accessioned":["2011-10-17T21:26:02Z"],"dc:date.available":["2011-10-17T21:26:02Z"],"dc:date.issued":["2011"],"dc: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)."],"dc:description.abstract":["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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/66438"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Using importance sampling to simulate queuing networks with heavy-tailed service time distributions"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:17Z"}