Simulation of ATM switching

Pao Yue-kong Library Electronic Theses Database

Simulation of ATM switching

 

Author: Ho, Albert Kim-man
Title: Simulation of ATM switching
Degree: M.Sc.
Year: 1994
Subject: Asynchronous transfer mode
Integrated services digital networks
Closed-circuit television
Broadband communication systems
Hong Kong Polytechnic -- Dissertations
Department: Multi-disciplinary Studies
Pages: v, 126 leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1182936
URI: http://theses.lib.polyu.edu.hk/handle/200/3816
Abstract: This project concerns the modeling of video source, generation and switching of video packets or cells in high speed multi-media BISDN/ATM networks. These simulation works were initiated by the advantages of connecting video surveillance closed circuit television systems for road traffic monitoring via cost effective virtual circuits of ATM networks. Review was first made to the coding and compression algorithms and the related international standards for bandwidth reduction of video/image transmissions. The image processing system for traffic incident detection as proposed in [26] spatially divides picture of traffic scene and classifies the cells according to the traffic status as 'moving', 'stationary' and 'empty'. Modeling of video sources by means of autoregressive process and a model of road traffic flow and camera scanning were carried out, but pure exponential and random distributions were used for the simulation of ATM switching for comparing results from other researches [1] and [2]. Different architecture and queuing methods for non-blocking ATM switch fabrics were investigated and it is noted that both pure output and pure input queuing are not practical due to their inherent problems of extremely large buffer requirement and head of queue blocking. A model based on backpressure input-output queuing was therefore made and the results show that with a speed up factor of two (i.e. internal switch rate is twice that of input/output link), the performance is very close to pure output queuing but the required buffer size is reasonable. Also, limited improvements are found with speed up factor higher than two. Pure random contention, fixed priority and dynamic priority switching were simulated and the results support the need for a dynamic priority switching scheme to provide both cell-level and connection-level priority so as to assure the different quality of service QOS requirements.

Files in this item

Files Size Format
b11829369.pdf 3.950Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. 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.
  3. 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.

     

Quick Search

Browse

More Information