Analysis of one-way reservation algorithms

Author

Cidon, Israel ; Rom, Raphael ; Shavitt, Yuval

Author_Institution

Sun Microsyst., Mountain, CA, USA

fYear

1995

fDate

2-6 Apr 1995

Firstpage

1256

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

Keywords

asynchronous transfer mode; circuit switching; protocols; queueing theory; resource allocation; telecommunication traffic; 4×2 switch; ATM networks; establishing communications; fast reservation protocols; high speed networks; homogeneous load; one-way reservation algorithms; queues; resource allocation; resource reservation; ring; short bursts of data; system throughput; three node subnetwork; traffic streams; upper bound; virtual circuit networks; Algorithm design and analysis; Asynchronous transfer mode; High-speed networks; Protocols; Resource management; Switches; Switching circuits; Telecommunication traffic; Throughput; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE

Conference_Location

Boston, MA

ISSN

0743-166X

Print_ISBN

0-8186-6990-X

Type

conf

DOI

10.1109/INFCOM.1995.516005

Filename

516005