 D / G /1 Queues with VacationsL. D. Servi
Operations Research, 1986, vol. 34, issue 4, 619-629 Abstract: Many data switching systems have processors with arrival streams of regularly spaced tasks (e.g., individual bytes) requiring attention (e.g., directing the bytes to the appropriate outgoing line). In many of these systems the processor might also be required to handle other jobs (small maintenance routines or secondary tasks that await service in one or more other queues) as well. From the point of view of the primary queue of tasks, the processor ceases its service and takes a vacation. The performance of such a system is determined in part by the processor service schedule. In this paper, we define and analyze a model for investigating the waiting time probability distribution at the primary queue in terms of the primary task arrival rate, the service time distribution for the primary tasks, the probability distribution of the vacation duration, and the processor's service schedule. In addition, we discuss two characteristics of systems of this type that may have important design implications: (i) the steady-state waiting time probability distribution might be dependent upon the initial state of the system; and (ii) the waiting time might not decrease if the service time of the system decreases. Keywords: 642 routing algorithm; 681 vacation models; 690 deterministic queues with vacations (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:4:p:619-629 Access Statistics for this article More articles in Operations Research from INFORMS Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.