Benchmarking the State of Networks with a Low-Cost Method Based on Reservoir Computing
Felix Simon Reimers, Carl-Hendrik Peters, Stefano Nichele

TL;DR
This paper presents a low-cost, non-invasive method using reservoir computing to monitor mobile network states by analyzing aggregated data, demonstrating its effectiveness and potential for real-time network health assessment.
Contribution
It introduces a reservoir computing-based approach for network monitoring that leverages readily available data and requires minimal training, offering an inexpensive and agnostic solution.
Findings
Performance correlates with network state changes
Perturbations reduce model performance
Method is energy-efficient and scalable
Abstract
Using data from mobile network utilization in Norway, we showcase the possibility of monitoring the state of communication and mobility networks with a non-invasive, low-cost method. This method transforms the network data into a model within the framework of reservoir computing and then measures the model's performance on proxy tasks. Experimentally, we show how the performance on these proxies relates to the state of the network. A key advantage of this approach is that it uses readily available data sets and leverages the reservoir computing framework for an inexpensive and largely agnostic method. Data from mobile network utilization is available in an anonymous, aggregated form with multiple snapshots per day. This data can be treated like a weighted network. Reservoir computing allows the use of weighted, but untrained networks as a machine learning tool. The network, initialized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Reservoir Computing · Advanced Memory and Neural Computing · Machine Learning and ELM
