Enhancing RCC(Recyclable Counter With Confinement) with Cuckoo Hashing 


Vol. 41,  No. 6, pp. 663-671, Jun.  2016


PDF
  Abstract

According to rapidly increasing of network traffics, necessity of high-speed router also increased. For various purposes, like traffic statistic and security, traffic measurement function should performed by router. However, because of the nature of high-speed router, memory resource of router was limited. RCC proposed a way to measure traffics with high speed and accuracy. Additional quadratic probing hashing table used for accumulating elephant flows in RCC. However, in our experiment, quadratic probing performed many overheads when allocated small memory space or load factor was high. Especially, quadratic requested many calculations in update and lookup. To face this kind of problem, we use a cuckoo hashing which performed a good performance in update and loop for enhancing the RCC. As results, RCC with cuckoo hashing performed high accuracy and speed even when load factor of memory was high.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

R. Jang, C. Jung, K. Kim, D. Nyang, K. Lee, "Enhancing RCC(Recyclable Counter With Confinement) with Cuckoo Hashing," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 6, pp. 663-671, 2016. DOI: .

[ACM Style]

Rhong-ho Jang, Chang-hun Jung, Keun-young Kim, Dae-hun Nyang, and Kyung-Hee Lee. 2016. Enhancing RCC(Recyclable Counter With Confinement) with Cuckoo Hashing. The Journal of Korean Institute of Communications and Information Sciences, 41, 6, (2016), 663-671. DOI: .

[KICS Style]

Rhong-ho Jang, Chang-hun Jung, Keun-young Kim, Dae-hun Nyang, Kyung-Hee Lee, "Enhancing RCC(Recyclable Counter With Confinement) with Cuckoo Hashing," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 6, pp. 663-671, 6. 2016.