Analysis of one-way reservation algorithms

I. Cidon, R. Rom, Y. Shavitt

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages1256-1263
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 'Analysis of one-way reservation algorithms'. Together they form a unique fingerprint.

Cite this