A Bandwidth Space Allocation Algorithm For ATM Networks

摘要

In this paper we introduce a new algorithm for bandwidth allocation in ATM networks based on assigning each traffic class a wide range of bandwidth values, which we call Bandwidth Space. Previous strategies, which proposed a single bandwidth value for each class, which causes a large waste of bandwidth -in case of peak allocation- or a shortage of resources and consequently data corruption -in case of average or minimum bandwidth allocation-. In this paper we aim at solving this problem to avoid data corruption and to save network resources from waste. The assigned bandwidth for each traffic class is segmented into a number of segments beginning with the minimum value for a specific class, and scaled up to the peak value. Experimental results of the proposed algorithm were obtained and illustrated and they verify its robustness and reliability.