Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9440
Full metadata record
DC FieldValueLanguage
dc.contributor.authorArya, Mukesh Kumar-
dc.date.accessioned2014-11-19T08:57:11Z-
dc.date.available2014-11-19T08:57:11Z-
dc.date.issued1996-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9440-
dc.guideKumar, Padam-
dc.description.abstractThe client-server architecture differs significantly from corporate computing paradigm of the past in an important way. In a client-server paradigm, applications are no longer physically contained in one computer system, as they were in both centralized and decentralized models. Instead, applications, databases and information processing resources are divided among many system in a seamless communication network that appears to the user as a single user machine. In this thesis, client-server systems in which a set of workstations access file server over a local area network are considered. The systems are modeled by a class of stochastic Petri nets. The mean response time, and the throughput are evaluated for a client-server system based on token ring network and a system based on CSMA/CD network. Our models are different form the prevalent performance models of token ring or CSMA/CD network systems because of the message interdependencies introduced by the client-server structure., An approximate analytic-numeric method and the simulation is used to solve the models.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.titlePETRI NET BASED PERFORMANCE EVALUATION OF CLIENT-SERVER SYSTEMSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number247674en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD247674.pdf4.29 MBAdobe PDFView/Open


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