IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v261y2015icp284-301.html
   My bibliography  Save this article

Threshold properties of the M/M/1 queue under T-policy with applications

Author

Listed:
  • Zhang, Xuelu
  • Wang, Jinting
  • Do, Tien Van

Abstract

In this paper, we consider a single server queueing system with a threshold control policy and its application for controlling the energy consumption of a computing server. If the number of customers in the system is less than a threshold, the service rate is set in a low value and it also can be switched to a high value once the number of customers reaches the threshold. We study the monotonicity, convexity or concavity properties of the key performance measures of the system such as the steady-state probability distribution, the expected number of customers in the system and in the queue, the expected sojourn time in the system and the waiting time in the queue, with respect to the threshold. Based on these properties, we further study a real-life problem regarding the energy consumption of a computing server. Numerical results show that the state-dependent service policy is a promising technique to balance the energy consumption and the quality of service of a computing server.

Suggested Citation

  • Zhang, Xuelu & Wang, Jinting & Do, Tien Van, 2015. "Threshold properties of the M/M/1 queue under T-policy with applications," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 284-301.
    • Handle: RePEc:eee:apmaco:v:261:y:2015:i:c:p:284-301
    DOI: 10.1016/j.amc.2015.03.109
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315004233
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.03.109?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. Arie Harel, 1990. "Convexity Properties of the Erlang Loss Formula," Operations Research, INFORMS, vol. 38(3), pages 499-505, June.
    2. K. R. Balachandran, 1973. "Control Policies for a Single Server System," Management Science, INFORMS, vol. 19(9), pages 1013-1018, May.
    3. Daniel P. Heyman, 1977. "The T-Policy for the M/G/1 Queue," Management Science, INFORMS, vol. 23(7), pages 775-778, March.
    4. Per Hokstad, 1978. "Approximations for the M / G / m Queue," Operations Research, INFORMS, vol. 26(3), pages 510-523, June.
    5. Arie Harel, 1988. "Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas," Management Science, INFORMS, vol. 34(8), pages 959-972, August.
    6. Arie Harel, 1988. "Erratum to: Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas," Management Science, INFORMS, vol. 34(10), pages 1277-1277, October.
    7. Alan J. Rolfe, 1971. "A Note on Marginal Allocation in Multiple-Server Service Systems," Management Science, INFORMS, vol. 17(9), pages 656-658, May.
    8. Pengfei Guo & Refael Hassin, 2011. "Strategic Behavior and Social Optimization in Markovian Vacation Queues," Operations Research, INFORMS, vol. 59(4), pages 986-997, August.
    9. Arie Harel & Paul H. Zipkin, 1987. "Strong Convexity Results for Queueing Systems," Operations Research, INFORMS, vol. 35(3), pages 405-418, June.
    10. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    11. M. E. Dyer & L. G. Proll, 1977. "Note--On the Validity of Marginal Analysis for Allocating Servers in M/M/c Queues," Management Science, INFORMS, vol. 23(9), pages 1019-1022, May.
    12. Lotfi Tadj & Gautam Choudhury, 2005. "Optimal design and control of queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 359-412, December.
    13. Arie Harel, 2011. "Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant," Operations Research, INFORMS, vol. 59(6), pages 1420-1426, December.
    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. R. Sivasamy & N. Thillaigovindan & G. Paulraj & N. Paranjothi, 2019. "Quasi-birth and death processes of two-server queues with stalling," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 739-756, September.

    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. Arie Harel, 2011. "Convexity Results for the Erlang Delay and Loss Formulae When the Server Utilization Is Held Constant," Operations Research, INFORMS, vol. 59(6), pages 1420-1426, December.
    2. Doǧan A. Serel & Erdal Erel, 2008. "Coordination of staffing and pricing decisions in a service firm," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 24(4), pages 307-323, July.
    3. M. Eric Johnson & Margaret L. Brandeau, 1999. "Design of an Automated Shop Floor Material Handling System with Inventory Considerations," Operations Research, INFORMS, vol. 47(1), pages 65-80, February.
    4. Miaomiao Yu & Attahiru Sule Alfa, 2016. "Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue," Operational Research, Springer, vol. 16(2), pages 161-179, July.
    5. uit het Broek, Michiel A.J. & Van der Heide, Gerlach & Van Foreest, Nicky D., 2020. "Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs," European Journal of Operational Research, Elsevier, vol. 287(3), pages 916-928.
    6. Dong-Yuh Yang & Po-Kai Chang, 2015. "A parametric programming solution to the -policy queue with fuzzy parameters," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(4), pages 590-598, March.
    7. Daniel Adelman, 2007. "Price-Directed Control of a Closed Logistics Queueing Network," Operations Research, INFORMS, vol. 55(6), pages 1022-1038, December.
    8. Yaxing He & Yinghui Tang & Miaomiao Yu & Wenqing Wu, 2024. "Performance and Optimization Analysis of a Queue with Delayed Uninterrupted Multiple Vacation and N-Policy," Methodology and Computing in Applied Probability, Springer, vol. 26(2), pages 1-28, June.
    9. Saif Benjaafar & Shining Wu & Hanlin Liu & Einar Bjarki Gunnarsson, 2022. "Dimensioning On-Demand Vehicle Sharing Systems," Management Science, INFORMS, vol. 68(2), pages 1218-1232, February.
    10. Ramandeep S. Randhawa, 2016. "Optimality gap of asymptotically derived prescriptions in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 131-155, June.
    11. Linda V. Green & Peter J. Kolesar, 1998. "A Note on Approximating Peak Congestion in Mt/G/\infty Queues with Sinusoidal Arrivals," Management Science, INFORMS, vol. 44(11-Part-2), pages 137-144, November.
    12. Tirdad, Ali & Grassmann, Winfried K. & Tavakoli, Javad, 2016. "Optimal policies of M(t)/M/c/c queues with two different levels of servers," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1124-1130.
    13. J. Smith, 2015. "Optimal workload allocation in closed queueing networks with state dependent queues," Annals of Operations Research, Springer, vol. 231(1), pages 157-183, August.
    14. Zhen Wang & Liwei Liu & Yiqiang Q. Zhao, 2022. "Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 870-908, May.
    15. P. Vijaya Laxmi & E. Girija Bhavani & K. Jyothsna, 2023. "Analysis of Markovian queueing system with second optional service operating under the triadic policy," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 256-275, March.
    16. Michelle Opp & Kevin Glazebrook & Vidyadhar G. Kulkarni, 2005. "Outsourcing warranty repairs: Dynamic allocation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 381-398, August.
    17. Vincent W. Slaugh & Bahar Biller & Sridhar R. Tayur, 2016. "Managing Rentals with Usage-Based Loss," Manufacturing & Service Operations Management, INFORMS, vol. 18(3), pages 429-444, July.
    18. Wang, Jinting & Zhang, Xuelu & Huang, Ping, 2017. "Strategic behavior and social optimization in a constant retrial queue with the N-policy," European Journal of Operational Research, Elsevier, vol. 256(3), pages 841-849.
    19. Cavada, Juan P. & Cortés, Cristián E. & Goic, Marcel & Weintraub, Andrés & Zambrano, Juan I., 2020. "Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 287(3), pages 820-831.
    20. Ward Whitt, 2006. "Sensitivity of Performance in the Erlang-A Queueing Model to Changes in the Model Parameters," Operations Research, INFORMS, vol. 54(2), pages 247-260, April.

    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:eee:apmaco:v:261:y:2015:i:c:p:284-301. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.