Maximum delay computation under traffic matrix uncertainty and its application to interdomain path selection

Abstract

One of the most important problems when deploying interdomain path selection with quality of service requirements is being able to rely the computations on metrics that hold for a long period of time. Our proposal for achieving such assurance is to compute bounds on the metrics, taking into account the uncertainty on the traffic demands. In particular, we will explore the computation of the maximum end-to-end delay of traversing a domain considering that the traffic is unknown but bounded. Since this provides a robust quality of service value for traversing the Autonomous System (AS), without revealing confidential information, we claim that the bound can be safely conceived as a metric to be announced by each AS to the entities performing the path selection, in the process of interdomain path selection. We show how the maximum delay value is obtained for an interdomain bandwidth demand and we propose an exact method for solving the optimization problem. Simulations with real data are also presented.