Robust Load Balancing

Abstract

We study the problem of balancing the traffic load in a network by route selection. The traditional approach starts from a given traffic matrix. However, as the traffic matrix is seldom available, estimated traffic matrices have to be used. Thus, the solution of the load balancing algorithm is not optimal due to errors in traffic matrix estimate. In order to overcome this, we present two variations of a robust load balancing scheme. One where no knowledge of the traffic matrix is needed, and a novel variant of the robust algorithm that does require a traffic matrix estimate but takes into consideration the estimation error involved. We compare the performance of these methods to that of traditional load balancing by a simulation study.

Robust Routing mechanisms for intradomain Traffic Engineering in dynamic networks

“…The last category of algorithms consists of Robust Routing techniques [8]- [12]. The objective in RR is to find a unique static routing configuration that fulfills a certain criterion for a broad set of traffic demands, generally the one that minimizes the maximum link utilization over the whole set of demands.…”

“…Oblivious Routing [9] also defines linear algorithms to optimize worst-case MLU for different sizes of traffic uncertainty sets. [12] analyses the use of robust routing through a combination of traffic estimation techniques and its corresponding estimation error bounds, in order to shrink the set of traffic demands. In [11] authors introduce COPE, a RR mechanisms that optimizes routing for predicted demands and bounds worst-case MLU to ensure acceptable efficiency under unexpected traffic events.…”

Hierarchical Dynamic Traffic Engineering Considering the Upper Bounds of Link Utilizations

“…[6]. In this method, we calculate the range of possible traffic amount by using the traffic amount on each link.…”

“…To reduce the amount of information required by the TE, several TE methods using only the information of traffic amount on each link have been proposed [3][4][5][6]. The methods proposed by Refs.…”

“…Traffic Engineering (TE) [2][3][4][5][6][7][8] is one efficient way of handling such traffic changes. In the TE, we deploy a server called the Path Computation Element (PCE).…”