Sciweavers

Share
SIGMETRICS
2011
ACM

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

8 years 2 months ago
Fine-grained latency and loss measurements in the presence of reordering
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 r...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella
Added 17 Sep 2011
Updated 17 Sep 2011
Type Journal
Year 2011
Where SIGMETRICS
Authors Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella, George Varghese
Comments (0)
books