Fitting the Ph-t/M-t/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks
Nasr, W. W.
Taaffe, M. R.
MetadataShow full item record
This paper considers time-dependent Ph-t/M-t/s/c queueing nodes and small tandem networks of such nodes. We examine characteristics of the departure processes from a multiserver queueing node; in particular, we focus on solving for the first two time-dependent moments of the departure-count process. A finite set of partial moment differential equations is developed to numerically solve for the departure-count moments over specified intervals of time [t(i), t(i) + tau(i)). We also present a distribution fitting algorithm to match these key characteristics with a (Ph-t) over tilde process serving as the approximate departure process. A distribution fitting algorithm is presented for time-dependent point processes where a two-level balanced mixture of Erlang distribution is used to serve as the approximating process. We then use the (Ph-t) over tilde approximating departure process as the approximate composite arrival process to downstream node(s) in a network of tandem queues.
Showing items related by title, author, creator and subject.
Nance, Richard E.; Bhat, U. Narayan (Department of Computer Science, Virginia Polytechnic Institute & State University, 1992), TR-92-62
Abrams, Marc; Batongbacal, Alan; Ribler, Randy; Vazirani, Devendra; Heath, Lenwood S.; Pemmaraju, Sriram V. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1994-06-01), TR-94-22
Scogland, Thomas R. W.; Feng, Wu-chun (Department of Computer Science, Virginia Polytechnic Institute & State University, 2014-08-06), TR-14-03As core counts increase and as heterogeneity becomes more common in parallel computing, we face the prospect of pro gramming hundreds or even thousands of concurrent threads in a single shared-memory system. At these scales, ...