DESIGN AND EVALUATION OF A METHOD FOR ADMISSION CONTROL FOR BROAD-BAND PACKET NETWORKS

In this paper two admission control algorithms are defined and evaluat ed. The algorithms are designed for use with an architecture which seg regates traffic flows into multiple queues, one for each individual co nnection or one for each class of connections. The approach makes it p ossible to provide multiple classes of service. Resource allocation ta bles can be prepared efficiently, using simulation. The resulting tabl es are independent of possible traffic mixtures and require only two s calar numbers to specify required resources. The admission process can be carried out by passing the two numbers between nodes, and it is no t necessary to provide detailed information about traffic mixtures. Th e paper presents a comprehensive performance study, carried out with s imulation, to evaluate the performance of the proposed admission contr ol algorithms in relation to other algorithms described in the literat ure. Under the conditions used in the performance study, simulation is used to establish an admissible region of all possible combinations o f the numbers of sources in two classes of traffic which can be suppor ted by a specific channel independent of the admission algorithm. Thus , the algorithms are compared to the best that is possible as well as competing algorithms. For the case of multiple sources with different quality of service requirements, one of the proposed algorithms outper formed three competing algorithms and gave results close to the best t hat can be achieved with any admission algorithm.