Blocking reduction in fast reservation protocols

Author

Bernstein, Greg M. ; Nguyen, Derrick H.

Author_Institution

Raynet Corp., Menlo Park, CA, USA

fYear

1994

fDate

12-16 Jun 1994

Firstpage

1208

Abstract

Fast resource management (FRM) techniques are currently under consideration for congestion control in high speed networks and ATM in particular. This paper presents a new method for burst admission control that can significantly reduce the burst blocking probability for an immediate transmission FRM protocol. An idealized method based on a fluid flow approximation is given. The performance of this idealized burst acceptance algorithm is evaluated via simulation. In addition the performance of this FRM/IT protocol is compared and contrasted with buffer oriented statistical multiplexing. Finally a number of simpler burst acceptance algorithms are discussed and their performance is compared to that of the ideal algorithm

Keywords

asynchronous transfer mode; circuit switching; probability; protocols; telecommunication network management; ATM networks; blocking reduction; buffer; burst acceptance algorithm; burst admission control; burst blocking probability; congestion control; fast reservation protocols; fast resource management; fluid flow approximation; high speed networks; immediate transmission FRM protocol; performance; simulation; statistical multiplexing; Admission control; Asynchronous transfer mode; Bandwidth; Communication system traffic control; Delay; Probability; Protocols; Resource management; Switches; Switching circuits;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '94. Networking for Global Communications., 13th Proceedings IEEE

Conference_Location

Toronto, Ont.

Print_ISBN

0-8186-5570-4

Type

conf

DOI

10.1109/INFCOM.1994.337569

Filename

337569