On deciding stability of constrained homogeneous random walks and queueing systems

Mathematics of Operations Research

Volumn 27, Issue 2, 2002, Pages 272-293

  Gamarnik, David ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Queueing system; Scheduling policy; Stability

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL FLUID DYNAMICS; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; QUEUEING NETWORKS; RANDOM PROCESSES; SCHEDULING;

DECIDING STABILITY; FIRST-IN FIRST-OUT; FIXED SCHEDULING POLICY; GENERALIZED PRIORITY POLICY; QUEUEING SYSTEMS; RANDOM WALKS;

ASYMPTOTIC STABILITY;

EID: 0036577783     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.2.272.321     Document Type: Article

References (27)

1. Universal stability results for greedy contention-resolution protocols
2. Stability conditions for multiclass fluid queueing networks
3. Deciding stability and mortality of piecewise affine systems
4. Adversarial queueing theory
5. Instability of FIFO queueing networks
6. On the positive Harris recurrence for multiclass queueing networks: A unified approach via fluid models
7. On the stability of two-station fluid networks
8. Stability of a three-station fluid network
9. Stability and instability of fluid models for certain re-entrant lines
10. Piecewise linear test functions for stability and instability of queueing networks
11. On random walks arising in queueing systems: Ergodicity and transience via quadratic forms as Lyapunov functions-Part II
12. Stability of adaptive and nonadaptive packet routing policies in adversarial queueing networks
13. Using fluid models to prove stability of adversarial queueing networks
14. Stability of networks and protocols in the adversarial queueing model for packet routing
15. What's decidable about hybrid automata
16. The undecidability of the Turing machine immortality problem
17. d
18. Computability properties of low-dimensional dynamical systems
19. Distributed scheduling based on due dates and buffer priorities
20. Classification of two-dimensional positive random walks and almost linear semimartingales
21. Networks and dynamical systems
22. Ergodicity and transience conditions for random walks in the positive octant of space
23. On the ergodicity of stochastic processes describing open queueing networks
24. First come first serve can be unstable
25. Introduction to the theory of computability
26. On the stability of multiclass queueing networks: A relaxed sufficient condition via limiting fluid processes