IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v73y2020i4d10.1007_s11235-019-00629-w.html
   My bibliography  Save this article

Modelling time-dependent aggregate traffic in 5G networks

Author

Listed:
  • Vijayalakshmi Chetlapalli

    (Symbiosis Institute of Technology (Constituent of Symbiosis International University))

  • K. S. S. Iyer

    (Member, IEEE)

  • Himanshu Agrawal

    (Symbiosis Institute of Technology [Constitutent of Symbiosis International (Deemed University)])

Abstract

Future wireless networks like 5G will carry an increasingly wide variety of data traffic, with different QoS requirements. In addition to conventional data traffic generated from HTTP, FTP and video streaming applications by mobile broadband users [human-type communication (HTC)], traffic from machine-to-machine (M2M) and Internet-of-Things (IoT) applications [machine-type communication (MTC)] has to be supported by 5G networks. Time-of-day variation in arrival rate of connection-level requests and randomness in length of data sessions in HTC result in randomness in aggregate traffic. In MTC, randomness in traffic arises from random number of devices trying to connect to the base station at any given time. Traffic generated by MTC devices may be either periodic or event-triggered. Nevertheless, it is difficult to model aggregate traffic due to non-stationary nature of traffic generated by each type of service. In this paper, special correlation functions of stochastic point processes called Product Densities (PDs) are used for estimating aggregate traffic under non-stationary arrival rates. For HTC, PDs are defined for estimating time-dependent offered load of connection-level service requests and expected number of ON periods in an interval of time $$(0,T)$$(0,T). The aggregate traffic is evaluated for light-tail (exponential) and heavy-tail (hyper exponential) servicing times. For MTC, PDs are defined for estimating the random number of devices connected to the base station at any time. Another QoS parameter of interest in high speed networks is the expected number of service requests/devices delayed beyond a critical value of delay. Bi-variate PD is defined to estimate the number of service requests/devices delayed beyond a given critical threshold. The results from PD model show close agreement with simulation results. The proposed PD technique proves effective in performance analysis under time-dependent traffic conditions, and is versatile for application to several studies in wireless networks including power consumption, interference and handover performance.

Suggested Citation

  • Vijayalakshmi Chetlapalli & K. S. S. Iyer & Himanshu Agrawal, 2020. "Modelling time-dependent aggregate traffic in 5G networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 73(4), pages 557-575, April.
    • Handle: RePEc:spr:telsys:v:73:y:2020:i:4:d:10.1007_s11235-019-00629-w
    DOI: 10.1007/s11235-019-00629-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-019-00629-w
    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/s11235-019-00629-w?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. Stephen G. Eick & William A. Massey & Ward Whitt, 1993. "Mt/G/\infty Queues with Sinusoidal Arrival Rates," Management Science, INFORMS, vol. 39(2), pages 241-252, February.
    2. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    3. Ward Whitt, 2013. "OM Forum —Offered Load Analysis for Staffing," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 166-169, May.
    4. Ward Whitt, 2016. "Heavy-traffic fluid limits for periodic infinite-server queues," Queueing Systems: Theory and Applications, Springer, vol. 84(1), pages 111-143, October.
    5. Toon Pessemier & Isabelle Stevens & Lieven Marez & Luc Martens & Wout Joseph, 2016. "Quality assessment and usage behavior of a mobile voice-over-IP service," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 61(3), pages 417-432, March.
    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. Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    2. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    3. Rouba Ibrahim & Mor Armony & Achal Bassamboo, 2017. "Does the Past Predict the Future? The Case of Delay Announcements in Service Systems," Management Science, INFORMS, vol. 63(6), pages 1762-1780, June.
    4. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    5. Carol Nash, 2020. "Report on Digital Literacy in Academic Meetings during the 2020 COVID-19 Lockdown," Challenges, MDPI, vol. 11(2), pages 1-24, September.
    6. Opher Baron & Oded Berman & Dmitry Krass & Jianfu Wang, 2017. "Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis," Manufacturing & Service Operations Management, INFORMS, vol. 19(1), pages 52-71, February.
    7. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović, 2018. "Time-varying tandem queues with blocking: modeling, analysis, and operational insights via fluid models with reflection," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 15-47, June.
    8. Alexander Zeifman & Yacov Satin & Ivan Kovalev & Rostislav Razumchik & Victor Korolev, 2020. "Facilitating Numerical Solutions of Inhomogeneous Continuous Time Markov Chains Using Ergodicity Bounds Obtained with Logarithmic Norm Method," Mathematics, MDPI, vol. 9(1), pages 1-20, December.
    9. Yiran Liu & Harsha Honnappa & Samy Tindel & Nung Kwan Yip, 2021. "Infinite server queues in a random fast oscillatory environment," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 145-179, June.
    10. Li, Dongmin & Hu, Qingpei & Wang, Lujia & Yu, Dan, 2019. "Statistical inference for Mt/G/Infinity queueing systems under incomplete observations," European Journal of Operational Research, Elsevier, vol. 279(3), pages 882-901.
    11. Raik Stolletz, 2022. "Optimization of time-dependent queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 481-483, April.
    12. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.
    13. Song-Hee Kim & Ward Whitt, 2013. "Statistical Analysis with Little's Law," Operations Research, INFORMS, vol. 61(4), pages 1030-1045, August.
    14. Eugene Furman & Alex Cressman & Saeha Shin & Alexey Kuznetsov & Fahad Razak & Amol Verma & Adam Diamant, 2021. "Prediction of personal protective equipment use in hospitals during COVID-19," Health Care Management Science, Springer, vol. 24(2), pages 439-453, June.
    15. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    16. Zeifman, A.I. & Razumchik, R.V. & Satin, Y.A. & Kovalev, I.A., 2021. "Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    17. Ward Whitt & Jingtong Zhao, 2017. "Many‐server loss models with non‐poisson time‐varying arrivals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 177-202, April.
    18. Zohar Feldman & Avishai Mandelbaum & William A. Massey & Ward Whitt, 2008. "Staffing of Time-Varying Queues to Achieve Time-Stable Performance," Management Science, INFORMS, vol. 54(2), pages 324-338, February.
    19. Na Li & Xiaorui Li & Paul Forero, 2022. "Physician scheduling for outpatient department with nonhomogeneous patient arrival and priority queue," Flexible Services and Manufacturing Journal, Springer, vol. 34(4), pages 879-915, December.
    20. Andersen, Anders Reenberg & Nielsen, Bo Friis & Reinhardt, Line Blander & Stidsen, Thomas Riis, 2019. "Staff optimization for time-dependent acute patient flow," European Journal of Operational Research, Elsevier, vol. 272(1), pages 94-105.

    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:telsys:v:73:y:2020:i:4:d:10.1007_s11235-019-00629-w. 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.