In this work we suggest algorithms that increase the reservation success pr
obability for bursty traffic in high speed networks by adding flexibility t
o the construction of the routes. These algorithms are simple enough to be
implemented by cheap hardware. They cause no additional delay to packets th
at use the original route, and a very small delay to the packets that are r
erouted. In addition, the presented algorithms have a minimal communication
overhead, due to the local nature of their work. Two high-speed network mo
dels are considered: source routing and ATM. (C) 1999 Elsevier Science B.V.
All rights reserved.