Variants of the min-sum link-disjoint paths problem

On-line survivable routing in WDM networks

To update network state or not?

On the availability of networks

Rounding in e-approximation algorithms

A common approach to deal with NP-hard problems is to deploy polymonial-time e-approximation algorithms often resort to rounding and scaling to guarantee a solution that is within a factor ( 1+ypsilon) of the optimal solution. Usually, researchers either only round up or only down. In this paper we will evaluate the gian in accuracy when...

Implications for QoS provisioning based on traceroute measurements