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

Edmond W.W. Chan, Ang Chen, Xiapu Luo, Ricky K.P. Mok, Weichao Li, Kow Chuen Chang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

10 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 7th Conference on Emerging Networking EXperiments and Technologies, CoNEXT'11
DOIs
Publication statusPublished - 1 Dec 2011
Event7th ACM International Conference on Emerging Networking EXperiments and Technologies, CoNEXT'11 - Tokyo, Japan
Duration: 6 Dec 20119 Dec 2011

Conference

Conference7th ACM International Conference on Emerging Networking EXperiments and Technologies, CoNEXT'11
CountryJapan
CityTokyo
Period6/12/119/12/11

Keywords

  • bottleneck bandwidth
  • network capacity
  • non-cooperative
  • packet delay
  • packet-pair dispersion

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this