000000368 001__ 368
000000368 005__ 20190316233052.0
000000368 037__ $$aCONF
000000368 245__ $$aAdaptive Load Sharing for Network Processors
000000368 269__ $$a2002
000000368 260__ $$c2002
000000368 336__ $$aConference Papers
000000368 520__ $$aA novel scheme for processing packets in a router is presented, which provides for 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 needs 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 in order 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 in order 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.
000000368 6531_ $$aRouter
000000368 6531_ $$aInternet
000000368 700__ $$aKencl, Lukas
000000368 700__ $$0241098$$aLe Boudec, Jean-Yves$$g105633
000000368 7112_ $$aInfocom 2002$$cNew-York
000000368 773__ $$q545-554$$tInfocom 2002
000000368 8564_ $$s542202$$uhttps://infoscience.epfl.ch/record/368/files/KenclL02.pdf$$zn/a
000000368 909C0 $$0252614$$pLCA$$xUS00024
000000368 909C0 $$0252453$$pLCA2$$xU10427
000000368 909CO $$ooai:infoscience.tind.io:368$$pconf$$pIC$$qGLOBAL_SET
000000368 937__ $$aLCA-CONF-2002-003
000000368 970__ $$a532/LCA
000000368 973__ $$aEPFL$$sPUBLISHED
000000368 980__ $$aCONF