Pith. sign in

REVIEW

Forecasting Busy-Hour Downlink Traffic in Cellular Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.01373 v1 pith:CSUNIYAW submitted 2022-07-04 cs.NI

Forecasting Busy-Hour Downlink Traffic in Cellular Networks

classification cs.NI
keywords trafficforecastingnetworkcellularbusyhourmonthsavailable
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The dramatic growth in cellular traffic volume requires cellular network operators to develop strategies to carefully dimension and manage the available network resources. Forecasting traffic volumes is a fundamental building block for any proactive management strategy and is therefore of great interest in such a context. Differently from what found in the literature, where network traffic is generally predicted in the short-term, in this work we tackle the problem of forecasting busy hour traffic, i.e., the time series of observed daily maxima traffic volumes. We tackle specifically forecasting in the long term (one, two months ahead) and we compare different approaches for the task at hand, considering different forecasting algorithms as well as relying or not on a cluster-based approach which first groups network cells with similar busy hour traffic profiles and then fits per-cluster forecasting models to predict the traffic loads. Results on a real cellular network dataset show that busy hour traffic can be forecasted with errors below 10% for look-ahead periods up to 2 months in the future. Moreover, when clusters are available, we improve forecasting accuracy up to 8% and 5% for look-ahead of 1 and 2 months, respectively.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.