ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Adaptive load sharing for network processors
Full text PdfPdf (1.37 MB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 16 ,  Issue 2  (April 2008) table of contents
Pages: 293-306  
Year of Publication: 2008
ISSN:1063-6692
Authors
Lukas Kencl  CTU-Ericsson-Vodafone Research and Development, Prague, Czech Republic
Jean-Yves Le Boudec  Institute of Communication Systems (ISC), Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 114,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/TNET.2007.909839

ABSTRACT

A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming traffic is scheduled to multiple processors based on a deterministic mapping. The mapping formula is derived from the robust hash routing (also known as the highest random weight--HRW) scheme, introduced in K. W. Ross, IEEE Network, 11(6), 1997, and D. G. Thaler et al., IEEE Trans. Networking, 6(1), 1998. No state information on individual flow mapping has to be stored, but for each packet, a mapping function is computed over an identifier vector, a predefined set of fields in the packet. An adaptive extension to the HRW scheme is provided to cope with biased traffic patterns. We prove that our adaptation possesses the minimal disruption property with respect to the mapping and exploit that property to minimize the probability of flow reordering. Simulation results indicate that the scheme achieves significant improvements in processor utilization. A higher number of router interfaces can thus be supported with the same amount of processing power.


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
[1] A. Asthana, C. Delph, H. V. Jagadish, and P. Krzyzanowski, "Towards a gigabit IP router," J. High Speed Netw., vol. 1, no. 4, pp. 281-288, 1992.
 
2
[2] "AIX-MAE West Interconnection at NASA Ames OC-3 Trace," National Laboratory for Applied Network Research (NLANR), Mar. 19, 2000 [Online]. Available: http://www.moat.nlanr.net/PMA/
 
3
[3] G. Barish and K. Obraczka, "World Wide Web caching: Trends and techniques," IEEE Commun. Mag., vol. 38, no. 5, pp. 178-184, May 2000.
 
4
 
5
[5] H. C. B. Chan, H. M. Alnuweiri, and V. C. M. Leung, "A framework for optimizing the cost and performance of next-generation IP routers," IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1013-1029, Jun. 1999.
 
6
[6] "Cisco Express Forwarding (CEF)," Cisco Systems, White Paper, 1997 [Online]. Available: http://www.cisco.com
 
7
[7] H. J. Chao, "Next generation routers," Proc. IEEE, vol. 90, no. 9, pp. 1518-1558, Sep. 2002.
 
8
 
9
 
10
[10] Z. Cao, Z. Wang, and E. W. Zegura, "Performance of hashing-based schemes for Internet load balancing," in Proc. IEEE INFOCOM, 2000, pp. 332-341.
11
 
12
 
13
 
14
 
15
 
16
[16] G. C. Fedorkow, "Cisco 10000 Edge Services Router (ESR) Technology Overview," 2000 [Online]. Available: http://www.cisco.com
 
17
[17] G. Goldszmidt and G. Hunt, "Scaling Internet services by dynamic allocation of connections," in Proc. 6th IFIP/IEEE Int. Symp. Integrated Network Management, May 1999, pp. 171-184.
 
18
[18] R. Jain, The Art of Computer Systems Performance Analysis. New York: Wiley, 1991.
 
19
[19] A. Jayasumana, "Reorder density and reorder buffer-occupancy density metrics for packet reordering measurements," Internet Draft draft-jayasumana-reorder-density-06.txt, 2006.
 
20
[20] V. P. Kumar, T. V. Lakshman, and D. Stilliadis, "Beyond best effort: Router architectures for the differentiated services of tomorrow's Internet," IEEE Commun. Mag., pp. 152-164, May 1998.
 
21
 
22
[22] O. G. Koufopavlou, A. N. Tantawy, and M. Zitterbart, "Analysis of TCP/IP for high performance parallel implementations," presented at the 17th IEEE Conf. Local Computer Networks, Minneapolis, MN, Sep. 1992.
 
23
 
24
[24] A. Morton, L. Ciavattone, G. Ramachandran, S. Shalunov, and J. Perser, "Packet reordering metric for IPPM," Internet Draft draft-ietf-ippm-reordering-13.txt, 2006.
 
25
 
26
[26] Juniper Networks, Product Portfolio. [Online]. Available: www.juniper.net/products/
 
27
 
28
[28] "WAN Traffic Distribution by Address Size, Fix-West Trace," National Laboratory for Applied Network Research (NLANR), May 1997 [On-line]. Available: http://www.nlanr.net/NA/Learn/Class
 
29
[29] M. Przybylski, B. Belter, and A. Binczewski, "Shall we worry about packet reordering?," in TERENA Networking Conf., Poznan, Poland, Jun. 2005.
 
30
[30] R. Russo, L. Kencl, B. Metzler, and P. Droz, "Scalable and adaptive load balancing on IBM PowerNP," IBM Zurich Research Lab., Research Report RZ 3431, Jul. 2002.
 
31
[31] K. W. Ross, "Hash routing for collections of shared web caches," IEEE Network, vol. 11, no. 6, pp. 37-44, Nov.-Dec. 1997.
 
32
[32] C. Semeria, "Internet backbone routers and evolving Internet design," Juniper Networks White Paper, Sep. 1999 [Online]. Available: http:// www.juniper.net
 
33
 
34
35
 
36
[36] Routers for Service Providers. Cisco Systems [Online]. Available: http://www.cisco.com/en/US/products/hw/routers/
 
37
[37] K. Thompson, G. J. Miller, and R. Wilder, "Wide-area Internet traffic patterns and characteristics," IEEE Network, vol. 11, no. 6, pp. 10-27, Nov.-Dec. 1997.
 
38
 
39
[39] J. Turner and T. Wolf, "Design issues for high performance active routers," IEEE J. Sel. Areas Commun., vol. 19, no. 3, pp. 404-409, Mar. 2001.
 
40
41
 
42
[42] G. K. Zipf, Human Behavior and the Principle of Least-Effort. Cambridge, MA: Addison-Wesley, 1949.
 
43

Collaborative Colleagues:
Lukas Kencl: colleagues
Jean-Yves Le Boudec: colleagues