A distributed algorithm for inter-domain resources provisioning
Résumé
The introduction of QoS guarantees from peer to peer in the Internet requires a mechanism for finding paths in the inter-domain network. This mechanism has to be distributed, support classical constraints (delay, bandwidth, jitter, loss rate, administrative cost) and be able to find multi-constraint paths. The second problem is hard even if global information concerning the resources available in the network is known, which is impossible in the Internet. We are convinced that RSVP would not be an efficient solution in this context. We propose an alternative solution better adapted for fulfilling the QoS requirements. It is heuristic and it makes decisions according to routing tables stored in border routers. The obtained simulation results have shown that its performance is very satisfactory.