Queueing and scheduling in random environments

Advances in Applied Probability

Volumn 36, Issue 1, 2004, Pages 293-317

  Bambos, Nicholas ^a,c   Michailidis, George ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Stanford University ^*  (United States)

Author keywords

Bandwidth allocation; Computer network; Dynamic scheduling; Processing network; Stability of queues; Wireless network

Indexed keywords

DYNAMIC SCHEDULING; PROCESSING NETWORKS; STABILITY OF QUEUES; WIRELESS NETWORKS;

BANDWIDTH; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); FREQUENCY ALLOCATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING; SWITCHING; THROUGHPUT; VECTORS; WIRELESS TELECOMMUNICATION SYSTEMS;

QUEUEING THEORY;

EID: 1842509711     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1077134474     Document Type: Article

References (18)

1. ARMONY, M. AND BAMBOS, N. (2003). Queueing dynamics and maximal throughput scheduling in switched processing systems. Queueing Systems 44, 209-252.
2. BACCELLI, F. AND BRÉMAUD, P. (1994). Elements of Queueing Theory. Springer, New York.
3. BAMBOS, N. AND MICHAILIDIS, G. (1995). On the stationary dynamics of parallel queues with random server connectivities. In Proc. 34th Conf. Decision Control (New Orleans, LA), IEEE Control Systems Society, pp. 3638-3643.
4. BAMBOS, N. AND MICHAILIDIS, G. (2001). Processor scheduling in fluctuating environments. Adaptive bandwidth allocation for throughput maximization. Tech. Rep. NetLab-2001-11/01, Engineering Library, Stanford University.
5. BAMBOS, N. AND MICHAILIDIS, G. (2001). Queueing networks of random link topology; stationary dynamics of maximal throughput schedules. Tech. Rep. NetLab-2001-10/02, Stanford University.
6. BAMBOS, N. AND MICHAILIDIS, G. (2002). On parallel queueing with random server connectivity and routing constraints. Prob. Eng. Inf. Sci. 16, 185-203.
7. BRANDT, A., FRANKEN, P. AND LISEK, B. (1990). Stationary Stochastic Models. John Wiley, Chichester.
8. EL-TAHA, M. AND STIDHAM, S. (1999). Sample-Path Analysis of Queueing Systems. Kluwer, Boston, MA.
9. LOOMIS, L. H. AND STERNBERG, S. (1990). Advanced Calculus. Revised Edition. Jones and Bartlett, Boston, MA.
10. LOTT, C. AND TENEKETZIS, D. (2000). On the optimality of an index rule in multichannel allocation for single-hop mobile networks with multiple service rates. Prob. Eng. Inf. Sci. 14, 259-297.
11. LOYNES, R. M. (1962). The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497-520.
12. PETERSEN, K. (1983). Ergodic Theory. Cambridge University Press.
13. SHAKKOTTAI, S. AND STOLYAR, A. L. (2002). Scheduling for multiple flows sharing a time-varying channel: the exponential rule. In Analytic Methods in Applied Probability. In memory of Fridrikh Karpelevich (Amer. Math. Soc. Trans. Ser. 2 207), ed. Yu. M. Suhov, American Mathematical Society, Providence, RI, pp. 185-201.
14. STOLYAR, A. L. (2001). MaxWeight scheduling in a generalized switch: state space collapse and equivalent workload minimization under complete resource pooling. Preprint.
15. TASSIULAS, L. (1997). Scheduling and performance limits of networks with constantly changing topology. IEEE Trans. Inf. Theory 43, 1067-1073.
16. TASSIULAS, L. AND EPHREMIDES, A. (1993). Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inf. Theory 39, 466-478.
17. WALTERS, P. (1982). Introduction to Ergodic Theory (Graduate Texts Math. 79). Springer, New York.
18. WASSERMAN, K. AND OLSEN, T. L. (2001). On mutually interfering parallel servers subject to external disturbances. Operat. Res. 49, 700-709.