Providing Performance Guarantees in Multipass Network Processors

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 difficul...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2012-12, Vol.20 (6), p.1895-1909
Main Authors: Keslassy, Isaac, Kogan, Kirill, Scalosub, Gabriel, Segal, Michael
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Buffer management algorithms
competitive analysis
Instruction sets
Memory management
network processors (NPs)
Processor scheduling
Recycling
scheduling
Throughput
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2012.2186979