ACM Home Page
Please provide us with feedback. Feedback
A case for run-time adaptation in packet processing systems
Full text PdfPdf (178 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 34 ,  Issue 1  (January 2004) table of contents
COLUMN: Papers from Hotnets-II table of contents
Pages: 107 - 112  
Year of Publication: 2004
ISSN:0146-4833
Authors
Ravi Kokku  University of Texas at Austin
Taylor L. Riché  University of Texas at Austin
Aaron Kunze  Intel Corporation
Jayaram Mudigonda  University of Texas at Austin
Jamie Jason  Intel Corporation
Harrick M. Vin  University of Texas at Austin
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/972374.972393
What is a DOI?

ABSTRACT

Most packet processing applications receive and process multiple types of packets. Today, the processors available within packet processing systems are allocated to packet types at design time. In this paper, we explore the benefits and challenges of adapting allocations of processors to packet types in packet processing systems. We demonstrate that, for all the applications and traces considered, run-time adaptation can reduce energy consumption by 70--80% and processor provisioning level by 40--50%. The adaptation benefits are maximized if processor allocations can be adapted at fine time-scales and if the total available processing power can be allocated to packet types in small granularities. We show that, of these two factors, allocating processing power to packet types is small granularity is more important---if the allocation granularity is large, then even a very fine adaptation time-scale yields meager benefits.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Intel IXA Software Developers Kit 3.0. http://www.intel.com/design/network/products/npfamily/sdk3.htm.
2
 
3
R. Berrendorf and B. Mohr. PCL - The Performance Counter Library: A Common Interface to Access Hardware Performance Counters on Microprocessors. http://www.fz-juelich.de/zam/PCL/doc/pcl/pcl.pdf.
 
4
A. Chandra, P. Goyal, and P. Shenoy. Quantifying the Benefits of Resource Multiplexing in On-demand Data Centers. In Proceedings of the First Workshop on Algorithms and Architectures for Self-Managing Systems, June 2003.
5
 
6
S. Choi and J. Turner. Configuring Sessions in Programmable Networks with Capacity Constraints. In Proceedings of IEEE ICC, May 2003.
 
7
K. Egevang and P. Francis. The IP Network Address Translator (NAT). IETF RFC 1631, May 1994.
 
8
M. Elnozahy, M. Kistler, and R. Rajamony. Energy Conservation Policies for Web Servers. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), March 2003.
9
 
10
A. O. Freier, P. Karlton, and P. C. Kocher. The SSL Protocol Version 3.0. Internet Draft, November 1996.
11
 
12
 
13
Internet Protocol. IETF RFC 791, September 1981.
 
14
Intel IXP2400 Network Processor Hardware Reference Manual, January 2003.
 
15
V. Jacobson. Compressing TCP/IP Headers for Low-speed Serial Links. IETF RFC 1144, February 1990.
16
 
17
R. Kokku, T. L. Riché, A. Kunze, J. Mudigonda. J. Jason, and H. M. Vin. A Case for Run-time Adaptation in Packet Processing Systems. Technical Report TR-03-27, Department of Computer Sciences, The University of Texas at Austin, November 2003.
 
18
NLANR Network Traffic Packet Header Traces. http://pma.nlanr.net/Traces/.
19
20
 
21
G. Tsirtsis and P. Srisuresh. Network Address Translation - Protocol Translation (NAT-PT). IETF RFC 2766, February 2000.

Collaborative Colleagues:
Ravi Kokku: colleagues
Taylor L. Riché: colleagues
Aaron Kunze: colleagues
Jayaram Mudigonda: colleagues
Jamie Jason: colleagues
Harrick M. Vin: colleagues

Peer to Peer - Readers of this Article have also read: