Optimal routing in two parallel queues with exponential service times

Discrete Event Dynamic Systems: Theory and Applications

Volumn 16, Issue 1, 2006, Pages 71-107

  Gaujal, Bruno ^a   Hyon, Emmanuel ^b   Jean Marie, Alain ^c  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c LIRMM   (France)

Author keywords

Open Looprouting; Parallel queues; Sturmian words

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; QUEUEING NETWORKS;

OPEN-LOOPROUTING; PARALLEL QUEUES; STURMIAN WORDS;

ROUTERS;

EID: 32944479817     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-006-6179-3     Document Type: Conference Paper

References (23)

1. Altman E (2001). Markov decision processes, models, methods, directions, and open problems, chapter applications of Markov decision processes in communication networks: a survey. Kluwer, pp 488-536.
2. Altman E, Gaujal B, Hordijk, A (2000a). Balanced sequences and optimal routing. J Assoc Comput Mach 47:752-775.
3. Altman E, Gaujal B, and Hordijk A (2000b). Multimodularity, convexity and optimization properties. Math Oper Res 25:324-347.
4. Altman E, Gaujal B, Hordijk A (2002). Discrete-event control of stochastic networks: multimodularity and regularity. Springer, to appear.
5. Baccelli F, Bremaud P (1992). Elements of queueing theory. Springer.
6. Combe M, Boxma O (1994). Optimization of static traffic allocation policies. Theor Comp Sci 125:17-43.
7. Gaujal B, Hyon E (2001). Optimal routing policies in two deterministic queues. Réseaux et systèmes répartis, Calculateurs Parallèles 13(6):601-633.
8. Gaujal B, Hyon E (2002). Optimal routing policies in deterministic queues in tandem. WODES, IEEE, pp 251-257.
9. Gross D, Harris C (1985). Fundamentals of queueing theory. 2nd edn. Wiley.
10. Hajek B (1984). Optimal control of two interacting service stations. IEEE Trans Automat Contr 29:491-499.
11. Hajek B (1985). Extremal splittings of point processes. Math Oper Res 10(4):543-556.
12. Hordijk A, van der Laan D (2003). Note on the convexity of the stationary waiting time as a function of the density. Probab Eng Inf Sci 17:503-508.
13. Hordijk A, Koole G, Loeve J (1994). Analysis of a customer assignment model with no state information. Probab Eng Inf Sci 8:419-429.
14. Latouche G, Ramaswami V (1993). A logarithmic reduction algoritm for quasi-birth-death processes. J Appl Probab 30:650-674.
15. Liu Z, Righter R (1998). Optimal load balancing on distributed homogeneous unreliable processors. J Oper Res 46:563-573.
16. Loeve JA (1995). Markov decision chains with partial information. PhD thesis. Leiden University.
17. Lothaire M (2002). Algebraic combinatorics on words, chapter sturmian words. Cambridge University Press.
18. Milito R, Fernandez-Gaucherand E (1995a). Open-loop routing of m arrivals to m parallel queues. IEEE Trans Automat Contr 40:2108-2114.
19. Milito R, Fernandez-Gaucherand E (1995b). Routing arrivals to m parallel queues. Conference on decision and control. IEEE, pp 1415-1420.
20. Neuts M (1981). Matrix-geometric solutions in stochastic models an algoritmic approach. John Hopkins University Press.
21. Neuts M (1989). Structured stochastic matrices of M/G/1 type and their applications. Marcel Dekker.
22. van der Laan D (2003). The structure and performance of optimal routing sequences. PhD thesis, Leiden University.
23. Ye Q (2002). On Latouche-Ramaswami's logarithmic reduction algorithm for quasi-birth-and-death processes. Stochastics models 18:449-467.