Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An algorithm proposed for busy-period subcomponent analysis of bulk queues

An algorithm proposed for busy-period subcomponent analysis of bulk queues This paper presents an algorithmic procedure for a busy-period subcomponent analysis of bulk queues. A component of interest for many server queues is the periodt k to reduce congestion from a levelk to levelk-1. For anM (x)/M/c system with the possibility of total or partial rejection of batches, it is demonstrated that the expected length of busy periods, the proportion of delayed batch and the steady state queue length probabilities can be easily obtained. The procedure is based on the nested partial sums and monotonic properties of expected lengths of the busy periods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

An algorithm proposed for busy-period subcomponent analysis of bulk queues

Acta Mathematicae Applicatae Sinica , Volume 6 (1) – Jul 15, 2005

Loading next page...
 
/lp/springer-journals/an-algorithm-proposed-for-busy-period-subcomponent-analysis-of-bulk-OVkgtR4wi0
Publisher
Springer Journals
Copyright
Copyright © 1990 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02014713
Publisher site
See Article on Publisher Site

Abstract

This paper presents an algorithmic procedure for a busy-period subcomponent analysis of bulk queues. A component of interest for many server queues is the periodt k to reduce congestion from a levelk to levelk-1. For anM (x)/M/c system with the possibility of total or partial rejection of batches, it is demonstrated that the expected length of busy periods, the proportion of delayed batch and the steady state queue length probabilities can be easily obtained. The procedure is based on the nested partial sums and monotonic properties of expected lengths of the busy periods.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 15, 2005

References