DMCA
Polling Systems in Heavy Traffic: A Bessel Process Limit (1996)
| Citations: | 4 - 1 self |
BibTeX
@MISC{Reiman96pollingsystems,
author = {Coffman Puhalskii Reiman and E. G. Coffman and A. A. Puhalskii and M. I. Reiman},
title = {Polling Systems in Heavy Traffic: A Bessel Process Limit},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper studies the classical polling model under the exhaustive-service assumption; such models continue to be very useful in performance studies of computer/communication systems. The analysis here extends earlier work of the authors to the general case of nonzero switchover times. It shows that, under the standard heavy-traffic scaling, the total unfinished work in the system tends to a Bessel-type diffusion in the heavy-traffic limit. It verifies in addition that, with this change in the limiting unfinished-work process, the averaging principle established earlier by the authors carries over to the general model. September 13, 1995 Polling Systems in Heavy Traffic: A Bessel Process Limit E. G. Coffman, Jr., y A. A. Puhalskii, # and M. I. Reiman y y AT&T Bell Laboratories, Murray Hill, NJ 07974 # Institute for Problems in Information Transmission, Moscow, Russia 101447 1 Introduction In classical polling models, M 2 queues are visited by a single server in cyclic or...
Keyphrases
heavy traffic bessel process limit classical polling model single server murray hill unfinished-work process performance study exhaustive-service assumption bell laboratory heavy-traffic limit nonzero switchover time computer communication system general case total unfinished work bessel-type diffusion standard heavy-traffic scaling general model paper study information transmission
