Flow-Length Aware Cache Replacement Policy for Packet Processing Cache

Abstract

Recent core routers are required to process packets not only at high throughput but also with low power consumption due to the increase in the network traffic amount. Packet processing cache (PPC) is one of the effective approaches to meet the requirements. PPC enables to process a packet without accessing to a ternary content addressable memory (TCAM) by storing the TCAM lookup results of a flow in a cache. Because the cache miss rate of PPC directly impacts on the packet processing throughput and the power consumption of core routers, it is important for PPC to reduce the number of cache misses. In this study, we focus on characteristics of flows and propose an effective cache replacement policy for PPC. The proposed policy, named Hit Dominance Cache (HDC), divides the cache into two areas and assigns flows to the appropriate area to evict mice flows rapidly and to retain elephant flows preferentially. Simulation results with 15 real network traces show that HDC can reduce the number of cache misses in PPC by up to 29.1% and 12.5% on average when compared to 4-way LRU, conventionally used in PPC. Furthermore, the hardware implementation using Verilog-HDL shows that the hardware costs of HDC is comparable to those of 4-way LRU though HDC performs as if the cache was composed of 8-way set associativity. Finally, we show that HDC can achieve 503 Gbps with 88.8% energy of conventional PPC (20.5% energy of TCAM only architecture).

Authors and Affiliations

Hayato Yamaki

Keywords

Related Articles

Ensuring Privacy Protection in Location-based Services through Integration of Cache and Dummies

Location-Based Services (LBS) have recently gained much attention from the research community due to the openness of wireless networks and the daily development of mobile devices. However, using LBS is not risk free. Loc...

Developement of Bayesian Networks from Unified Modeling Language for Learner Modelling

First of all, and to clarify our purpose, it seems important to say that the work we are presenting here lie within the framework of learner modeling in an adaptive system understood as computational modeling of the lear...

Nonquadratic Lyapunov Functions for Nonlinear Takagi-Sugeno Discrete Time Uncertain Systems Analysis and Control

This paper deals with the analysis and design of the state feedback fuzzy controller for a class of discrete time Takagi -Sugeno (T-S) fuzzy uncertain systems. The adopted framework is based on the Lyapunov theory and us...

E-learning in Higher Educational Institutions in Kuwait: Experiences and Challenges

E-learning as an organizational activity started in the developed countries, and as such, the adoption models and experiences in the developed countries are taken as a benchmark in the literature. This paper investigated...

Effective Teaching Methods and Proposed Web Libraries for Designing Animated Course Content: A Review

The primary aim of education system is to improve cognitive and computational skills in students. It cannot be achieved by just using the latest technology. This goal can only be achieved through effective teaching metho...

Download PDF file
  • EP ID EP309341
  • DOI 10.14569/IJACSA.2018.090502
  • Views 77
  • Downloads 0

How To Cite

Hayato Yamaki (2018). Flow-Length Aware Cache Replacement Policy for Packet Processing Cache. International Journal of Advanced Computer Science & Applications, 9(5), 12-20. https://europub.co.uk/articles/-A-309341