Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Traffic matrices: balancing measurements, inference and modeling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Joint time-frequency sparse estimation of large-scale network traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
An approximation method of origin-destination flow traffic from link load counts
Computers and Electrical Engineering
Multi-path routing in Spatial Wireless Ad Hoc networks
Computers and Electrical Engineering
Joint scheduling and routing algorithm with load balancing in wireless mesh network
Computers and Electrical Engineering
A compressive sensing-based reconstruction approach to network traffic
Computers and Electrical Engineering
A new coding- and interference-aware routing protocol in wireless mesh networks
Computers and Electrical Engineering
Fault-tolerant routing mechanism based on network coding in wireless mesh networks
Journal of Network and Computer Applications
A channel estimation based opportunistic scheduling scheme in wireless bidirectional networks
Journal of Network and Computer Applications
Hi-index | 0.00 |
This letter proposes a novel method to estimate large-scale IP traffic matrix (TM). By using the Generalized Autoregressive Conditional Heteroscedasticity (GARCH) to model the Origin-Destination (OD) flows, we can easily get rid of the ill-posed problem of large-scale IP TM. Compared with previous methods, our method does not only hold the lower estimation errors but also is more robust to the noise.