Fine-grained latency and loss measurements in the presence of reordering

  • Authors:

  • Myungjin Lee;Sharon Goldberg;Ramana Rao Kompella;George Varghese

  • Affiliations:

  • Purdue University, West Lafayette, IN, USA;Boston University, Boston, MA, USA;Purdue University, West Lafayette, IN, USA;UC San Diego, San Diego, CA, USA

  • Venue:
  • Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate fine-grain end-to-end loss and latency measurements between edge routers in these data center networks. Such a mechanism can allow managers to distinguish between latencies and loss singularities caused by servers and those caused by the network. Compared to prior work, such as Lossy Difference Aggregator (LDA), that focused on switch-level latency measurements, the requirement of end-to-end latency measurements introduces the challenge of reordering that occurs commonly in IP networks due to churn. The problem is even more acute in switches across data center networks that employ multipath routing algorithms to exploit the inherent path diversity. Without proper care, a loss estimation algorithm can confound loss and reordering; further, any attempt to aggregate delay estimates in the presence of reordering results in severe errors. FineComb deals with these problems using order-agnostic packet digests and a simple new idea we call stash recovery. Our evaluation demonstrates that FineComb can provide orders of magnitude better accuracy in loss and delay estimates in the presence of reordering compared to LDA.