TRIO: measuring asymmetric capacity with three minimum round-trip times

  • Authors:
  • Edmond W. W. Chan;Ang Chen;Xiapu Luo;Ricky K. P. Mok;Weichao Li;Rocky K. C. Chang

  • Affiliations:
  • Huawei Research, China, and The Hong Kong Polytechnic University;The Hong Kong Polytechnic University;The Hong Kong Polytechnic University;The Hong Kong Polytechnic University;The Hong Kong Polytechnic University;The Hong Kong Polytechnic University

  • Venue:
  • Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Measuring network path capacity is an important capability to many Internet applications. But despite over ten years of effort, the capacity measurement problem is far from being completely solved. This paper addresses the problem of measuring network paths of asymmetric capacity without requiring the remote node's control or overwhelming the bottleneck link. We first show through analysis and measurement that the current packet-dispersion methods, due to the packet size limitations, can only measure up to a certain degree of capacity asymmetry. Second, we propose TRIO that removes the limitation by using round-trip times (RTTs). TRIO cleverly exploits two types of probes to obtain three minimum RTTs to compute bothforward and reverse capacities, and another minimum RTT for measurement validation. We validate TRIO's accuracy and versatility on a testbed and the Internet, and develop a system to measure path capacity from the server or user side.