By Topic

Block-based packet buffer with deterministic packet departures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hao Wang ; Department of Electrical and Computer Engineering, University of California, San Diego, USA ; Bill Lin

Routers need to store temporarily a large number of packets in response to congestion. DRAM is typically needed to implement large packet buffers, but DRAM devices have worst-case random access latencies that are too slow to match the bandwidth requirements of high-performance routers. Existing DRAM-based architectures for supporting linespeed queue operations can be classified into three categories: prefetching-based, randomization-based, and reservation-based. They are all based on interleaving memory accesses across multiple parallel DRAM banks for achieving higher memory bandwidths, but they differ in their packet placement and memory operation scheduling mechanisms. In this paper, we present an efficient reservation-based packet buffer architecture based on the concept of blocks. The proposed block-based solution achieves an order of magnitude reduction in the total SRAM size. It is scalable to growing packet storage requirements in routers while matching increasing line rates.

Published in:

2010 International Conference on High Performance Switching and Routing

Date of Conference:

13-16 June 2010