| Type of Document |
Master's Thesis |
| Author |
Rueda, Javier Eduardo
|
| Author's Email Address |
jrueda@vt.edu |
| URN |
etd-12092003-164431 |
| Title |
The Ph(t)/Ph(t)/s/c Queueing Model and Approximation |
| Degree |
Master of Science |
| Department |
Industrial and Systems Engineering |
| Advisory Committee |
| Advisor Name |
Title |
| Taaffe, Michael R. |
Committee Chair |
| Castagliola, Philippe |
Committee Member |
| Lin, Kyle Y. |
Committee Member |
|
| Keywords |
- Polya-Eggenberger
- Queueing
- phase-type
- stochastic
- time-dependent queues
|
| Date of Defense |
2003-12-05 |
| Availability |
unrestricted |
Abstract
Time-dependent queueing models are important since most of real-life problems are time-dependent. We develop a numerical approximation algorithm for the mean, variance and higher-order moments of the number of entities in the system at time t for the Ph(t)/Ph(t)/s/c queueing model. This model can be thought as a reparameterization to the G(t)/GI(t)/s. Our approach is to partition the state space into known and identifiable structures, such as the M(t)/M(t)/s/c or M(t)/M(t)/1 queueing models. We then use the Polya-Eggenberger distribution to approximate certain unknown probabilities via a two-moment matching algorithm. We describe the necessary steps to validate the approximation and measure the accuracy of the model.
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds)
|
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
| |
PhtPhtscThesisR1.pdf |
767.21 Kb |
00:03:33 |
00:01:49 |
00:01:35 |
00:00:47 |
00:00:04 |
|
