Paper Info
Title
Cyclic-service systems with probabilistically-limited service
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
Year
DOI
Venue
1991
10.1109/49.68446
IEEE Journal on Selected Areas in Communications
Keywords
Field
DocType
Switches,Customer service,Discrete Fourier transforms,Delay,Production systems,Distributed computing,Computer performance
Changeover,Computer performance,Polling system,Computer science,Queue,Computer network,Polling,Real-time computing,Queueing theory,Discrete Fourier transform,Bernoulli's principle
Journal
Volume
Issue
ISSN
9
2
0733-8716
Citations 
PageRank 
References 
31
2.11
10
Authors
1
Name
Order
Citations
PageRank
K. K. Leung157265.81