Sketching the data center network traffic

IEEE Network

Volumn 27, Issue 4, 2013, Pages 33-39

  Liu, Chi Harold ^a   Kind, Andreas ^b   Vasilakos, Athanasios ^c  

^a BEIJING INSTITUTE OF TECHNOLOGY   (China)

^b IBM RESEARCH   (United States)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE TRAFFIC; DATA CENTER NETWORKS; IMPLEMENTATION COST; LOW COMPUTATIONAL COMPLEXITY; MOVING AVERAGES; NETWORK SERVICES; REAL-TIME SEARCHES; TIME COMPLEXITY;

ALGORITHMS;

TRAFFIC SURVEYS;

EID: 84881497373     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2013.6574663     Document Type: Article

References (14)

1. M. Al-Fares, A. Loukissas, and A. Vahdat, "A Scalable, Commodity Data Center Network Architecture," ACM SIGCOMM Comp. Commun. Rev., vol. 38, no. 4, Aug. 2008, pp. 63-74.
2. J. Dean and S. Ghemawat, "Mapreduce: Simplified Data Processing on Large Clusters," Commun. ACM, vol. 51, no. 1, 2008, pp. 107-13.
3. A. R. Curtis, W. Kim, and P. Yalagandula, "Mahout: Low-Overhead Datacenter Traffic Management Using End-Host-Based Elephant Detection," IEEE INFOCOM, 2011, pp. 1629-37.
4. sFlow, http://www.sflow.org/.
5. M. Roughan et al., "Class-of-Service Mapping for QoS: A Statistical Signature- based Approach to IP Traffic Classification," ACM IMC, 2004, pp. 135-48.
6. M. Al-Fares et al., "Hedera: Dynamic Flow Scheduling for Data Center Networks," NSDI, 2010, pp. 19-19.
7. S. Muthukrishnan, "Data Streams: Algorithms and Applications," Foundations and Trends in Theoretical Computer Science, vol. 1, no. 2, 2005.
8. G. S. Manku and R. Motwani, "Approximate Frequency Counts Over Data Streams," VLDB Conf., 2002, pp. 346-57.
9. A. Metwally, D. Agrawal, and A. E. Abbadi, "Efficient Computation of Frequent and Top-K Elements in Data Streams," Int'l. Conf. Database Theory, 2005, pp. 398-412.
10. F. Rusu and A. Dobra, "Statistical Analysis of Sketch Estimators," ACM SIGMOD '07, 2007, pp. 187-98.
11. G. Cormode and M. Hadjieleftheriou, "Finding Frequent Items in Data Streams," VLDB J., vol. 1, no. 2, 2008, pp. 1530-41.
12. G. Cormode and S. Muthukrishnan, "An Improved Data Stream Summary: The Count-Min Sketch and Its Applications," J. Alg., vol. 55, no. 1, 2005, pp. 58-75.
13. C. Estan and G. Varghese, "New Directions in Traffic Measurement and Accounting," ACM SIGCOMM Comp. Commun. Rev., vol. 32, no. 4, 2002.
14. G. Cormode and S. Muthukrishnan, "Summarizing and Mining Skewed Data Streams," SIAM Conf. Data Mining, 2005, pp. 44-55.