Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A distributed approach to measure IP traffic matrices
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Traffic matrix estimation based on a square root Kalman filtering algorithm
International Journal of Network Management
A fast lightweight approach to origin-destination IP traffic estimation using partial measurements
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The traffic matrix (TM) is one of the crucial inputs in many network management and traffic engineering tasks. As it is usually impossible to directly measure traffic matrices, it becomes an important research topic to infer traffic matrix by reasonably modeling, and incorporating the measurement data of limited links, as well as other additional information. In this paper, we propose Square Root Filtering/Smoothing traffic matrix estimation (SRFsTME) algorithm based on Kalman Smoothing decomposition to improve our proposed Square Root Kalman Filtering traffic matrix estimation (SRKFTME) algorithm. Simulation and actual traffic testing results show that SRFsTME algorithm is more numerical accurate and stable than the SRKFTME algorithm.