MAP/G/1 Queue Under Workload Control and Postprocessing

This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Po...

Full description

Saved in:
Bibliographic Details
Published inStochastic analysis and applications Vol. 27; no. 2; pp. 331 - 352
Main Authors Lee, Ho Woo, Cheon, Sahng Hoon, Lee, Se Won, Baek, Jung Woo
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Taylor & Francis Group 02.03.2009
Taylor & Francis
Subjects
Computation
D-policy
Distribution theory
Exact sciences and technology
MAP/G/1
Mathematical analysis
Mathematical models
Mathematics
Probability and statistics
Probability theory and stochastic processes
Queues
Sciences and techniques of general use
Single-vacation
Stochastic analysis
Stochastic processes
Stochasticity
Workload
Stochastic analysis
Queue length
Generating function
Distribution function
Probability
Probability distribution
Application
Mean estimation
Queue
Online AccessGet full text

Cover

More Information
Summary:This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0736-2994
1532-9356
DOI:10.1080/07362990802678952