Estimation of missing RTTs in computer networks: Matrix completion vs compressed sensing

  • Authors:
  • Ziqian Dong;Santhanakrishnan Anand;Rajarathnam Chandramouli

  • Affiliations:
  • Department of Electrical and Computer Engineering, New York Institute of Technology, New York, NY 10023, USA;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ 07030, USA;Department of Electrical and Computer Engineering, Stevens Institute of Technology, Hoboken, NJ 07030, USA

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We estimate the missing round trip time (RTT) measurements in computer networks using doubly non-negative (DN) matrix completion and compressed sensing. The major contributions of this paper are the following: (i) an iterative DN matrix completion that minimizes the mean square estimation error; (ii) mathematical conditions for the convergence of the algorithm; (iii) systematic and detailed experimental comparison of DN matrix completion and compressed sensing for estimating missing RTT estimation in computer networks. To our knowledge, this is the first work that compares the pros and cons of compressed sensing and DN matrix completion for RTT estimation using actual Internet measurement data. Results indicate that compressed sensing provides better estimation in networks with sporadic missing values while DN completion of matrices is more suitable for estimation in networks which miss blocks of measurements. Our proposed DN matrix completion method is one of the first approaches to matrix completion, that minimizes the estimation error.