A Fast Bypass Algorithm for High-Speed Networks

In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the routes. The algorithm is simple enough to be implemented by cheap hardware. It causes 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 algorithm has a minimal communication overhead due to the local nature of its work. Two high-speed network models are considered: source routing and ATM.

• Type: Conference
• Year: 1995
• Where: INFOCOM
• Authors: Israel Cidon, Raphael Rom, Yuval Shavitt
• Keywords: Algorithm, Communications, INFOCOM 1995, Minimal Communication Overhead, Reservation Success Probability