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

Resource-Sharing Queueing Systems with Fluid-Flow Traffic

Author

Listed:
  • Sai Rajesh Mahabhashyam

    (Oracle Corporation, King of Prussia, Pennsylvania 19406)

  • Natarajan Gautam

    (Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas 77843)

  • Soundar R. T. Kumara

    (Department of Industrial and Manufacturing Engineering, Pennsylvania State University, University Park, Pennsylvania 16802)

Abstract

A system consisting of two buffers, each with independent fluid sources, is considered in this paper. Due to ease of implementation, the output capacities for the two buffers depend on the workload of only one of the buffers that is measured. A threshold-based policy is considered to dynamically assign output capacities for both buffers. Marginal workload distributions for the two buffers need to be evaluated for this policy. The key contribution of this paper is the performance analysis to derive the workload distribution in the two buffers. In addition, the paper also provides some guidelines to choose the output capacities for the two buffers as well as a mathematical program to determine an optimal threshold to dynamically switch between output capacities. Further, various applications of such systems to computer-communication networks are discussed.

Suggested Citation

  • Sai Rajesh Mahabhashyam & Natarajan Gautam & Soundar R. T. Kumara, 2008. "Resource-Sharing Queueing Systems with Fluid-Flow Traffic," Operations Research, INFORMS, vol. 56(3), pages 728-744, June.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:3:p:728-744
    DOI: 10.1287/opre.1070.0483
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0483
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0483?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. M. Dacre & K. Glazebrook & J. Niño‐Mora, 1999. "The achievable region approach to the optimal control of stochastic systems," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(4), pages 747-791.
    2. Palmowski, Zbigniew & Rolski, Tomasz, 1996. "A note on martingale inequalities for fluid models," Statistics & Probability Letters, Elsevier, vol. 31(1), pages 13-21, December.
    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. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    2. Esther Frostig & Gideon Weiss, 2016. "Four proofs of Gittins’ multiarmed bandit theorem," Annals of Operations Research, Springer, vol. 241(1), pages 127-165, June.
    3. R. T. Dunn & K. D. Glazebrook, 2004. "Discounted Multiarmed Bandit Problems on a Collection of Machines with Varying Speeds," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 266-279, May.
    4. José Niño-Mora, 2000. "On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices," Economics Working Papers 456, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Vanlerberghe, Jasper & Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2018. "Calculation of the performance region of an easy-to-optimize alternative for Generalized Processor Sharing," European Journal of Operational Research, Elsevier, vol. 270(2), pages 625-635.
    6. Peter Whittle, 2002. "Applied Probability in Great Britain," Operations Research, INFORMS, vol. 50(1), pages 227-239, February.
    7. José Niño-Mora, 1999. "Restless bandits, partial conservation laws and indexability," Economics Working Papers 435, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Muhammad El-Taha, 2016. "Invariance of workload in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 181-192, June.
    9. José Niño-Mora, 2000. "Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs," Economics Working Papers 514, Department of Economics and Business, Universitat Pompeu Fabra.
    10. Shaler Stidham, 2002. "Analysis, Design, and Control of Queueing Systems," Operations Research, INFORMS, vol. 50(1), pages 197-216, February.
    11. Schlegel, Sabine, 1998. "Ruin probabilities in perturbed risk models," Insurance: Mathematics and Economics, Elsevier, vol. 22(1), pages 93-104, May.
    12. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
    13. Muhammad El-Taha, 2017. "A general workload conservation law with applications to queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 361-381, April.
    14. K.D. Glazebrook & C. Kirkbride, 2004. "Index policies for the routing of background jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 856-872, September.
    15. Jasper Vanlerberghe & Tom Maertens & Joris Walraevens & Stijn Vuyst & Herwig Bruneel, 2016. "On the optimization of two-class work-conserving parameterized scheduling policies," 4OR, Springer, vol. 14(3), pages 281-308, September.

    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:56:y:2008:i:3:p:728-744. 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.