Scalable and Accurate Monitoring and Diagnosis of Large Networks
To understand the behavior of Internet and provide adaptation to Internet applications with overlay network monitoring, diagnosis and inferences.
- David Bindel (grad, UC Berkeley)
- Guohan Lu (Tsinghua University, China)
- Brian Chavez (undergrad, UCSC)
- Hanhee Song (undergrad, UC Berkeley)
- Randy Katz (faculty, UC Berkeley)
- Lili Qiu (Microsoft Research)
- Tony McGregor (NLANR)
- Chris Overton, Jing Zhi (Keynote)
- Tomography-based Overlay Network Monitoring (TOM)
- Measure the minimal number of paths (O(nlogn)) to infer the loss rates of all other paths on an overlay network of n nodes.
- Least-biased End-to-end Network Diagnosis (LEND)
- Pure end-to-end based measurement to infer the link-level loss rate.
- Fragmentation Aided Diagnosis (FAD)
- A router-response based approach to infer link-level loss rate without any receiver support.
- Packet fOrwarding Priority Inference (POPI)
- Use end-to-end measurements to infer the packet forwarding priorities on routers.
- Y. Chen, D. Bindel, H. Song, and R. H. Katz, An Algebraic Approach to Practical and Scalable Overlay Network Monitoring, in Proceedings of ACM SIGCOMM, 2004
- Y. Zhao, Y. Chen, and D. Bindel, Towards Deterministic Network Diagnosis, poster paper in ACM SIGMETRICS/Performance 2006
- Yao Zhao, Yan Chen, and David Bindel, Towards Unbiased End-to-End Network Diagnosis, in Proc. of ACM SIGCOMM 2006
- Yao Zhao and Yan Chen, A Suite of Schemes for User-level Network Diagnosis without Infrastructure, in the Proc. of IEEE INFOCOM, 2007 (252/1400=18%). Full version is in the tech report.
Matlab code of TOM is here. The README file describes the code and usage.
Linux source code is available at below. It has been tested on Fedora Core 4. Read the README files in each directory first.
- AFAD toy: a toy code of AFAD which takes only one destination and then ping with normal and fragmented packets.
- OFAD toy: a toy code of OFAD which takes only one destination.
- SPA toy: a toy code of SPA.