Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9799
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChauhan, Siddhartha-
dc.date.accessioned2014-11-20T10:20:16Z-
dc.date.available2014-11-20T10:20:16Z-
dc.date.issued2003-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9799-
dc.guideMisra, Manoj-
dc.description.abstractIntegrated services networks face the challenge of managing several traffic classes at the same time. Service disciplines for integrated service network therefore need to be flexible i.e. able to provide different type of services in order to accommodate different traffic classes efficiently. When traffic flow pertaining to multiple traffic classes, each bearing different QoS requirements coexist in a network, resource management needs to be flexible enough to efficiently provide each flow with a different type of service according to its class at a feasible computation complexity. Service disciplines based on generalized processor sharing paradigm which schedule flows according to their weights lack flexibility needed to efficiently manage both classes at the same time. Fair queuing was invented to ensure that every flow gets it's fair share of total bandwidth. Fair queuing has proven to have nearly perfect isolation and fairness. Various schemes based on this idea have been developed. Though they provide good isolation and fairness most fair queuing schemes are too costly to implement as they take time to process each packet. Efficient fair queuing using Deficit Round Robin (DRR) reduces workload time per packet while maintaining fairness. Service disciplines based on dual class paradigm, which considers two traffic classes at the same time are flexible and efficient for integrated services networks. In this dissertation performance of Packet Timed Token Service Discipline (PTTSD) an innovative packet scheduling discipline, which approximates the dual class paradigm at a possible computational complexity has been compared with Deficit Round Robin (DRR) and DRR++ by simulation. Simulation results show that out of the three PTTSD is more efficient to provide QoS in integrated services networks. Simulation Program is written in Visual C++ on Pentium-IV PC having windows 98 operating system. Performance curves have been plotted in Microsoft Excel based on simulation data.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titlePERFORMANCE EVALUATION OF A SCHEDULING ALGORITHM FOR PROVIDING QoS IN INTEGRATED SERVICES NETWORKSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG11305en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG11305.pdf3.03 MBAdobe PDFView/Open


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