Performance analysis of CAR: Centralized adaptive reservation

Abstract

A centralized adaptive reservation (CAR) protocol has been proposed in [1] for supporting constant bit rate (CBR), variable bit rate (VBR) and unspecified bit rate (UBR) services in a starconfigured network. This protocol has two main features. First, both the access probability and the bandwidth for reservation requests are varied dynamically to enhance efficiency. Second, by using a request-mini-slot method, UBR traffic can only utilize the residual bandwidth of the other traffic. In this paper, we derive a Markov chain model for analyzing the performance of the CAR protocol by means of a bi-state traffic source. The focus is to analyze the performance of the VBR stations when both the access probability and the bandwidth for reservation requests are changed dynamically.published_or_final_versio