Analysis of one-way reservation algorithms

I. Cidon; R. Rom; Y. Shavitt

doi:10.1109/INFCOM.1995.516005

Analysis of one-way reservation algorithms

I. Cidon, R. Rom, Y. Shavitt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams interact in virtual circuit networks: a three node subnetwork that also acts as a 4×2 switch and a ring. For both systems we compute system throughput under homogeneous load, and compare it with the throughput when fast reservation protocols are used. For the three node subnetwork we also give an explicit expression for an upper bound

Original language	English
Title of host publication	INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages	1256-1263
Number of pages	8
DOIs	https://doi.org/10.1109/INFCOM.1995.516005
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.516005

Cite this

@inproceedings{142e2f63c1db4855a756486ab25e57c1,

title = "Analysis of one-way reservation algorithms",

abstract = "Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams interact in virtual circuit networks: a three node subnetwork that also acts as a 4×2 switch and a ring. For both systems we compute system throughput under homogeneous load, and compare it with the throughput when fast reservation protocols are used. For the three node subnetwork we also give an explicit expression for an upper bound",

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

year = "1995",

doi = "10.1109/INFCOM.1995.516005",

language = "אנגלית",

isbn = "081866990X",

series = "Proceedings - IEEE INFOCOM",

pages = "1256--1263",

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, Analysis of one-way reservation algorithms. in INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies., 516005, Proceedings - IEEE INFOCOM, vol. 3, pp. 1256-1263, 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.516005

TY - GEN

T1 - Analysis of one-way reservation algorithms

AU - Cidon, I.

AU - Rom, R.

AU - Shavitt, Y.

PY - 1995

Y1 - 1995

N2 - Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams interact in virtual circuit networks: a three node subnetwork that also acts as a 4×2 switch and a ring. For both systems we compute system throughput under homogeneous load, and compare it with the throughput when fast reservation protocols are used. For the three node subnetwork we also give an explicit expression for an upper bound

AB - Modern high speed networks (and ATM networks in particular) use resource reservation as a basic means of establishing communications. One-way on-the-fly reservation is a method for allocating resources for short bursts of data when regular reservation is too costly. The first such algorithms were recently suggested by Turner. We investigate two examples that are characteristic to the way traffic streams interact in virtual circuit networks: a three node subnetwork that also acts as a 4×2 switch and a ring. For both systems we compute system throughput under homogeneous load, and compare it with the throughput when fast reservation protocols are used. For the three node subnetwork we also give an explicit expression for an upper bound

UR - http://www.scopus.com/inward/record.url?scp=61849159890&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.1995.516005

DO - 10.1109/INFCOM.1995.516005

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:61849159890

SN - 081866990X

SN - 9780818669903

T3 - Proceedings - IEEE INFOCOM

SP - 1256

EP - 1263

BT - INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies

Y2 - 2 April 1995 through 6 April 1995

ER -

Analysis of one-way reservation algorithms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this