A bandwidth space allocation algorithm for ATM networks

Authors:
Malik Alamaireh;Hamad Abuzaied
Affiliations:
Department of CS, Amman Alahleyyah University, Assalt, Jordan;Department of Information Systems, University of Phyladelphya, Assalt, Jordan
Venue:
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Year:
2006

Citing 5
Cited 1

Reliable and efficient hop-by-hop flow control

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Virtual path routing for survivable ATM networks

IEEE/ACM Transactions on Networking (TON)
The variation of optimal bandwidth and buffer allocation with the number of sources

IEEE/ACM Transactions on Networking (TON)
Individual QoS versus aggregate QoS: a loss performance study

IEEE/ACM Transactions on Networking (TON)
Rate adaptive multimedia streams: optimization and admission control

IEEE/ACM Transactions on Networking (TON)

Bandwidth management method for heterogeneous wireless network

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.