A methodology for evaluating runtime support in network processors

Modern network processor systems require the ability to adapt their processing capabilities at runtime to changes in network traffic. Traditionally, network processor applications have been optimized for a single static workload scenario, but recently several approaches for run-time adaptation have been proposed. Comparing these approaches and developing novel run-time support algorithms is difficult due to the multicore system-on-a-chip nature of network processors. In this paper, we present a model for network processors that can aid in evaluating different run-time support systems. The model considers workload characteristics of applications and network traffic. We use a queuing network abstraction to model different runtime systems. We illustrate the effectiveness of this model by comparing the performance of two existing workload adaptation algorithms.

[1]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[2]  Harrick M. Vin,et al.  A case for run-time adaptation in packet processing systems , 2004, Comput. Commun. Rev..

[3]  Marcel Waldvogel,et al.  IBM PowerNP network processor: Hardware, software, and applications , 2003, IBM J. Res. Dev..

[4]  Paul Barford,et al.  Self-configuring network traffic generation , 2004, IMC '04.

[5]  Stephen D. Goglin.  Advanced Software Framework , Tools , and Languages for the IXP Family , 2003 .

[6]  Yitzchak M. Gottlieb,et al.  Building a robust software-based router using network processors , 2001, SOSP.

[7]  Lukas Ruf.  Network services on service extensible routers , 2005, IWAN.

[8]  M.W. El-Kharashi,et al.  Network processors for communication security: a review , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[9]  Tilman Wolf,et al.  Design considerations for network processor operating systems , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).

[10]  Mark A. Franklin,et al.  Pipeline task scheduling on network processors , 2005 .

[11]  Laxmi N. Bhuyan,et al.  Design and implementation of a content-aware switch using a network processor , 2005, 13th Symposium on High Performance Interconnects (HOTI'05).

[12]  Ada Gavrilovska,et al.  Network processors as building blocks in overlay networks , 2003, 11th Symposium on High Performance Interconnects, 2003. Proceedings..

[13]  Yin Li,et al.  Queue management for QoS provision build on network processor , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[14]  K. Keutzer,et al.  Automated Task Allocation for Network Processors , 2004 .

[15]  Lothar Thiele,et al.  Chapter 4 – Design Space Exploration of Network Processor Architectures , 2003 .

[16]  Jake D. Brutlag,et al.  Aberrant Behavior Detection in Time Series for Network Monitoring , 2000, LISA.

[17]  Konstantina Papagiannaki,et al.  Structural analysis of network traffic flows , 2004, SIGMETRICS '04/Performance '04.

[18]  Gokhan Memik,et al.  NEPAL : A Framework for Efficiently Structuring Applications for Network Processors , 2004 .

[19]  Tilman Wolf,et al.  Performance models for network processor design , 2006, IEEE Transactions on Parallel and Distributed Systems.

[20]  David Clark,et al.  New ARCH: Future Generation Internet Architecture , 2004 .

[21]  Jean-Loup Baer,et al.  A Modeling Framework for Network Processor Systems , 2003 .

[22]  Nen-Fu Huang,et al.  A fast string-matching algorithm for network processor-based intrusion detection system , 2004, TECS.

[23]  Tilman Wolf,et al.  PacketBench: a tool for workload characterization of network processing , 2003, 2003 IEEE International Conference on Communications (Cat. No.03CH37441).

[24]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[25]  Kurt Keutzer,et al.  Chapter 7 – Exploring Trade-Offs in Performance and Programmability of Processing Element Topologies for Network Processors , 2003, HPCA 2003.

[26]  Kurt Keutzer,et al.  NP-Click: A Programming Model for the Intel IXP1200 , 2004 .