IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v62y2005i3p453-466.html
   My bibliography  Save this article

Controlling an oscillating Jackson-type network having state-dependent service rates

Author

Listed:
  • Arnon Arazi
  • Eshel Ben-Jacob
  • Uri Yechiali

Abstract

We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition – should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is briefly shut down as well, when certain conditions hold. Copyright Springer-Verlag 2005

Suggested Citation

  • Arnon Arazi & Eshel Ben-Jacob & Uri Yechiali, 2005. "Controlling an oscillating Jackson-type network having state-dependent service rates," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 453-466, December.
    • Handle: RePEc:spr:mathme:v:62:y:2005:i:3:p:453-466
    DOI: 10.1007/s00186-005-0041-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-005-0041-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-005-0041-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Arazi, Arnon & Ben-Jacob, Eshel & Yechiali, Uri, 2004. "Bridging genetic networks and queueing theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 332(C), pages 585-616.
    2. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Leite, Saul C. & Fragoso, Marcelo D., 2013. "Diffusion approximation for signaling stochastic networks," Stochastic Processes and their Applications, Elsevier, vol. 123(8), pages 2957-2982.
    2. Kostia Avrachenkov & Efrat Perel & Uri Yechiali, 2016. "Finite-buffer polling systems with threshold-based switching policy," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 541-571, October.

    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. A Rodrigo & M Vazquez & C Carrera, 2006. "Markovian networks in labour markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 526-531, May.
    2. V. Radhamani & B. Sivakumar & G. Arivarignan, 2022. "A Comparative Study on Replenishment Policies for Perishable Inventory System with Service Facility and Multiple Server Vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 229-265, March.
    3. F. Avram & A. Gómez-Corral, 2006. "On bulk-service MAP/PH L,N /1/N G-Queues with repeated attempts," Annals of Operations Research, Springer, vol. 141(1), pages 109-137, January.
    4. Nitin Kumar & F. P. Barbhuiya & U. C. Gupta, 2020. "Unified killing mechanism in a single server queue with renewal input," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 246-259, March.
    5. Sayarshad, Hamid R. & Du, Xinpi & Gao, H. Oliver, 2020. "Dynamic post-disaster debris clearance problem with re-positioning of clearance equipment items under partially observable information," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 352-372.
    6. Gao, Shan & Wang, Jinting, 2014. "Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers," European Journal of Operational Research, Elsevier, vol. 236(2), pages 561-572.
    7. Junping Li, 2024. "Birth–Death Processes with Two-Type Catastrophes," Mathematics, MDPI, vol. 12(10), pages 1-17, May.
    8. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.
    9. Altay, Nezih & Green III, Walter G., 2006. "OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 175(1), pages 475-493, November.
    10. Atencia-Mc.Killop, Ivan & Galán-García, José L. & Aguilera-Venegas, Gabriel & Rodríguez-Cielos, Pedro & Galán-García, MÁngeles, 2018. "A Geo[X]/G[X]/1 retrial queueing system with removal work and total renewal discipline," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 245-253.
    11. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    12. Chi, Hong & Li, Jialian & Shao, Xueyan & Gao, Mingang, 2017. "Timeliness evaluation of emergency resource scheduling," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1022-1032.
    13. Jean-Michel Fourneau & Erol Gelenbe, 2017. "G-Networks with Adders," Future Internet, MDPI, vol. 9(3), pages 1-7, July.
    14. A. Gómez-Corral & M. E. Martos, 2009. "Marked Markovian Arrivals in a Tandem G-Network with Blocking," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 621-649, December.
    15. Caunhye, Aakil M. & Nie, Xiaofeng & Pokharel, Shaligram, 2012. "Optimization models in emergency logistics: A literature review," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 4-13.
    16. D. Anderson & J. Blom & M. Mandjes & H. Thorsdottir & K. Turck, 2016. "A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 153-168, March.
    17. Ivan Atencia & José Luis Galán-García, 2021. "Sojourn Times in a Queueing System with Breakdowns and General Retrial Times," Mathematics, MDPI, vol. 9(22), pages 1-25, November.
    18. Addabbo, Tommaso & Kocarev, Ljupco, 2009. "Periodic dynamics in queuing networks," Chaos, Solitons & Fractals, Elsevier, vol. 41(4), pages 2178-2192.
    19. Gopinath Panda & Veena Goswami, 2022. "Equilibrium Joining Strategies of Positive Customers in a Markovian Queue with Negative Arrivals and Working Vacations," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1439-1466, September.
    20. Balsamo, Simonetta & Marin, Andrea, 2013. "Separable solutions for Markov processes in random environments," European Journal of Operational Research, Elsevier, vol. 229(2), pages 391-403.

    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:spr:mathme:v:62:y:2005:i:3:p:453-466. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.