IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v62y2014i6p1453-1466.html
   My bibliography  Save this article

Limit Theorems for Markovian Bandwidth-Sharing Networks with Rate Constraints

Author

Listed:
  • Josh Reed

    (Stern School of Business, New York University, New York, New York 10012)

  • Bert Zwart

    (Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands)

Abstract

Bandwidth-sharing networks provide a natural modeling framework for describing the dynamic flow-level interaction among elastic data transfers in computer and communication systems, and can be used to develop traffic pricing/charging mechanisms. At the same time, such models are exciting from an operations research perspective because their analysis requires techniques from stochastic modeling and optimization.In this paper, we develop a framework to approximate bandwidth-sharing networks under the assumption that the number of users as well as the capacities of the system are large, and the assumption that the traffic that each user is allowed to submit is bounded above by some rate, which is standard in practice. We also assume that customers on each route in the network abandon according to exponential patience times. Under Markovian assumptions, we develop fluid and diffusion approximations, which are quite tractable: for most parameter combinations, the invariant distribution is multivariate normal, with mean and diffusion coefficients that can be computed in polynomial time as a function of the size of the network.

Suggested Citation

  • Josh Reed & Bert Zwart, 2014. "Limit Theorems for Markovian Bandwidth-Sharing Networks with Rate Constraints," Operations Research, INFORMS, vol. 62(6), pages 1453-1466, December.
    • Handle: RePEc:inm:oropre:v:62:y:2014:i:6:p:1453-1466
    DOI: 10.1287/opre.2014.1321
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2014.1321
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2014.1321?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Heng-Qing Ye & David D. Yao, 2010. "Utility-Maximizing Resource Control: Diffusion Limit and Asymptotic Optimality for a Two-Bottleneck Model," Operations Research, INFORMS, vol. 58(3), pages 613-623, June.
    2. Shlomo Halfin & Ward Whitt, 1981. "Heavy-Traffic Limits for Queues with Many Exponential Servers," Operations Research, INFORMS, vol. 29(3), pages 567-588, June.
    3. Maria Remerova & Josh Reed & Bert Zwart, 2014. "Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 746-774, August.
    4. Heng-Qing Ye & David D. Yao, 2008. "Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation," Operations Research, INFORMS, vol. 56(2), pages 453-470, April.
    5. Urtzi Ayesta & Michel Mandjes, 2009. "Bandwidth-sharing networks under a diffusion scaling," Annals of Operations Research, Springer, vol. 170(1), pages 41-58, September.
    6. Sem Borst & Regina Egorova & Bert Zwart, 2014. "Fluid Limits for Bandwidth-Sharing Networks in Overload," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 533-560, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maria Remerova & Josh Reed & Bert Zwart, 2014. "Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 746-774, August.
    2. Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.
    3. Heng-Qing Ye & David D. Yao, 2012. "A Stochastic Network Under Proportional Fair Resource Control---Diffusion Limit with Multiple Bottlenecks," Operations Research, INFORMS, vol. 60(3), pages 716-738, June.
    4. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    5. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    6. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    7. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    8. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    9. Achal Bassamboo & Assaf Zeevi, 2009. "On a Data-Driven Method for Staffing Large Call Centers," Operations Research, INFORMS, vol. 57(3), pages 714-726, June.
    10. Xiaowei Mei & Hsing Kenneth Cheng & Subhajyoti Bandyopadhyay & Liangfei Qiu & Lai Wei, 2022. "Sponsored Data: Smarter Data Pricing with Incomplete Information," Information Systems Research, INFORMS, vol. 33(1), pages 362-382, March.
    11. Ari Arapostathis & Hassan Hmedi & Guodong Pang, 2021. "On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 772-796, May.
    12. Wanyang Dai, 2013. "Optimal Rate Scheduling via Utility-Maximization for J -User MIMO Markov Fading Wireless Channels with Cooperation," Operations Research, INFORMS, vol. 61(6), pages 1450-1462, December.
    13. van Leeuwaarden, Johan S.H. & Knessl, Charles, 2011. "Transient behavior of the Halfin-Whitt diffusion," Stochastic Processes and their Applications, Elsevier, vol. 121(7), pages 1524-1545, July.
    14. Ramandeep S. Randhawa & Sunil Kumar, 2008. "Usage Restriction and Subscription Services: Operational Benefits with Rational Users," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 429-447, December.
    15. Martino Banchio & Giacomo Mantegazza, 2022. "Artificial Intelligence and Spontaneous Collusion," Papers 2202.05946, arXiv.org, revised Sep 2023.
    16. Zhang, Ping & Serban, Nicoleta, 2007. "Discovery, visualization and performance analysis of enterprise workflow," Computational Statistics & Data Analysis, Elsevier, vol. 51(5), pages 2670-2687, February.
    17. Hsiao-Hui Lee & Edieal J. Pinker & Robert A. Shumsky, 2012. "Outsourcing a Two-Level Service Process," Management Science, INFORMS, vol. 58(8), pages 1569-1584, August.
    18. O. Garnet & A. Mandelbaum & M. Reiman, 2002. "Designing a Call Center with Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 4(3), pages 208-227, October.
    19. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    20. Cui, Zhenyu & Kirkby, J. Lars & Nguyen, Duy, 2021. "Efficient simulation of generalized SABR and stochastic local volatility models based on Markov chain approximations," European Journal of Operational Research, Elsevier, vol. 290(3), pages 1046-1062.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:62:y:2014:i:6:p:1453-1466. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.