Bandwidth Reservation for Bursty Traac in the Presence of Resource Availability Uncertainty

In this work we suggest algorithms that increase the reservation success probability for bursty traac in high speed networks by adding exibility to the construction of the routes. These algorithms are simple enough to be implemented by cheap hardware. They cause no additional delay to packets that use the original route, and a very small delay to the packets that are rerouted. In addition, the presented algorithms have a minimal communication overhead, due to the local nature of their work. Two high-speed network models are considered: source routing and ATM.