MeasuRouting: A framework for routing assisted traffic monitoring

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Raza, Saqib ^a   Huang, Guanyao ^a   Chuah, Chen Nee ^a   Seetharaman, Srini ^b   Singh, Jatinder Pal ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b DEUTSCHE TELEKOM LABORATORIES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH RESOURCE; FUNDAMENTAL FEATURES; INTRA-DOMAIN ROUTING; INTRA-DOMAIN TRAFFIC; MONITORING APPLICATIONS; NETWORK OPERATOR; OPTIMAL PLACEMENTS; QUALITY OF SERVICE CONSTRAINTS; ROUTING TRAFFIC; SUB-POPULATIONS; THEORETICAL FRAMEWORK; TRAFFIC CHARACTERISTICS; TRAFFIC ENGINEERING; TRAFFIC MONITORING; TRAFFIC ROUTING; TROUBLESHOOTING;

FORENSIC ENGINEERING; HIGHWAY ENGINEERING; OPTIMIZATION; QUALITY OF SERVICE;

MONITORING;

EID: 77953319788     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5461919     Document Type: Conference Paper

References (31)

1. C. Chaudet, E. Fleury, I. G. Lassous, H. Rivano, and M.-E. Voge, "Optimal positioning of active and passive monitoring devices," in Proceedings of ACM CoNEXT, 2005, pp. 71-82.
2. K. Suh and Y. Guo and J. Kurose and D. Towsley, "Locating network monitors: Complexity, heuristics and coverage," in Proceedings of IEEE INFOCOM, March 2005.
3. G. R. Cantieni, G. Iannaccone, C. Barakat, C. Diot, and P. Thiran, "Reformulating the monitor placement problem: Optimal network-wide sampling," in Proceedings of ACM CoNEXT, 2006.
4. "OSPF," http://tools.ietf.org/html/rfc2328, April 1998.
5. "IS-IS," http://tools.ietf.org/html/rfc1142, February 1990.
6. C. Wiseman et al., "A remotely accessible network processor-based router for network experimentation," in Proceedings of the 4th ACM/IEEE ANCS, 2008, pp. 20-29.
7. "The OpenFlow Switch Consortium," http://www.openflowswitch. org.
8. R. Morris, E. Kohler, J. Jannotti, and M. F. Kaashoek, "The Click modular router," in Proceedings of the 17th ACM SOSP, December 1999, pp. 217-231.
9. B. Fortz and M. Thorup, "Internet TE by Optimizing OSPF Weights," in Proceedings of IEEE INFOCOM, March 2000.
10. A. Medina, N. Taft, S. Battacharya, C. Diot, and K. Salamatian, "Traffic matrix estimation: Existing techniques compared and new directions," in Proceedings of ACM SIGCOMM, August 2002.
11. N. Spring, R. Mahajan, and T. Anderson, "Quantifying the Causes of Path Inflation," in Proceedings of ACM SIGCOMM, 2003.
12. Y. Ohara, S. Imahori, and R. V. Meter, "MARA: Maximum alternative routing algorithm," in Proceedings of IEEE INFOCOM, April 2009.
13. F. Yu, R. H. Katz, and T. V. Lakshman, "Gigabit rate packet pattern-matching using tcam," in Proceedings of IEEE ICNP, 2004, pp. 174-183.
14. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep packet inspection using parallel bloom filters," in IEEE Micro, 2003, pp. 44-51.
15. "The abilene network," http://www.internet2.edu.
16. K. C. Claffy, G. C. Polyzos, and H.-W. Braun, "Application of sampling methodologies to network traffic characterization," in Proceedings of ACM SIGCOMM, 1993.
17. B.-Y. Choi and S. Bhattacharyya, "On the Accuracy and Overhead of Cisco Sampled NetFlow," in Proceedings of ACM SIGMETRICS Workshop on Large Scale Network Inference (LSNI), June 2005.
18. N. Duffield, C. Lund, and M. Thorup, "Predicting Resource Usage and Estimation Accuracy in an IP Flow Measurement Collection Infrastructure," in Proceedings of ACM SIGCOMM, 2003, pp. 179-191.
19. C. Estan, K. Keys, D. Moore, and G. Varghese, "Building a Better NetFlow," in Proceedings of ACM SIGCOMM, 2004.
20. C. Estan and G. Varghese, "New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice," ACM Transactions on Computer Systems, vol. 21, no. 3, pp. 270-313, August 2003.
21. N. Hohn and D. Veitch, "Inverting sampled traffic," in Proceedings of ACM SIGCOMM, 2003.
22. R. Kompella and C. Estan, "The Power of Slicing in Internet Flow Measurement," in Proceedings of ACM SIGCOMM, 2005.
23. A. Kumar, M. Sung, J. Xu, and J. Wang, "Data streaming algorithms for efficient and accurate estimation of flow size distribution," in Proceedings of ACM SIGMETRICS, 2004, pp. 177-188.
24. Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An Information- Theoretic Approach to Traffic Matrix Estimation," in Proceedings of ACM SIGCOMM, 2003, pp. 301-312.
25. X. Li, F. Bian, M. Crovella, C. Diot, R. Govindan, G. Iannaccone, and A. Lakhina, "Detection and Identification of Network Anomalies Using Sketch Subspaces," in Proceedings of ACM Internet Measurement Conference, 2006.
26. J. Mai, C.-N. Chuah, A. Sridharan, T. Ye, and H. Zang, "Is sampled data sufficient for anomaly detection?" in Proceedings of ACM IMC, 2006.
27. A. Ramachandran, S. Seetharaman, N. Feamster, and V. Vazirani, "Fast Monitoring of Traffic Subpopulations," in Proceedings of ACM Internet Measurement Conference, 2008.
28. H. V. Madhyastha and B. Krishnamurthy, "A Generic Language for Application-Specific Flow Sampling," ACM Computer Communication Review, vol. 38, no. 2, April 2008.
29. L. Yuan, C.-N. Chuah, and P. Mohapatra, "ProgME: Towards Programmable Network MEasurement," in Proceedings of ACM SIGCOMM, 2007.
30. M. R. Sharma and J. W. Byers, "Scalable Coordination Techniques for Distributed Network Monitoring," in Proceedings of Passive and Active network Measurement (PAM) workshop, April 2005.
31. V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen, "CSAMP: A System for Network-Wide Flow Monitoring," in Proceedings of USENIX NSDI, 2008.