Analysis of a Single-Buffer Loss-Delay System

E. Arthurs and B. W. Stuck
Additional contact information
E. Arthurs: Bell Laboratories, Murray Hill, New Jersey
B. W. Stuck: Bell Laboratories, Murray Hill, New Jersey

Operations Research, 1979, vol. 27, issue 1, 65-79

Abstract: Tasks arrive at a finite-capacity buffer according to a Markov counting process conditioned on the number in the buffer. A processor visits the buffer at a random time epoch, serves up to a given maximum number of tasks, leaves, and repeats this process. The probability of buffer overflow, and the waiting time of a task until it is processed are studied as a function of model parameters.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.1.65 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:1:p:65-79

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().