Resource Sharing Networks: Overview and an Open Problem

References

• Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, J. (1975). Open, closed, and mixed networks of queues with different classes of customers. J. of the ACM, 22 248–260. MR0365749Google Scholar
• Bell, S. L. and Williams, R. J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab., 11 608–649. MR1865018Google Scholar
• Bell, S. L. and Williams, R. J. (2005). Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Elect. J. Probab., 10 1044–1115. MR2164040Google Scholar
• Bonald, T. and Proutière, A. (2002). Insensitivity in processor-sharing networks. Performance Evaluation, 49 193–209.Google Scholar
• Bonald, T. and Proutière, A. (2003). Insensitive bandwidth sharing in data networks. Queueing Systems, 44 69–100. MR1989867Google Scholar
• Bramson, M. (2008). Stability of Queueing Networks. Springer, New York. MR2445100Google Scholar
• Chen, H. and Yao, D. D. (2001). Fundamentals of Queueing Networks. Springer, NewYork. MR1835969Google Scholar
• de Veciana, G., Lee, T.-J. and Konstantopoulos, T. (2001). Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. on Networking, 9 2–14Google Scholar
• Harrison, J. M. (1988). Brownian models of queueing networks with heterogeneous customer populations, in W. Fleming and P.-L. Lions (eds.), Stochastic Differential Systems, Stochastic Control Theory and Applications, IMA Volumes in Mathematics and Its Applications, 10 147–186. Springer-Verlag, New York. MR0934722Google Scholar
• Harrison, J. M. (1996). The BIGSTEP approach to flow management in stochastic processing networks, in F. P. Kelly, S. Zachary, and I. Ziedins (eds.), Stochastic Networks: Theory and Applications, 57–90. Oxford University Press.Google Scholar
• Harrison, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab., 10 75–103. Correction 13 (2003) 390–393. MR1765204Google Scholar
• Harrison, J. M. (2013). Brownian Models of Performance and Control. Cambridge University Press, New York. MR3157450Google Scholar
• Harrison, J. M. and J. A. Van Mieghem (1997). Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab., 7 747–771. MR1459269Google Scholar
• Kang, W. N., Kelly, F. P., Lee, N. H. and Williams, R. J. (2009). State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab., 19 1719–1780. MR2569806Google Scholar
• Kelly, F. P. (1979). Reversibility and Stochastic Networks. John Wiley and Sons, New York. MR0554920Google Scholar
• Kelly, F. P. (1997). Charging and rate control for elastic traffic. Eur. Trans. Telecom., 8 33–37.Google Scholar
• Kelly, F. P., Maulloo, A. and Tan, D. (1998). Rate control for communication networks: Shadow price, proportional fairness and stability. J. Oper. Res. Soc., 49 237–252.Google Scholar
• Kelly, F. P. and Williams, R. J. (2004). Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab., 14 1055–1083. MR2071416Google Scholar
• Kenyon, T. (2002). High-Performance Data Network Design. Digital Press. Boston.Google Scholar
• Massoulié, L. and Roberts, J. (2000). Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems, 15 185–201.Google Scholar
• Mo, J. and Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Trans. on Networking, 8 856–567.Google Scholar
• Shah, D., Tsitsiklis, J. N. and Zhong, Y. (2013). Qualitative properties of α-fair policies in bandwidth sharing networks. Ann. Appl. Probab., 24 76–113. MR3161642Google Scholar
• Verloop, I. M., Borst, S.C. and Núñez Queija, R. (2005). Stability of size-based scheduling disciplines in resource-sharing networks. Performance Evaluation, 62 247–262.Google Scholar
• Verloop, I. M. and Núñez Queija, R. (2009). Assessing the efficiency of resource allocations in bandwidth-sharing networks. Performance Evaluation, 66 59–77.Google Scholar
• Walkup, D. W. and Wets, R. J-B. (1969). Lifting projections of convex polyhedra. Pacific J. of Math., 28 465–475. MR0242055Google Scholar
• Zachary, S. (2007). A note on insensitivity in stochastic networks. J. of Appl. Prob., 44 238–248. MR2312999Google Scholar