You are here

A MINI-MAX APPROACH FOR FINDING THRESHOLDS TO CONTROL M/M/2 QUEUES

Journal Name:

Publication Year:

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
Within the framework of this paper, we consider an M/M/2 queuing model where a threshold –on the queue size- type control is assumed for using (or not using) the slower server. The optimization policy to control is based upon a mini-max criterion, which minimizes the maximum “first passage time to an idle period” for the servers. We derived the formulas to calculate the exact value of the optimal threshold, and we analyzed some extreme cases for the explicit expressions to connect the optimal threshold values to the queuing parameters.
FULL TEXT (PDF): 
1353-1364

REFERENCES

References: 

[1] L. Kleinrock , Queuing Systems, Vol. I:
Theory, John Wiley fa Sons,Inc. 1975.
[2] L. Kleinrock , Queuing Systems, Vol. II:
Theory, John Wiley & Sons,Inc. 1976.
[3] M. K. Sis A Dynamic Local Congestion
Reducing Strategy Based on a Mini-Max
Criterion, Ph.D. Dissertation Thesis,
Polytechnic University 1994.
[4] P.E. Sarachik, "Congestion Reducing
Dynamic Routing Strategies for Multidestination
Traffic Networks", IEEE Trans on
Commun., Vol. COM-24, No. 4, April
1984.
[5] S.Ross, "Applied Probability Models with
Optimization Applications", (Chapter 6) Markov
Decision Processes, Holden -Day, San
Francisco, 1970.
[6] W. Lin and P.R, Kumar, "Optimal Control of
a Queuing System with Two Heterogeneous
Servers", IEEE Trans on Automat. Contr.
Vol. AC-29, No. 8, August 1984.
[7] Floyd S. and Jacobson V, "Random Early
detection Gateways in congestion avoidance",
IEEE/ACM Transaction on Networking. Vol.
1, No. 3, 1993

Thank you for copying data from http://www.arastirmax.com