Skip to main content Accessibility help

Queueing and scheduling in random environments

  • Nicholas Bambos (a1) and George Michailidis (a2)


We consider a processing system, composed of several parallel queues and a processor, which operates in a time-varying environment that fluctuates between various states or modes. The service rate at each queue depends on the processor bandwidth allocated to it, as well as the environment mode. Each queue is driven by a job traffic flow, which may also depend on the environment mode. Dynamic processor scheduling policies are investigated for maximizing the system throughput, by adapting to queue backlogs and the environment mode. We show that allocating the processor bandwidth to the queues, so as to maximize the projection of the service rate vector onto a linear function of the workload vector, can keep the system stable under the maximum possible traffic load. The analysis of the system dynamics is first done under very general assumptions, addressing rate stability and flow conservation on individual traffic and environment evolution traces. The connection with stochastic stability is later discussed for stationary and ergodic traffic and environment processes. Various extensions to feed-forward networks of such nodes, the multi-processor case, etc., are also discussed. The approach advances the methodology of trace-based modelling of queueing structures. Applications of the model include bandwidth allocation in wireless channels with fluctuating interference and allocation of switching bandwidth to traffic flows in communication networks with fluctuating congestion levels.


Corresponding author

Postal address: Department of Management Science and Engineering and Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA.
∗∗ Postal address: Department of Statistics, University of Michigan, Ann Arbor, MI 48109-1092, USA. Email address:


Hide All
[1] Armony, M. and Bambos, N. (2003). Queueing dynamics and maximal throughput scheduling in switched processing systems. Queueing Systems 44, 209252.
[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. 36383643.
[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, 185203.
[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, 259297.
[11] Loynes, R. M. (1962). The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497520.
[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. Suhov, Yu. M., American Mathematical Society, Providence, RI, pp. 185201.
[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, 10671073.
[16] Tassiulas, L. and Ephremides, A. (1993). Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Inf. Theory 39, 466478.
[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, 700709.


MSC classification

Queueing and scheduling in random environments

  • Nicholas Bambos (a1) and George Michailidis (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed