Abstract
We consider a set of n heterogeneous servers which differ in processing time and Quality of Service (QoS). Jobs are divided into m levels with regard to their service ranks. We present a Threshold Policy (TP) depending on number of different jobs in the queues as a practical and flexible dynamic routing policy to control the QoS. Two performance measures are discussed: the QoS and the Average Waiting Time (AWT) in the queues. The TP is compared with both a static routing policy which maximizes the QoS level and the Minimum Expected Delay (MED) policy which minimizes the AWT. Numerical example validate that the proposed TP is more effective when both measures are considered. The TP balances the trade-off between QoS and AWT and therefore it is superior to the MED policy and any static routing which keeps the QoS in a certain level.
Chapter PDF
Similar content being viewed by others
References
Down, D.G., Lewis, M.E.: Dynamic load balancing in parallel queueing systems: Stability and optimal control. European Journal of Operational Research 168, 509–519 (2006)
Winston, W.: Optimality of the shortest line discipline. J. Appl. Prob. 14, 181–189 (1977)
Nelson, R.D., Philips, T.K.: An approximation for the mean response time for shortest queue routing with general interarrival and service times. Perform. Eval. 17, 123–139 (1993)
Nelson, R.D., Philips, T.K.: An approximation to the response time for shortest queue routing. Perform. Eval. 17, 181–189 (1989)
Lui, J.C.S., Muntz, R.R., Towsley, D.: Bounding the mean response time of a minimum expected delay routing system: an algorithmic approach. IEEE Trans. Comput., 1371–1382 (1995)
Lin, W., Kumar, P.R.: Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automat. Control 29, 696–703 (1984)
Koole, G.: A simple proof of the optimality of a threshold policy in a two-server queueing system. Systems & Control Letters 26, 301–303 (1995)
The, Y.C.: Critical Thresholds for Dynamic Routing in Queueing Networks. Queueing Systems 42, 297–316 (2002)
Feng, W., Adachi, K., Kowada, M.: A two-queue and two-server model with a threshold-based control service policy. European Journal of Operational Research 137, 593–611 (2002)
Sun, W., Guo, P., Tian, N.: Equilibrium threshold strategies in observable queueing systems with setup/closedown times. Springer, Heidelberg (2009), doi:10.1007/s10100-009-0104-4
Altman, E., Nain, P.: Optimality of a Threshold Policy in the M/M/1 Queue with Repeated Vacations. Mathematical Methods Operations Research 44, 75–96 (1996)
Thomas, M.U., Wilson, G.R.: Applications of queuing theory, Industrial engineering handbook, 5th edn., vol. 2, pp. 11.67–11.99. Mc-Graw-Hill, New York (2001)
Kendall, N.K.: Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov Chains. Annals of Mathematical Statistics 24, 360–369 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Khodadadi, S.B., Razmi, J. (2010). A Threshold Based Dynamic Routing for Jobs with QoS Ranking. In: Ortiz, Á., Franco, R.D., Gasquet, P.G. (eds) Balanced Automation Systems for Future Manufacturing Networks. BASYS 2010. IFIP Advances in Information and Communication Technology, vol 322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14341-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-14341-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14340-3
Online ISBN: 978-3-642-14341-0
eBook Packages: Computer ScienceComputer Science (R0)