A fast bypass algorithm for high-speed networks

I. Cidon; R. Rom; Y. Shavitt

doi:10.1109/INFCOM.1995.516000

A fast bypass algorithm for high-speed networks

I. Cidon, R. Rom, Y. Shavitt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages	1214-1221
Number of pages	8
DOIs	https://doi.org/10.1109/INFCOM.1995.516000
State	Published - 1995
Externally published	Yes
Event	INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies - Boston, MA, United States Duration: 2 Apr 1995 → 6 Apr 1995

Publication series

Name	Proceedings - IEEE INFOCOM
Volume	3
ISSN (Print)	0743-166X

Conference

Conference	INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Country/Territory	United States
City	Boston, MA
Period	2/04/95 → 6/04/95

Access to Document

10.1109/INFCOM.1995.516000

Cite this

@inproceedings{24a9f21d63444c42a446092747b4e1cd,

title = "A fast bypass algorithm for high-speed networks",

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",

author = "I. Cidon and R. Rom and Y. Shavitt",

year = "1995",

doi = "10.1109/INFCOM.1995.516000",

language = "אנגלית",

isbn = "081866990X",

series = "Proceedings - IEEE INFOCOM",

pages = "1214--1221",

booktitle = "INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies",

note = "null ; Conference date: 02-04-1995 Through 06-04-1995",

}

Cidon, I, Rom, R & Shavitt, Y 1995, A fast bypass algorithm for high-speed networks. in INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies., 516000, Proceedings - IEEE INFOCOM, vol. 3, pp. 1214-1221, INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies, Boston, MA, United States, 2/04/95. https://doi.org/10.1109/INFCOM.1995.516000

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 -

A fast bypass algorithm for high-speed networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this