Optimal routing among ·/M/1 queues with partial information

Stochastic Models

Volumn 20, Issue 2, 2004, Pages 149-171

  Altman, E ^a,b   Jimenez T ^b   Nunez Queija R ^c,d   Yechiali, U ^e  

^a INRIA   (France)

^b UNIVERSIDAD DE LOS ANDES   (Venezuela)

^c CWI   (Netherlands)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^e TEL AVIV UNIVERSITY   (Israel)

Author keywords

Communication networks; Dynamic routing; Nash equilibrium; Non cooperative game; Partial information; Performance optimization; Queueing; Stochastic modeling

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); DECISION MAKING; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; PUBLIC POLICY; ROUTERS; STRATEGIC PLANNING;

DYNAMIC ROUTING; NASH EQUILIBRIUM; NON-COOPERATIVE GAMES; PARTIAL INFORMATION; PERFORMANCE OPTIMIZATION; STOCHASTIC MODELING;

RANDOM PROCESSES;

EID: 2442480678     PISSN: 15326349     EISSN: None     Source Type: Journal    
DOI: 10.1081/STM-120034126     Document Type: Article

References (8)

1. Gail, H.R.; Hantler, S.L.; Taylor, B.A. Spectral analysis of M/G/1 and G/M/1 type Markov chains. Adv. Appl. Probab. 1996, 28, 114-165.
2. Gupta, P.; Kumar, P.R. A system and traffic dependent adaptive routing algorithm for ad hoc networks. Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, USA, Dec 1997; 2375-2380.
3. Hassin, R. On the advantage of being the first server. Manage. Sci. 1996, 42, 618-623.
4. Latouche, G.; Ramaswami, V. A logarithmic reduction algorithm for quasi-birth-death processes. J. Appl. Probab. 1993, 30, 650-674.
5. Mitrani, I. The spectral expansion solution method for markov processes on lattice strips. In Advances in Queueing; Dshalalow, J.H., Ed.; CRC Press: Boca Raton, 1995; 337-352.
6. Mitrani, I.; Mitra, D. A spectral expansion method for random walks on semi-infinite strips. In Iterative Methods in Linear Algebra (Brussels, 1991); Beauwens, R., de Groen, P., Eds.; Elsevier: Amsterdam, 1992; 141-149.
7. Neuts, M.F. Matrix-Geometric Solution in Stochastic Models; an Algorithmic Approach; Johns Hopkins: Baltimore, 1981.
8. Núñez Queija, R. Processor-Sharing Models for Integrated-Services Networks. Ph.D. thesis, Eindhoven University of Technology, ISBN 90-646-4667-8, electronically available at http://www.cwi.nl/~sindo, 2000.