preview

We Use A Weight Search Heuristic

Decent Essays

We use a weight search heuristic similar to the one used in the failure free case, and we adopt the cost function. Our goal is to find a weight function for each configuration, so that the cost of routing the needs through the network is as small as possible after any link failure. However, evaluating for a given weight setting is a complex task because it involves recalculating the load on all links in the network. In order to get a method that scales to large networks, we identify a limited set of critical link failures.

We then optimize the link weights taking only the critical link failures into account. We want to avoid that the failure of heavily loaded links results in large amounts of traffic being recovered in backup configurations with a sparse backbone. Instead, this traffic should be routed in a rich (well connected) backbone, where we have abetter chance of distributing it over less loaded links by settingappropriate link weights.To implement this load-aware algorithm we calculate the potentialof each node in the network and the potential of each backup configuration.

To evaluate our load aware construction algorithm, we computethe worst case load on each link after a link failure, andcompare it to the results achieved by the original algorithm. Note that the optimizations described here will only havean effect if the network topology allows more than one possiblebackup path after a failure. We have also run our optimizationson less connected networks than

Get Access