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

Predicting short‐term mobile Internet traffic from Internet activity using recurrent neural networks

Author

Listed:
  • Guto Leoni Santos
  • Pierangelo Rosati
  • Theo Lynn
  • Judith Kelner
  • Djamel Sadok
  • Patricia Takako Endo

Abstract

Mobile network traffic prediction is an important input into network capacity planning and optimization. Existing approaches may lack the speed and computational complexity to account for bursting, non‐linear patterns, or other important correlations in time series mobile network data. We compare the performance of two deep learning (DL) architectures, long short‐term memory (LSTM) and gated recurrent unit (GRU), and two conventional machine learning (ML) architectures—Random Forest and Decision Tree—for predicting mobile Internet traffic using 2 months of Telecom Italia data for Milan. K‐Means clustering was used a priori to group cells based on Internet activity, and the Grid Search method was used to identify the best configurations for each model. The predictive quality of the models was evaluated using root mean squared error and mean absolute error. Both DL algorithms were effective in modeling Internet activity and seasonality, both within days and across 2 months. We find variations in performance across clusters within the city. Overall, the DL models outperformed the conventional ML models, and the LSTM outperformed the GRU in our experiments.

Suggested Citation

  • Guto Leoni Santos & Pierangelo Rosati & Theo Lynn & Judith Kelner & Djamel Sadok & Patricia Takako Endo, 2022. "Predicting short‐term mobile Internet traffic from Internet activity using recurrent neural networks," International Journal of Network Management, John Wiley & Sons, vol. 32(3), May.
  • Handle: RePEc:wly:intnem:v:32:y:2022:i:3:n:e2191
    DOI: 10.1002/nem.2191
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2191?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:32:y:2022:i:3:n:e2191. 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.