Providing Performance Guarantees in Multipass Network Processors

Abstract

Current network processors (NPs) increasingly deal with packets with heterogeneous processing times. In such an environment, packets that require many processing cycles delay low-latency traffic because the common approach in today's NPs is to employ run-to-completion processing. These difficulties have led to the emergence of the Multipass NP architecture, where after a processing cycle ends, all processed packets are recycled into the buffer and recompete for processing resources. In this paper, we provide a model that captures many of the characteristics of this architecture, and we consider several scheduling and buffer management algorithms that are specially designed to optimize the performance of multipass network processors. In particular, we provide analytical guarantees for the throughput performance of our algorithms. We further conduct a comprehensive simulation study, which validates our results.

DOI: 10.1109/INFCOM.2011.5935167

Extracted Key Phrases

9 Figures and Tables

051015201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Keslassy2011ProvidingPG, title={Providing Performance Guarantees in Multipass Network Processors}, author={Isaac Keslassy and Kirill Kogan and Gabriel Scalosub and Michael Segal}, journal={IEEE/ACM Transactions on Networking}, year={2011}, volume={20}, pages={1895-1909} }