A restatement of standard queueing theory for when a hypothetical ISP network becomes overloaded, with no real data or code.
Towards a Unified Method for Network Dynamic via Adversarial Weighted Link Prediction
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Network dynamic (e.g., traffic burst in data center networks and channel fading in cellular WiFi networks) has a great impact on the performance of communication networks (e.g., throughput, capacity, delay, and jitter). This article proposes a unified prediction-based method to handle the dynamic of various network systems. From the view of graph deep learning, I generally formulate the dynamic prediction of networks as a temporal link prediction task and analyze the possible challenges of the prediction of weighted networks, where link weights have the wide-value-range and sparsity issues. Inspired by the high-resolution video frame prediction with generative adversarial network (GAN), I try to adopt adversarial learning to generate high-quality predicted snapshots for network dynamic, which is expected to support the precise and fine-grained network control. A novel high-quality temporal link prediction (HQ-TLP) model with GAN is then developed to illustrate the potential of my basic idea. Extensive experiments for various application scenarios further demonstrate the powerful capability of HQ-TLP.
citation-role summary
citation-polarity summary
fields
cs.NI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Mathematical Modeling for Network Upgrades in Internet Service Provider Infrastructure
A restatement of standard queueing theory for when a hypothetical ISP network becomes overloaded, with no real data or code.