| dc.identifier.uri | http://hdl.handle.net/11401/78367 | |
| dc.description.sponsorship | This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree | en_US |
| dc.format | Monograph | |
| dc.format.medium | Electronic Resource | en_US |
| dc.format.mimetype | Application/PDF | en_US |
| dc.language.iso | en_US | |
| dc.type | Dissertation | |
| dcterms.abstract | This thesis mainly studies perfect simulation methodology for the time-varying queueing systems including time varying queue with a single server ($M_t/G_t/1$ and G_t/G/1) and time-varying queue with multi-servers ($G_t/G/c$). Firstly, we introduce how to simulate the $M_t/G_t/1$ queue by an auxiliary process and then proposed a perfect sampling algorithm for it, which works effectively verified by numerical results. Secondly, two perfect sampling algorithms for the $G_t/G/1$ queue are proposed. One of them is based on a technique called Dominated Coupling From The Past (DCFTP), which was given by proposed by Propp and Wilson in 1996, by taking the Vacation System (VS) as a dominant queue. The other one shows how can $G_t/G/1$ be sampled directly without any dominant queues. Besides, corresponding numerical results are reported in the end to show the effectiveness of the algorithms. At last, we give two perfect sampling algorithms for $G_t/G/c$ queue. Both of them takes advantage of the DCFTP technique but with different dominant queues, which are the VS model and $G_t/G/c$ under Random Assignment (RA) discipline. The accuracy and efficiency of the algorithms are verified by corresponding numerical experiments. Moreover, the performances for VS and RA models are compared in the end, which shows that for large $c (=10)$, RA model performs better than VS. | |
| dcterms.available | 2018-07-09T14:28:03Z | |
| dcterms.contributor | Xing, Haipeng | en_US |
| dcterms.contributor | Hu, Jiaqiao | en_US |
| dcterms.contributor | Chen, Xinyun. | en_US |
| dcterms.contributor | Gandhi, Anshul | en_US |
| dcterms.contributor | Sasansuma, Katsunobu. | en_US |
| dcterms.creator | Shi, Xianjun | |
| dcterms.dateAccepted | 2018-07-09T14:28:03Z | |
| dcterms.dateSubmitted | 2018-07-09T14:28:03Z | |
| dcterms.description | Department of Applied Mathematics and Statistics. | en_US |
| dcterms.extent | 105 pg. | en_US |
| dcterms.format | Monograph | |
| dcterms.identifier | http://hdl.handle.net/11401/78367 | |
| dcterms.identifier | SHI_grad.sunysb_0771E_13347.pdf | en_US |
| dcterms.issued | 2017-08-01 | |
| dcterms.language | en_US | |
| dcterms.provenance | Submitted by Jason Torre (fjason.torre@stonybrook.edu) on 2018-07-09T14:28:03Z
No. of bitstreams: 1
SHI_grad.sunysb_0771E_13347.pdf: 2442796 bytes, checksum: 16e5f4d9989e3f3dec522db4deabf203 (MD5) | en |
| dcterms.provenance | Made available in DSpace on 2018-07-09T14:28:03Z (GMT). No. of bitstreams: 1
SHI_grad.sunysb_0771E_13347.pdf: 2442796 bytes, checksum: 16e5f4d9989e3f3dec522db4deabf203 (MD5)
Previous issue date: 2017-08-01 | en |
| dcterms.subject | Applied mathematics | |
| dcterms.subject | DCFTP | |
| dcterms.subject | Perfect Sampling | |
| dcterms.subject | Operations research | |
| dcterms.subject | Queueing System | |
| dcterms.subject | Random Assignment | |
| dcterms.subject | Time-Varying | |
| dcterms.subject | Vacation System | |
| dcterms.title | Perfect Sampling for Queueing Systems | |
| dcterms.type | Dissertation | |
