Dynamic routing among several intermittently available servers

NGI 2005 - Next Generation Internet Networks: Traffic Engineering

Volumn 2005, Issue , 2005, Pages 1-8

  Martin, S P ^a   Mitrani, I ^a   Glazebrook, K D ^b  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC METHODS; MARKOV PROCESSES; NUMERICAL ANALYSIS; PROBLEM SOLVING; ROUTERS;

FINITE-STATE MARKOV DECISION PROCESS; HEURISTIC POLICIES; ROUTING POLICY;

SERVERS;

EID: 33744478167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NGI.2005.1431640     Document Type: Conference Paper

References (10)

1. S.E. Dreyfus and A.M. Law, The Art and Theory of Dynamic Programming, Academic Press, New York, 1977
2. D.P. Gaver, "A Waiting Line with Interrupted Service, Including Priorities", Journal of the Royal Statistical Society, B, 24, 1, 73-90, 1962
3. K.D. Glazebrook, R.R. Lumley and P.S. Ansell, "Index heuristics for multi-class M/G/1 systems with non-preemptive service and convex holding costs", Queueing Systems, 45, 81-111, 2003.
4. I. Mitrani and P.E. Wright, "Routing in the presence of breakdowns", Performance Evaluation, 20, 151-164, 1994
5. S.M. Ross, Introduction to Stochastic Dynamic Programming, Academic Press, 1986
6. E. de Souza e Silva and H.R. Gail, "The Uniformization Method in Performability Analysis", in Performability Modelling (eds B.R. Haverkort, R. Marie, G. Rubino and K. Trivedi), Wiley, 2001
7. N. Thomas and I. Mitrani, "Routing Among Different Nodes Where Servers Break Down Without Losing Jobs", Procs., IPDS'95, Erlangen, 1995
8. H. Tijms, A First Course in Stochastic Models, Wiley, 2003
9. P. Whittle, Optimization over Time, Vols. 1 and 2, Wiley, 1982
10. P. Whittle, "Restless bandits: Activity allocation in a changing world", Journal of Applied Probability, A25, 287-298, 1988.