Adaptive Load Sharing for Network Processors

8 years 11 months ago
Adaptive Load Sharing for Network Processors
—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 ...
Lukas Kencl, Jean-Yves Le Boudec
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Authors Lukas Kencl, Jean-Yves Le Boudec
Comments (0)