CAC algorithm for per-VC queueing systems loaded by fractal traffic

Abstract

ATM technology is expected to support a broad variety of services and applications, satisfying a wide range of user quality needs and network performance objectives. In this scenario a per-Virtual Connection (per-VC) queueing is needed to guarantee different Quality of Service (QoS) requirements and to provide adequate congestion avoidance techniques (such as Early Packet Discard) to single traffic flows. In the paper we present a Call Admission Control (CAC) scheme with per-VC management of network resources. Starting from the widely accepted long memory properties of broadband traffics, fractional Brownian motion (fBm) is used as a parsimonious traffic model. The proposed CAC scheme employs the knowledge of the exact asymptotic queue length distribution to efficiently allocate network resources (buffer and output link capacity) to the contending sources. We analyze the multiplexing gain considering an appropriate distribution of the bandwidth among different sources, highlighting its advantages over the Rate Envelope Multiplexing scheme, suggested by ITU-T