SIMPLE SCHEMES FOR TRAFFIC INTEGRATION AT CALL SET-UP LEVEL IN ATM NETWORKS

The paper presents a scheme for admission control at call set-up level at an ATM node. The traffic is considered to be divided into classes, characterized by statistical parameters like peak and average bandwid th, and by Quality of Service (QoS) requirements that allow us to defi ne a 'feasibility region' where such requirements are guaranteed. A mo del to describe the 'call admission' is proposed. Then, three alternat ive strategies to get the maximum number of acceptable connections, by taking into account the probability of blocking a call at the call se t-up level, are described. The first one is intended to minimize the o verall call blocking probability; the second one is aimed at balancing the probability among the different traffic classes; while the last o ne allows us to enforce a constraint on the call blocking probability. The efficiency of the proposed strategies is tested by simulation and verified by comparing it with other admission control schemes that ap pear in the literature.