L. Kencl and J.-Y. Le Boudec. Adaptive load sharing for network processors. In Proceedings of INFOCOM '02, June 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Cluster-Based Active Router Architecture Supporting.. - Guo, Chen, Bhuyan, Kumar (Correct)
....of the difficulty in their implementation, the high overhead of measuring the parameters, and evaluating optimization functions. As a result, most of the implementations are based on simple round robin schemes. In this paper, we identify and implement a particular adaptive load balancing scheme [6] for our active router. We also propose a new stream based round robin policy that is simple but greatly reduces the out of order degree of the media units in a simple unit based round robin scheme. We did experiments to test the system performance of our implementation by varying the number of ....
....by Thaler [13] and then developed by Ross [9] It is reported to provide good performance and low overhead when the request identifier space is evenly distributed. Lukas Kencl et al. HRW is extended with a feedback mechanism, which allows adjustment to the weights with minimum flow re mapping[6], to cope with request identifier space locality. We incorporate this adaptive load balancing technique in our active router. 3. The framework 3.1. Active router cluster architecture Figure 2 demonstrates the computation model of our active router system. When media units pass through the ....
[Article contains additional citation context not shown here]
L. Kencl and J. Y. L. Boudec. Adaptive load sharing for network processors. IEEE INFOCOM, 2002.
Scalable and Adaptive Load Balancing on IBM Power NP - Russo, al. (2002) (1 citation) (Correct)
....another way. It is not too difficult to see and prove that if xi and xi are weights computed with (3 2) and (3 15) S is the sum of the weights xi, and assuming that I]Y xj 1, then x i log xi SIN. 3 16) This is important because all the properties described in Ref. 13] and For example, Ref. [15] introRef. 15] are also true for the set of weights x i. duced a control loop, which adapts the weights, having a minimal disruption property. Because of the equivalence (3 16) the adaptation on the weights xi will maintain the same property. Another important issue is understanding what kind ....
....is not too difficult to see and prove that if xi and xi are weights computed with (3 2) and (3 15) S is the sum of the weights xi, and assuming that I]Y xj 1, then x i log xi SIN. 3 16) This is important because all the properties described in Ref. 13] and For example, Ref. 15] introRef. [15] are also true for the set of weights x i. duced a control loop, which adapts the weights, having a minimal disruption property. Because of the equivalence (3 16) the adaptation on the weights xi will maintain the same property. Another important issue is understanding what kind of values the ....
[Article contains additional citation context not shown here]
Lukas Kencl and J. Y. Le Boudec. Adaptive load sharing for network processors. In Proceedings of Infocorn 2002.
Creating Advanced Functions on Network Processors: .. - Haas, Jeffries.. (2003) (1 citation) Self-citation (Kencl) (Correct)
....stored. The adaptive load balancing method (Figure 6) uses a hardware based hash function to determine the destination server. The hash function is based on the robust hash routing algorithm [5] which supports arbitrary processing capacities of the balanced servers, and on its adaptive extension [6] that minimizes the disruption of the flowto processor mapping. The hash is performed on a portion of the packet that is constant for the duration of a flow, such as the source address. The method alternates between the stable state, in which only one hash function is computed, and a transient ....
Lukas Kencl and Jean-Yves Le Boudec, "Adaptive load sharing for network processors, " in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '02), June 2002, pp. 545--554.
The Role of Network Processors in Active Networks - Kind, Pletka, Waldvogel (2003) (Correct)
No context found.
L. Kencl and J.-Y. Le Boudec. Adaptive load sharing for network processors. In Proceedings of INFOCOM '02, June 2002.
System-Level Timing Analysis and Scheduling for Embedded Packet .. - Chakraborty (2003) (Correct)
No context found.
L. Kencel and J-Y. Le Boudec. Adaptive load sharing for network processors. In Proc. IEEE INFOCOM, June 2002.
SIP Message Overflow Routing Scheme (SMORS) - Alexander Kist And (2003) (Correct)
No context found.
Lukas Kencl and J. Y. Le Boudec, "Adaptive load sharing for network processors," In Infocom 2002.
The Role of Network Processors in Active Networks - Kind, Pletka, Waldvogel (2003) (Correct)
No context found.
L. Kencl and J.-Y. L. Boudec. Adaptive load sharing for network processors. In Proceedings of INFOCOM '02, June 2002.
An Active Traffic Splitter Architecture for Intrusion.. - Charitakis.. (Correct)
No context found.
L. Kencl and J. Y. L. Boudec. Adaptive load sharing for network processors. In Proceedings of IEEE Infocom, June 2002.
The Role of Network Processors in Active Networks - Kind, Pletka, Waldvogel (2002) (Correct)
No context found.
L. Kencl and J.-Y. Le Boudec. Adaptive load sharing for network processors. In Proceedings of INFOCOM '02, June 2002.
Effects of a Hash-based Scheduler on Cache Performance.. - Shi, MacGregor.. (Correct)
No context found.
L. Kencl, J. Le Boudec. Adaptive load sharing for network processors. In IEEE Infocom 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC