Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Passive estimation of TCP round-trip times
ACM SIGCOMM Computer Communication Review
Analysis of factors affecting players' performance and perception in multiplayer games
NetGames '05 Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games
Round-trip time inference via passive monitoring
ACM SIGMETRICS Performance Evaluation Review - Special issue on the First ACM SIGMETRICS Workshop on Large Scale Network Inference (LSNI 2005)
An improved construction for counting bloom filters
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the ACM SIGCOMM 2010 conference
New methods for passive estimation of TCP round-trip times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Dissecting Bufferbloat: measurement and per-application breakdown of queueing delay
Proceedings of the 2013 workshop on Student workhop
| Hi-index | 0.00 |
Estimating per-flow performance characteristics such as latency, loss, and jitter from a location other than the connection end-points can help locate performance problems affecting end-to-end flows. However, doing this accurately in real-time is challenging and requires tracking extensive amounts of TCP state and is thus infeasible on nodes that process large volumes of traffic. In this paper, we propose an approximate and scalable method to estimate TCP flow latency in the network. Our method scales with the number of flows by keeping approximate TCP state in a compressed, probabilistic data structure that requires less memory and compute, but sacrifices a small amount of accuracy. We validate our method using backbone link traces and compare it against an exact, baseline approach. In our approximate method, 99% of the reported latencies are within 10.3 ms of the baseline reported value, while taking an order of magnitude less memory.