TY - GEN
T1 - A fast bypass algorithm for high-speed networks
AU - Cidon, I.
AU - Rom, R.
AU - Shavitt, Y.
PY - 1995
Y1 - 1995
N2 - Suggests an algorithm that increases the reservation success probability for bursty traffic in high speed networks by adding flexibility 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
AB - Suggests an algorithm that increases the reservation success probability for bursty traffic in high speed networks by adding flexibility 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
UR - http://www.scopus.com/inward/record.url?scp=5844303990&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.1995.516000
DO - 10.1109/INFCOM.1995.516000
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:5844303990
SN - 081866990X
SN - 9780818669903
T3 - Proceedings - IEEE INFOCOM
SP - 1214
EP - 1221
BT - INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 2 April 1995 through 6 April 1995
ER -