End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Beyond folklore: observations on fragmented traffic
IEEE/ACM Transactions on Networking (TON)
User-level internet path diagnosis
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
An empirical evaluation of wide-area internet bottlenecks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Comparing Probe- and Router-Based Packet-Loss Measurement
IEEE Internet Computing
Improving accuracy in end-to-end packet loss measurement
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Towards unbiased end-to-end network diagnosis
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
It is highly desirable and important for end users, with no special privileges, to identify and pinpoint faults inside the network that degrade the performance of their applications. However, existing tools are inaccurate to infer the link-level loss rates and have large diagnosis granularity. To address these problems, we propose a suite of user-level diagnosis approaches in two categories: (1) the diagnosis tool needs to be deployed only at the source and (2) the tool has to be deployed at both source and destination. For the former, we propose two fragmentation aided diagnosis approaches (FAD), Algebraic FAD and Opportunistic FAD, which use IP fragmentation to enable accurate link-level loss rate inference. For the latter category, we propose Striped Probe Analysis (SPA) which significantly improves the diagnosis granularity over those of the source-only approaches. Internet experiments are applied to evaluate each individual scheme (including an improved version of the state-of-the-art tool, Tulip [R. Mahajan, N. Spring, D. Wetherall, T. Anderson, User-level internet path diagnosis, in: ACM SOSP, 2003]) and various hybrid approaches. The results indicate that our approaches dramatically outperform existing work (especially for diagnosis granularity). But more importantly, we show that combination of different individual approaches (e.g. OFAD+Tulip or OFAD+SPA) provide not only the best performance but also smooth tradeoff among deployment requirement, diagnosis accuracy and granularity.