A fast bypass algorithm for high-speed networks

I. Cidon, R. Rom, Y. Shavitt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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

Original languageEnglish
Title of host publicationINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages1214-1221
Number of pages8
DOIs
StatePublished - 1995
Externally publishedYes
EventINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies - Boston, MA, United States
Duration: 2 Apr 19956 Apr 1995

Publication series

NameProceedings - IEEE INFOCOM
Volume3
ISSN (Print)0743-166X

Conference

ConferenceINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Country/TerritoryUnited States
CityBoston, MA
Period2/04/956/04/95

Fingerprint

Dive into the research topics of 'A fast bypass algorithm for high-speed networks'. Together they form a unique fingerprint.

Cite this