415
A Proposal of an Efficient Traffic Matrix Estimation under Packet Drops
Kohei Watabe, Toru Mano, Kimihiro Mizutani, Osamu Akashi, Kenji Nakagawa and Takeru Inoue
Nagaoka University of Technology, NTT Network Innovation Laboratories, NTT Network Innovation Laboratories, NTT Network Innovation Laboratories, Nagaoka University of Technology, NTT Network Innovation Laboratories

Traffic matrix (TM) estimation has been extensively studied for decades. Although conventional estimation techniques assume that traffic volumes are unchanged between origins and destinations, packets are often discarded on a path due to traffic burstiness, silent failures, etc. This paper proposes a novel TM estimation method that works correctly even under packet drops. The method is established on a Boolean fault localization technique; the technique requires fewer counters though it only determines whether each link is healthy. This paper extends the Boolean technique so as to deal with traffic volumes with error bounds just by a small number of counters. Along with submodular optimization for the minimum counter placement, we evaluate our method with real network datasets.