Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9317
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBalaji, B.-
dc.date.accessioned2014-11-19T07:13:14Z-
dc.date.available2014-11-19T07:13:14Z-
dc.date.issued1995-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9317-
dc.guideSarje, A. K.-
dc.description.abstractThe Asynchronous Transfer Mode (ATM) is considered as the transport method for Broadband Integrated Services Digital Network (B-ISDN). By using ATM, information flow is carried by cells of fixed size. Cells are transmitted through virtual circuits and are self routed based on their header information. In this way , ATM networks can transmit various types of information in a flexible way. However without appropriate traffic control measures, these high speed networks may easily get congested. To operate in a flexible and efficient way it is necessary to regulate the traffic that flows into the ATM network. Most congestion control schemes used in data networks are not suitable to ATM networks. The best way to control congestion in.ATM networks is by using policing mechanisms. These mechanisms will regulate the traffic that flow into the network and there by reduces congestion. The different policing mechanisms proposed so far are, the "leaky bucket", the jumping window", the "triggered jumping window", and the "exponential weighted moving average" mechanisms. The theory, performance of each mechanism.and the comparison between them are discussed in this dissertation through simulation.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectPOLICING MECHANISMSen_US
dc.subjectATM NETWORKSen_US
dc.subjectSIMULATIONen_US
dc.titlePERFORMANCE COMPARISON OF POLICING MECHANISMS OF ATM NETWORKS THROUGH SIMULATIONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246843en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD246843.pdf4.53 MBAdobe PDFView/Open


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