Premium
Maximum delay computation for interdomain path selection
Author(s) -
Amigo Isabel,
Vaton Sandrine,
Chonavel Thierry,
Larroca Federico
Publication year - 2011
Publication title -
international journal of network management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.373
H-Index - 28
eISSN - 1099-1190
pISSN - 1055-7148
DOI - 10.1002/nem.799
Subject(s) - computer science , traverse , path (computing) , computation , upper and lower bounds , metric (unit) , set (abstract data type) , quality of service , bandwidth (computing) , computer network , mathematical optimization , algorithm , mathematics , mathematical analysis , operations management , geodesy , economics , programming language , geography
SUMMARY One important problem when deploying interdomain path selection is advertising metrics that hold for a long period of time. In this paper we propose a method to aid interdomain path selection mechanisms in that sense. We present a means of computing a bound on the end‐to‐end delay of traversing a domain considering that the traffic varies within a given uncertainty set. This provides a robust and a verifiable quality of service value for traversing the autonomous system (AS), without revealing confidential information. Consequently, the bound can be safely conceived as a metric to be announced by each AS 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 and a numerical approximation method for computing it, neither of which rely on a complex monitoring infrastructure. Simulations with real data that illustrate the problem and validate our results are also presented. Copyright © 2011 John Wiley & Sons, Ltd.