Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9753
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNain, Jagjeet Singh-
dc.date.accessioned2014-11-20T08:35:29Z-
dc.date.available2014-11-20T08:35:29Z-
dc.date.issued2002-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9753-
dc.guideMisra, Manoj-
dc.description.abstractGuaranteed Frame Rate (GFR) is an improvement of the Unspecified Bit Rate (UBR) ATM service category. It intends to provide legacy applications, especially TCP/IP data applications, with minimum rate guarantees at the frame level. Research focuses on the design of switches that may provide the specified guarantees. The basic methods for supporting rate guarantees — policing, buffer management, and scheduling — are integrated into the GFR implementations. These are divided into three parts; the service conformance, frame eligibility and frame forwarding mechanisms. We first present some most. significant GFR mechanisms proposed in the literature and highlight important conclusions derived. We.then investigate the performance of TCP traffic over ATM networks using the GFR service category. We first consider the Simple FIFO based scheme with frame tagging mechanism. It discards arriving cells based on the buffer occupancy and the frame priority, i.e. whether the frame is tagged or untagged. We then implement per-VC threshold & scheduling and per-VC scheduling & RED mechanisms. Both of them rely on .per-VC queuing while the frame discard decision is based on the per-VC accounting, total buffer occupancy and the frame priority. Simulation shows that the second mechanism is more efficient in comparison to other mechanism proposed for the same task. Sirpulations show that the simple FIFO-based implementation performs poor, in terms of efficiency and fairness, as compared to the per-VC queuing counterpart. We propose a method that uses a shaping mechanism with simple switch to provide rate guarantees. Simulations show that our scheme, when used with simple FIFO, per-VC threshold & scheduling and per-VC scheduling & RED mechanisms gives better results.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectRATE GUARANTEESen_US
dc.subjectINTERNET TRAFFICen_US
dc.subjectATM GFR SERVICEen_US
dc.titleON PROVIDING RATE GUARANTEES FOR INTERNET TRAFFIC OVER THE ATM GFR SERVICEen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG10727en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG10727.pdf4.11 MBAdobe PDFView/Open


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