A distributed algorithm for resources provisioning in networks
Résumé
Internet is a network based on IP. Routing between its independent subnetworks (domains) is assumed by BGP which uses IP. There was no need for QoS guarantees when these two protocols were designed and these guarantees are not integrated in Internet. Our goal is to provide an algorithm finding multi-constraints paths between a router in a domain to a router in another domain. In this context, the algorithm has to satisfy some requirements. The algorithm should be distributed, has to work without the knowledge of the global network's state, be able to work and to reserve a path excluding domains which do not use it, and, finally, has to be adaptable to deal with new QoS constraints.