IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v30y2020i4ne2114.html
   My bibliography  Save this article

Dynamic credit reservation for online charging of regular Internet of things traffic

Author

Listed:
  • Huai‐Sheng Huang
  • Da‐Yu Hung

Abstract

According to the specifications of the Third Generation Partnership Project (3GPP), any online charging system must determine a granted unit (GU) and make reservations for each session before the serving network delivers the service. Allocating insufficient GUs to user equipment may incur excessive quantities of reservation messages; conversely, providing excessive GUs could result in an unbalanced distribution of resources. Therefore, a prudent investigation of a reservation scheme for multiple Internet of things (IoT) devices is urgently needed. In this paper, we focus on IoT devices with regular traffic, which usually generate numerous routine traffic events and few event‐driven traffic events. We combine a fixed‐order quantity model (sometimes called a Q model) and propose a novel solution to this issue. To the best of our knowledge, this is the first research to propose a solution based on such a concept. Compared with typical schemes, the simulation results show that our proposed scheme can maintain the success rate with a smaller‐than‐usual number of messages.

Suggested Citation

  • Huai‐Sheng Huang & Da‐Yu Hung, 2020. "Dynamic credit reservation for online charging of regular Internet of things traffic," International Journal of Network Management, John Wiley & Sons, vol. 30(4), July.
  • Handle: RePEc:wly:intnem:v:30:y:2020:i:4:n:e2114
    DOI: 10.1002/nem.2114
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2114
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2114?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:intnem:v:30:y:2020:i:4:n:e2114. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.