An Adaptive Load Balancer for Multiprocessor Routers

By investigating flow-level characteristics of Internet traffic, the authors are able to trace the root of load imbalance in hash-based load-splitting schemes. They model flow popularity distributions as Zipf-like and prove that for typical Internet traffic, a hashing scheme cannot balance workload...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Simulation (San Diego, Calif.) Calif.), 2006-03, Vol.82 (3), p.173-192
Hauptverfasser: Shi, W., MacGregor, M. H., Gburzynski, P.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:By investigating flow-level characteristics of Internet traffic, the authors are able to trace the root of load imbalance in hash-based load-splitting schemes. They model flow popularity distributions as Zipf-like and prove that for typical Internet traffic, a hashing scheme cannot balance workload statistically, not even in the long run. They then develop a novel load-balancing packet scheduler for parallel forwarding systems. The scheduler capitalizes on the nonuniform flow reference pattern and especially the presence of a few high-rate flows in Internet traffic. The authors show that detecting and scheduling these flows can be very effective in balancing workloads among network processors. They introduce an important metric, adaptation disruption, to measure the scheduling efficiency of load-balancing mechanisms in parallel forwarding systems. Because there are relatively few large flows, reassigning them in the load balancer results in little disruption to the states of individual processors. The ideas are validated by simulation results. Finally, the authors discuss the effects on cache performance when classifying flows using two different flow definitions: the destination IP address and the five-tuple. The latter results in finer flow granularity but worse route cache hit rate, which can lead to the degradation of routing table lookup performance.
ISSN:0037-5497
1741-3133
DOI:10.1177/0037549706067079