Cyclic-service systems with probabilistically-limited service

Author

Leung, Kin K.

Author_Institution

AT&T Bell Labs., Holmdel, NJ, USA

Volume

9

Issue

2

fYear

1991

fDate

2/1/1991 12:00:00 AM

Firstpage

185

Lastpage

193

Abstract

An asymmetric cyclic-service system with a probabilistically limited (PL) service policy is analyzed. In such a service policy, the maximum number of customers served at a queue during a server visit is determined by a probability which is independent of system states. Exhaustive, limited-k, and Bernoulli services are special cases of the PL policy. Customer service times and changeover times have general distribution. A numerical technique based on discrete Fourier transforms is proposed to solve for the queue-length distributions. Thus, the waiting and response-time distribution are obtained. A set of numerical examples is presented to validate the approach

Keywords

Fourier transforms; probability; queueing theory; token networks; Bernoulli services; asymmetric cyclic-service system; discrete Fourier transforms; exhaustive services; limited-k services; polling system; probabilistically-limited service; queue-length distributions; response-time distribution; server visit; token passing system; waiting-time distributions; Computer performance; Customer service; Delay; Discrete Fourier transforms; Distributed computing; Production systems; Switches;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.68446

Filename

68446