LEAKY-BUCKET-WITH-GATE ALGORITHM FOR CONNECTION-SETUP CONGESTION CONTROL IN MULTIMEDIA NETWORKS

A leaky-bucket-with-gate algorithm is proposed to control connection-s etup congestion in telecommunication networks providing multimedia ser vices, in place of the call-gapping algorithm used in telephone networ ks. Multimedia services may use more than one connection simultaneousl y, while standard telephone services use only one connection at a lime . A set of connections used to construct a multimedia service is calle d a correlated connection group, and the setup requests of such a grou p form a correlated request group. A correlated request group is assum ed to be accepted into the network only when ail the connection-setup requests for the group are accepted. In this paper, the proposed leaky -bucket-with-gate algorithm, a pure leaky-bucket algorithm, and a call -gapping algorithm are evaluated by simulating traffic with a mix of c orrelated and uncorrelated connection-setup requests, which models set up requests for video conferencing and telephone services. The simulat ion results show that the proposed algorithm accepts correlated reques t groups more efficiently than the pure leaky-bucket and call-gapping algorithms under the simulated traffic conditions, except when the int erarrival time in a correlated request group is longer than the accept ance interval. We also present queueing analysis for determining the c ontrol parameters in the proposed algorithm. Implementation of this al gorithm will facilitate the handling of both setup request traffic for correlated connection groups and for uncorrelated connections in mult imedia networks.