Networking

Robust Regression for Minimum-Delay Load-Balancing

Free registration required

Executive Summary

By providing origin-destination pairs with several possible paths, Dynamic Load-Balancing has been shown to obtain excellent results in terms of robustness and effective resource usage. In these dynamic schemes, paths are defined a priori, and the portion of traffic routed through each path is (typically) adjusted so that the sum over all links of a certain link-cost function is minimized. Queueing delay is usually used as this cost function due to its versatility and simplicity. However, all load-balancing schemes require an analytical expression of the delay, for which over-simplistic models are used (such as the classic M/M/1 model).

  • Format: PDF
  • Size: 302.5 KB