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
Generating All Vertices of a Polyhedron Is Hard
Discrete & Computational Geometry
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
Hi-index | 0.01 |
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.