On parallel queuing with random server connectivity and routing constraints

Probability in the Engineering and Informational Sciences

Volumn 16, Issue 2, 2002, Pages 185-203

  Bambos, Nicholas ^a   Michailidis, George ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING; INDUSTRIAL ENGINEERING;

BUFFER OVERFLOWS; CLASSICAL MODEL; COMPLICATED STRUCTURES; COUPLING METHODS; PARALLEL QUEUES; QUEUING MODELS; RANDOM ACCESSIBILITY; TARGET APPLICATION;

QUEUEING THEORY;

EID: 0036011682     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964802162048     Document Type: Article

References (12)

1. Bambos, N. & Michailidis, G. (1995). On the stationary dynamics of parallel queues with random server connectivities. Proceedings of the 34th Conference on Decision and Control, New Orleans, LA, pp. 3638-3643.
2. Kamae, T., Krengel, V., & O'Brien, G.L. (1978). Stochastic inequalities on partially ordered spaces. Annals of Probability 6: 1044-1049.
3. Lindvall, T. (1992). Lectures on the coupling method. New York: Wiley.
4. Lott, C. & Teneketzis, D. (2000). On the optimality of an index rule in multichannel allocation for single-hop mobile networks with multiple service classes. Probability in the Engineering and Information Sciences 14: 259-297.
5. Marshall, A.W. & Olkin, I. (1979). Inequalities: Theory of majorization and its applications. New York: Academic Press.
6. Menich, R. & Serfozo, R.D. (1991). Optimality of routing and servicing in dependent parallel processing systems. Queueing Systems: Theory and Applications 9: 403-418.
7. Ross, S.M. (1995). Stochastic processes, 2nd ed. New York: Wiley.
8. Shaked, M. & Shanthikumar, J.G. (1994). Stochastic orders and their applications. New York: Academic Press.
9. Sparragis, P.D., Towsley, D., & Cassandras, C.G. (1993). Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates. Journal of Applied Probability 30: 223-236.
10. Tassiulas, L. & Ephremides, A. (1993). Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory IT-39: 466-478.
11. Wasserman, K.M. & Bambos, N. (1996). Optimal server allocation to parallel queues with finite capacity buffers. Probability in the Engineering and Information Sciences 10: 279-285.
12. Wasserman, K.M. & Lennon-Olsen, T. (2001). On mutually interfering parallel servers subject to external disturbances. Operations Research 49: 700-709.