QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
IEEE/ACM Transactions on Networking (TON)
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Toward Scalable Management of Multiple Service Levels in IP Networks
ECUMN '07 Proceedings of the Fourth European Conference on Universal Multiservice Networks
One-way Delay Measurement and Characterization
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Economic and technical propositions for inter-domain services
Bell Labs Technical Journal - General Papers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Path selection techniques to establish constrained interdomain MPLS LSPs
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Traffic matrix reloaded: impact of routing changes
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Developing novel statistical bandwidths for communication networks with incomplete information
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Interdomain traffic engineering with BGP
IEEE Communications Magazine
| Hi-index | 0.00 |
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. (This work studies the worst case of the end-to-end delay of traversing an Autonomous System when Traffic Matrix is uncertain. An exact method for computing the bound and a numerical approximation are presented. Simulation studies are performed with real networks, showing that delay can suddenly increase. The method provides an end-to-end metric that holds for a long period of time and can thus be used by interdomain path selection mechanisms with quality of service constraints.)