Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9692
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSarswat, Bhumeshwar-
dc.date.accessioned2014-11-20T06:01:52Z-
dc.date.available2014-11-20T06:01:52Z-
dc.date.issued2001-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9692-
dc.guideMitra, R.-
dc.description.abstractCongestion control is an important issue in the network area. There are two type of congestion control policies: Open-Loop Congestion Control and Close-Close loop congestion control. Close-loop congestion control is a feedback type control. In the present work a close-loop Congestion control algorithm is described. This algorithm is for high-speed data networks like ATM networks. This algorithm is meant for Available Bit Rate (ABR) class of service in ATM networks. The algorithm used here is derived using classical control theory and Smith's dead-time compensator. The designed algorithm ensures the stability of the network queues that each transmission links have. The dynamics of the link queue is analyzed using Laplace's Transform method and classical control theory. This algorithm insures the link queue stability for different links with different propagation delays. The software simulation model of the network and the algorithm described is the major part of the whole work.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectCONGESTION CONTROL ALGORITHMen_US
dc.subjectATM NETWORKSen_US
dc.subjectSMITH'S PRINCIPLEen_US
dc.titleSTUDY OF CONGESTION CONTROL ALGORITHM IN ATM NETWORKS USING SMITH'S PRINCIPLEen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG10271en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG10271.pdf2.59 MBAdobe PDFView/Open


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