Blocking probability, throughput and waiting time in finite capacity polling systems

D. Kofman

doi:10.1007/BF01158875

Blocking probability, throughput and waiting time in finite capacity polling systems

D. Kofman

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

Abstract

The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.

Original language	English
Pages (from-to)	385-411
Number of pages	27
Journal	Queueing Systems
Volume	14
Issue number	3-4
DOIs	https://doi.org/10.1007/BF01158875
Publication status	Published - 1 Sept 1993

Keywords

Finite capacity queues
polling systems
vacation models

Access to Document

10.1007/BF01158875

Cite this

@article{f18c73be091a4c48a49abfff8bc19c9f,

title = "Blocking probability, throughput and waiting time in finite capacity polling systems",

abstract = "The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.",

keywords = "Finite capacity queues, polling systems, vacation models",

author = "D. Kofman",

year = "1993",

month = sep,

day = "1",

doi = "10.1007/BF01158875",

language = "English",

volume = "14",

pages = "385--411",

journal = "Queueing Systems",

issn = "0257-0130",

publisher = "Springer Netherlands",

number = "3-4",

}

TY - JOUR

T1 - Blocking probability, throughput and waiting time in finite capacity polling systems

AU - Kofman, D.

PY - 1993/9/1

Y1 - 1993/9/1

N2 - The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.

AB - The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.

KW - Finite capacity queues

KW - polling systems

KW - vacation models

U2 - 10.1007/BF01158875

DO - 10.1007/BF01158875

M3 - Article

AN - SCOPUS:21344478183

SN - 0257-0130

VL - 14

SP - 385

EP - 411

JO - Queueing Systems

JF - Queueing Systems

IS - 3-4

ER -

Blocking probability, throughput and waiting time in finite capacity polling systems

Abstract

Keywords

Access to Document

Fingerprint

Cite this