A programmable architecture for scalable and real-time network traffic measurements

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS '08

Volumn , Issue , 2008, Pages 109-118

  Khan, Faisal ^a   Yuan, Lihua ^a   Chuah, Chen Nee ^a   Ghiasi, Soheil ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH PROVISIONING; FPGA FABRIC; LINK SPEED; LOOKUPS; NETWORK MEASUREMENT; NOVEL HARDWARE; OFFLINE; ORTHOGONALIZATION; PROGRAMMABLE ARCHITECTURES; REAL TIME; REAL-TIME NETWORKS; REAL-TIME TRAFFIC MEASUREMENTS; RUN-TIME SITUATION; SAMPLING-BASED; SECURITY ANALYSIS; SOFT-CORE PROCESSORS; STATE OF THE ART; TRAFFIC FEATURES; TRAFFIC MEASUREMENTS; TRAFFIC STREAMS;

COMPUTER SOFTWARE; INTERNET; SCALABILITY; SPEED; THROUGHPUT;

SOFTWARE ARCHITECTURE;

EID: 70350701863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1477942.1477958     Document Type: Conference Paper

References (23)

1. Cisco NetFlow. http: //www.cisco.com/warp/public/732/Tech/netflow.
2. Sampled NetFlow. http://www.cisco.com/en/US/ docs/ios/12\-0s/feature/ guide/12s\-sanf.html.
3. CAIDA: Cooperative Association for Internet Data Analysis. http://www.caida.org/home/.
4. B. Amrutur and M. Horowtiz. Speed and power scaling of srams. In IEEE J. Solid-State Circuits, volume 35(2), 2000.
5. N. Brownlee, C. Mills, and G. Ruth. Traffic Flow Measurement: Architecture. RFC 2722, 1999. http://www.ietf.org/rfc/rfc2722.txt.
6. K. Cho, R. Kaizaki, and A. Kato. Aguri: An Aggregation-based Traffic Profiler. In Proc. Quality of Future Internet Services, 2001.
7. N. Duffield, C. Lund, and M. Thorup. Estimating Flow Distributions from Sampled Flow Statistics. In SIGCOMM, 2003.
8. N. G. Duffield, C. Lund, and M. Thorup. Flow Sampling Under Hard Resource Constraints. In SIGMETRICS, 2004.
9. C. Estan, K. Keys, D. Moore, and G. Varghese. Building a Better Netflow. In SIGCOMM, 2004.
10. C. Estan, S. Savage, and G. Varghese. Automatically inferring patterns of resource consumption in network traffic. In SIGCOMM, 2003.
11. C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems, 21(3):270-313, 2003.
12. C. Estan, G. Varghese, and M. Fisk. Bitmap Algorithms for Counting Active Flows on High Speed Links. In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, 2003.
13. W. Fang and L. Peterson. Inter-as: Traffic Patterns and their Implications. In Proceedings of IEEE GLOBECOM, 1999.
14. M. Kodialam, T. Lakshman, and S. Mohanty. Runs bAsed Traffic Estimator (RATE): A simple, memory efficient scheme for per-flow rate estimation. In INFOCOM, 2004.
15. A. Kumar and J. Xu. Sketch Guided Sampling - Using On-Line Estimates of Flow Size for Adaptive Data Collection. In INFOCOM, 2006.
16. J. Mudigonda, H. M. Vin, and S. W. Keckler. Reconciling performance and programmability in networking systems. In SIGCOMM, pages 73-84, 2007.
17. V. Paxson, K. Asanovic, S. Dharmapurikar, J. Lockwood, R. Pang, R. Sommer, and N. Weaver. Rethinking hardware support for network analysis and intrusion prevention. In USENIX Hot Security, August-2006.
18. P. Phaal, S. Panchen, and N. McKee. InMon corporation's sFlow: A Method for Monitoring Traffic in Switched and Routed Networks, 2001. RFC 3176.
19. D. Plonka. FlowScan: A Network Traffic Flow Reporting and Visualization Tool. In USENIX LISA, pages 305-317, 2000.
20. G. Varghese. Network Algorithmics. Morgan Kaufmann, 2005.
21. T. Wolf, R. Ramaswamy, S. Bunga, and N. Yang. An architecture for distributed real-time passive network measurement. In MASCOTS, pages 335-344, 2006.
22. L. Yuan, C.-N. Chuah, and P. Mohapatra. ProgME: towards programmable network measurement. In SIGCOMM, pages 97-108, 2007.
23. Y. Zhang, S. Singh, S. Sen, N. Duffield, and C. Lund. Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. In IMC, 2004.