IEICE TRANSACTIONS on Information
RPC: An Approach for Reducing Compulsory Misses in Packet Processing Cache
Summary :
We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.
- Publication
- IEICE TRANSACTIONS on Information Vol.E103-D No.12 pp.2590-2599
- Publication Date
- 2020/12/01
- Publicized
- 2020/09/07
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2020EDP7035
- Type of Manuscript
- PAPER
- Category
- Information Network
Authors
Hayato YAMAKI
The University of Electro-Communications
Hiroaki NISHI
Keio University
Shinobu MIWA
The University of Electro-Communications
Hiroki HONDA
The University of Electro-Communications
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hayato YAMAKI, Hiroaki NISHI, Shinobu MIWA, Hiroki HONDA, "RPC: An Approach for Reducing Compulsory Misses in Packet Processing Cache" in IEICE TRANSACTIONS on Information,
vol. E103-D, no. 12, pp. 2590-2599, December 2020, doi: 10.1587/transinf.2020EDP7035.
Abstract: We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2020EDP7035/_p
Copy
@ARTICLE{e103-d_12_2590,
author={Hayato YAMAKI, Hiroaki NISHI, Shinobu MIWA, Hiroki HONDA, },
journal={IEICE TRANSACTIONS on Information},
title={RPC: An Approach for Reducing Compulsory Misses in Packet Processing Cache},
year={2020},
volume={E103-D},
number={12},
pages={2590-2599},
abstract={We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.},
keywords={},
doi={10.1587/transinf.2020EDP7035},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - RPC: An Approach for Reducing Compulsory Misses in Packet Processing Cache
T2 - IEICE TRANSACTIONS on Information
SP - 2590
EP - 2599
AU - Hayato YAMAKI
AU - Hiroaki NISHI
AU - Shinobu MIWA
AU - Hiroki HONDA
PY - 2020
DO - 10.1587/transinf.2020EDP7035
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E103-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2020
AB - We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.
ER -
English
