Performance analysis of CAR: Centralized adaptive reservation

Chun Bun Henry Chan; Victor O.K. Li; Victor C.M. Leung

doi:10.1109/CCECE.2001.933731

Performance analysis of CAR: Centralized adaptive reservation

Chun Bun Henry Chan, Victor O.K. Li, Victor C.M. Leung

Research output: Journal article publication › Journal article › Academic research › peer-review

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.

Original language	English
Pages (from-to)	481-486
Number of pages	6
Journal	Canadian Conference on Electrical and Computer Engineering
Volume	1
DOIs	https://doi.org/10.1109/CCECE.2001.933731
Publication status	Published - 1 Jan 2001

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering

More information

10.1109/CCECE.2001.933731

Cite this

@article{950baff8d3ef46cb9df5136b0adb6d1e,

title = "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.",

author = "Chan, {Chun Bun Henry} and Li, {Victor O.K.} and Leung, {Victor C.M.}",

year = "2001",

month = jan,

day = "1",

doi = "10.1109/CCECE.2001.933731",

language = "English",

volume = "1",

pages = "481--486",

journal = "Canadian Conference on Electrical and Computer Engineering",

issn = "0840-7789",

publisher = "IEEE",

}

TY - JOUR

T1 - Performance analysis of CAR: Centralized adaptive reservation

AU - Chan, Chun Bun Henry

AU - Li, Victor O.K.

AU - Leung, Victor C.M.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

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

U2 - 10.1109/CCECE.2001.933731

DO - 10.1109/CCECE.2001.933731

M3 - Journal article

SN - 0840-7789

VL - 1

SP - 481

EP - 486

JO - Canadian Conference on Electrical and Computer Engineering

JF - Canadian Conference on Electrical and Computer Engineering

ER -

Performance analysis of CAR: Centralized adaptive reservation

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this