Browse > Article
http://dx.doi.org/10.3745/KTCCS.2013.2.10.421

Flow Labeling Method for Realtime Detection of Heavy Traffic Sources  

Lee, KyungHee (수원대학교 전기공학과)
Nyang, DaeHun (인하대학교 컴퓨터정보공학과)
Publication Information
KIPS Transactions on Computer and Communication Systems / v.2, no.10, 2013 , pp. 421-426 More about this Journal
Abstract
As a greater amount of traffic have been generated on the Internet, it becomes more important to know the size of each flow. Many research studies have been conducted on the traffic measurement, and mostly they have focused on how to increase the measurement accuracy with a limited amount of memory. In this paper, we propose an explicit flow labeling technique that can be used to find out the names of the top flows and to increase the counting upper bound of the existing scheme. The labeling technique is applied to CSM (Counter Sharing Method), the most recent traffic measurement algorithm, and the performance is evaluated using the CAIDA dataset.
Keywords
Traffic Measurement; Flow labeling; Counter Sharing Method;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Wikipedia, "Internet Traffic," http://en.wikipedia.org/wiki/ Internet_traffic
2 Cisco whitepaper: "Cisco Visual Networking Index: Forecast and Methodology, 2012-2017," http://www.cisco.com/en/US/ solutions/collateral/ns341/ns525/ns537/ns705/ns827 /white_paper_c11-481360_ns827_Networking_Solutions_Whit e_Paper.html
3 Cisco, "NetFlow Systems," http://www.cisco.com/en/US/ products/ps6601/ products_ios_protocol_group_home.html
4 InMon Corp, "sFlow Accuracy & Billing," http://www.sflow.org/sFlowOverview.pdf
5 "The Cooperative Association for Internet Data Analysis," http://www.caida.org
6 P. Flajolet and G. Nigel Martin, "Probabilistic Counting Algorithms for Database Applications," Journal of Computer System Science, Vol.31, pp 182-209, 1985.   DOI   ScienceOn
7 K.Y. Whang, B. Vander-Zanden and H. Taylor, "A linear-time probabilistic counting algorithm for database applications," ACM Transactions on Database Systems, Vol.15, 2, pp. 208-229, 1990.   DOI
8 C. Estan and G. Varghese, "New Directions in Traffic Measurement and Accounting," Proc. of ACM SIGCOMM, August, 2002.
9 S. Cohen and Y. Matias, "Spectral bloom filters," Proc. ACM SIGMOD Conference on Management of Data, 2003.
10 R. Karp, S. Shenker, and C. Papadimitriou, "A Simple Algorithm for Finding Frequent Elements in Streams and Bags," ACM Transactions on Database Systems, Vol.28, No.1, pp.51-55, 2003.   DOI   ScienceOn
11 A. Kumar, J. JimXu, and J. Wang, "Space-Code Bloom Filter for Efficient Per-Flow Trafc Measurement," Proc. of IEEE INFOCOM, March, 2004.
12 N. Kamiyama and T. Mori, "Simple and Accurate Identification of High- rate Flows by Packet Sampling," Proc. of IEEE INFOCOM, April, 2006.
13 X. Dimitropoulos, P. Hurley, and A. Kind, "Probabilistic Lossy Counting: An Efficient Algorithm for Finding Heavy Hitters," ACM SIGCOMM Computer Communication Review, Vol.38, No.1, pp.7-16, 2008.
14 Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani, "Counter Braids: A Novel Counter Architecture for Per-Flow Measurement," Proc. of ACM SIGMETRICS, June, 2008.
15 Y. Lu and B. Prabhakar, "Robust Counting Via Counter Braids: An Error- Resilient Network Measurement Architecture," Proc. of IEEE INFOCOM, April, 2009.
16 P. Lieven and B. Scheuermann, "High-Speed Per-Flow Trafc Measurement with Probabilistic Multiplicity Counting," Proc. of IEEE INFOCOM, April, 2010.
17 T. Li, S. Chen and Y. Ling, "Fast and Compact Per-Flow Traffic Measurement through Randomized Counter Sharing," Proc. of IEEE INFOCOM, April, 2011.