Publication Date

Spring 2016

Document Type

Project Summary

Degree Name

Master of Science

Department

Computer Science

First Advisor

Neng-Shin Chen, M.S.

Second Advisor

(Clare) Xueqing Tang, Ph.D.

Third Advisor

Soon-Ok Park, Ph.D.

Abstract

High-speed routers rely on well-designed packet buffers that support multiple queues, provide large capacity and short response times. Some researchers suggested combined SRAM/DRAM hierarchical buffer architectures to meet these challenges. However, these architectures suffer from either large SRAM requirement or high time-complexity in the memory management. In this paper, we present scalable, efficient, and novel distributed packet buffer architecture. Two fundamental issues need to be addressed to make this architecture feasible: 1) how to minimize the overhead of an individual packet buffer; and 2) how to design scalable packet buffers using independent buffer subsystems. We address these issues by first designing an efficient compact buffer that reduces the SRAM size requirement by (k - 1)/k. Then, we introduce a feasible way of coordinating multiple subsystems with a load-balancing algorithm that maximizes the overall system performance. Both theoretical analysis and experimental results demonstrate that our load-balancing algorithm and the distributed packet buffer architecture can easily scale to meet the buffering needs of high bandwidth links and satisfy the requirements of scale and support for multiple queues.

Comments

Authors listed in alphabetical order by OPUS staff.

Additional Files
Vemula_Presentation_Redacted.pdf (2727 kB)
Presentation Slides
Download

Share

COinS