Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9380
Title: PERFORMANCE STUDY OF BINARY CONGESTION CONTROL SCHEMES FOR ATM LANs THROUGH SIMULATION
Authors: Sekhar, D. M. S.
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;BINARY CONGESTION CONTROL;ATM;LANs THROUGH SIMULATION
Issue Date: 1996
Abstract: The introduction of the asynchronous transfer rnode(ATM) is currently • being propelled by the need for fast data communications in public and private networks. ATM is the switching and multiplexing technique employed for B-ISDN. The ability of ATM technology to handle multimedia traffic justifies its introduction into the local area. The LAN traffic is connectionless and delay insensitive. Data are transmitted without a prior connection establishment, and user traffic characteristics are not specified. The main characteristics of this type of traffic known as best- effort traffic is that it is bursty and unpredictable. In order to support an efficient statistical sharing of bandwidth among competing users, a congestion control mechanism is required. The technique to be employed for congestion control of this traffic remains an important issue. This thesis aims to study the benefits gained by using reactive congestion control scheme for ATM LANs. The performance of two reactive control schemes referred to as binary control schemes has been studied and compared in this dissertation through simulation. Simulation results show that a significant reduction in cell-loss probability can be achieved, and the statistical gain can be increased by the binary congestion control schemes over a wide rage of the amount of offered traffic.
URI: http://hdl.handle.net/123456789/9380
Other Identifiers: M.Tech
Research Supervisor/ Guide: Lal, Mohan
Sarje, A. K.
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD247062.pdf2.99 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.