Carrier-Scale Packet Processing System Using Interleaved 3D-Stacked DRAM

Emergence of new network services such as Internet of Things (IoT) and edge computing accelerates the increase of traffic volume, the number of connected devices and the diversity of communication. Next generation carrier network infrastructure should be much more scalable and adaptive to rapid increase and divergence of network demand with much lower cost. More virtualization-aware, flexible and inexpensive system based on general-purpose hardware is necessary to transform traditional carrier network into more adaptive, next generation network. In this paper, we propose a carrier-scale packet processing system which utilizes 3 Dimensional (3D)-stacked Dynamic Random Access Memory (DRAM) device. The proposed system augments memory access concurrency by leveraging vault-level parallelism and bank interleaving of 3D-stacked DRAM. The system uses hash-function-based distributor of memory requests to each set of vault and bank which accommodates a portion of original carrier-scale huge tables. We introduce an analytical model for the system. The evaluation result shows that our proposed system can achieve more than 100 Gbps in carrier-scale packet processing where main memory accesses are inevitable since tiny CPU cache memory is insufficient to accommodate huge tables. Our analytical model is independent of specification of a particular device, which can be applied to any DRAM systems.

[1]  Geoffrey Elliott,et al.  Packet Matching on FPGAs Using HMC Memory: Towards One Million Rules , 2017, FPGA.

[2]  Sangjin Han,et al.  PacketShader: a GPU-accelerated software router , 2010, SIGCOMM '10.

[3]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[4]  Katerina J. Argyraki,et al.  RouteBricks: exploiting parallelism to scale software routers , 2009, SOSP '09.

[5]  Toshiaki Kirihata,et al.  Three-Dimensional Dynamic Random Access Memories Using Through-Silicon-Vias , 2016, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[6]  Nick McKeown,et al.  Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[7]  Masuda Akeo,et al.  Toward carrier-scale general-purpose node , 2017 .

[8]  Hirochika Asai,et al.  Poptrie: A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup , 2015, SIGCOMM.