|Title:||Bandwidth allocation algorithms in ATM networks|
|Subject:||Asynchronous transfer mode|
Broadband communication systems
Hong Kong Polytechnic University -- Dissertations
Department of Electronic and Information Engineering
|Pages:||[v], 73 leaves : ill. ; 31 cm|
|Abstract:||Asynchronous Transfer Mode (ATM) technology has become a networking technology in providing the capability of integrating different types of networks into a single, consolidated broadband network. Traffic control and resource management is one of the hottest topics in ATM networks as the Quality of service (QoS) should be fulfilled for all service categories. The objective of this dissertation is to investigate and survey different bandwidth allocation solutions for the variable bit-rate (VBR) traffic in ATM networks. The methods investigated include conventional static slot assignment algorithm, adaptive slot assignment algorithm, rate-based dynamic slot assignment algorithm and the modified rate-based dynamic slot assignment algorithm. In this work, computer simulations have been carried out to evaluate the performance of various bandwidth allocation algorithms. The scenario of the simulations is described as follows. The cells from each connection are first queued up and multiplexed at the network entry point with the buffering capability into one link. The multiplexed stream is then transmitted over the link to the destination end of the link. Different performance parameters such as the average cell delay, the coefficient of variation and the line utilization are evaluated and compared among different algorithms.|
Files in This Item:
|b15176940.pdf||For All Users (off-campus access for PolyU Staff & Students only)||2.54 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: