IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v239y2016i2d10.1007_s10479-014-1655-x.html
   My bibliography  Save this article

$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network

Author

Listed:
  • Zsolt Saffer

    (Budapest University of Technology and Economics (BUTE))

  • Sergey Andreev

    (Tampere University of Technology (TUT))

  • Yevgeni Koucheryavy

    (Tampere University of Technology (TUT))

Abstract

In this paper we consider the analysis of an $$M/D^{[y]}/1$$ M / D [ y ] / 1 vacation queue with periodically gated discipline. The motivation of introducing the new periodically gated discipline lies in modeling a kind of contention-based bandwidth reservation mechanism applied in wireless networks. The analysis approach applied here consists of two steps and it is based on appropriately chosen characteristic epochs of the system. We provide approximate expressions for the probability-generating function of the number of customers at arbitrary epoch as well as for the Laplace–Stieljes transform and for the mean of the steady-state waiting time. Several numerical examples are also provided. In the second part of the paper we discuss how to apply the periodically gated vacation model to the non real-time uplink traffic in IEEE 802.16-based wireless broadband networks.

Suggested Citation

  • Zsolt Saffer & Sergey Andreev & Yevgeni Koucheryavy, 2016. "$$M/D^{[y]}/1$$ M / D [ y ] / 1 Periodically gated vacation model and its application to IEEE 802.16 network," Annals of Operations Research, Springer, vol. 239(2), pages 497-520, April.
    • Handle: RePEc:spr:annopr:v:239:y:2016:i:2:d:10.1007_s10479-014-1655-x
    DOI: 10.1007/s10479-014-1655-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1655-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1655-x?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. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    2. Naishuo Tian & Zhe George Zhang, 2006. "Vacation Queueing Models Theory and Applications," International Series in Operations Research and Management Science, Springer, number 978-0-387-33723-4, April.
    3. S. C. Borst & O. J. Boxma, 1997. "Polling Models With and Without Switchover Times," Operations Research, INFORMS, vol. 45(4), pages 536-543, August.
    4. Ronald W. Wolff, 1982. "Poisson Arrivals See Time Averages," Operations Research, INFORMS, vol. 30(2), pages 223-231, April.
    5. Naishuo Tian & Zhe George Zhang, 2006. "Applications of Vacation Models," International Series in Operations Research & Management Science, in: Vacation Queueing Models Theory and Applications, chapter 0, pages 343-358, Springer.
    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. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    2. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    3. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.
    4. Chakravarthy, Srinivas R. & Shruti, & Kulshrestha, Rakhee, 2020. "A queueing model with server breakdowns, repairs, vacations, and backup server," Operations Research Perspectives, Elsevier, vol. 7(C).
    5. Tuan Phung-Duc, 2017. "Exact solutions for M/M/c/Setup queues," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(2), pages 309-324, February.
    6. B. Krishna Kumar & R. Rukmani & A. Thanikachalam & V. Kanakasabapathi, 2018. "Performance analysis of retrial queue with server subject to two types of breakdowns and repairs," Operational Research, Springer, vol. 18(2), pages 521-559, July.
    7. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    8. Yuying Zhang & Dequan Yue & Wuyi Yue, 2022. "A queueing-inventory system with random order size policy and server vacations," Annals of Operations Research, Springer, vol. 310(2), pages 595-620, March.
    9. Jianjun Li & Liwei Liu & Tao Jiang, 2018. "Analysis of an M/G/1 queue with vacations and multiple phases of operation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 51-72, February.
    10. Srinivas R. Chakravarthy & Serife Ozkar, 2016. "Crowdsourcing and Stochastic Modeling," Business and Management Research, Business and Management Research, Sciedu Press, vol. 5(2), pages 19-30, June.
    11. Shunfu Jin & Xiuchen Qie & Wenjuan Zhao & Wuyi Yue & Yutaka Takahashi, 2020. "A clustered virtual machine allocation strategy based on a sleep-mode with wake-up threshold in a cloud environment," Annals of Operations Research, Springer, vol. 293(1), pages 193-212, October.
    12. Amina Angelika Bouchentouf & Abdelhak Guendouzi, 2021. "Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers," SN Operations Research Forum, Springer, vol. 2(1), pages 1-23, March.
    13. F. P. Barbhuiya & U. C. Gupta, 2020. "A Discrete-Time GIX/Geo/1 Queue with Multiple Working Vacations Under Late and Early Arrival System," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 599-624, June.
    14. Alexander Dudin & Sergei Dudin & Valentina Klimenok & Yuliya Gaidamaka, 2021. "Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption," Mathematics, MDPI, vol. 9(13), pages 1-15, June.
    15. Kumar, Anshul & Jain, Madhu, 2023. "Cost Optimization of an Unreliable server queue with two stage service process under hybrid vacation policy," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 259-281.
    16. Igor Kleiner & Esther Frostig & David Perry, 2023. "Busy Periods for Queues Alternating Between Two Modes," Methodology and Computing in Applied Probability, Springer, vol. 25(2), pages 1-16, June.
    17. Oz, Binyamin & Adan, Ivo & Haviv, Moshe, 2019. "The Mn/Gn/1 queue with vacations and exhaustive service," European Journal of Operational Research, Elsevier, vol. 277(3), pages 945-952.
    18. Meena, Rakesh Kumar & Jain, Madhu & Sanga, Sudeep Singh & Assad, Assif, 2019. "Fuzzy modeling and harmony search optimization for machining system with general repair, standby support and vacation," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 858-873.
    19. Park, Hyun-Min & Kim, Tae-Sung & Chae, Kyung C., 2010. "Analysis of a two-phase queueing system with a fixed-size batch policy," European Journal of Operational Research, Elsevier, vol. 206(1), pages 118-122, October.
    20. Janani, B., 2022. "Transient Analysis of Differentiated Breakdown Model," Applied Mathematics and Computation, Elsevier, vol. 417(C).

    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:annopr:v:239:y:2016:i:2:d:10.1007_s10479-014-1655-x. 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.