DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11084
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShekhar, Chandra-
dc.date.accessioned2023-08-02T03:51:19Z-
dc.date.available2023-08-02T03:51:19Z-
dc.date.issued2002-
dc.identifier.urihttps://www.ije.ir/article_71381.html-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11084-
dc.description.abstractIn the present study, we analyze the multi-channel service system with ordered entryfrom finite-source and finite-storage at each channel. The arrival and service rates are assumedto be state dependent. The steady state probabilities of the system are obtained by usingChapmann-Kolmogorov equations. Some other performance indices viz. utilization of servers,expected number of units in the system and expected number of units at each channel have beenderived. A computational algorithm is developed to determine the optimal allocation of storagespace facilitated in front of three heterogeneous servers. Sensitivity analysis has been carried outto study the effect of variation of different parameters on the system performance.en_US
dc.language.isoenen_US
dc.publisherMERCen_US
dc.subjectMathematicsen_US
dc.subjectMultIen_US
dc.subjectOrdered Entryen_US
dc.subjectDependenten_US
dc.subjectChapmannen_US
dc.subjectKolmogorov Equationsen_US
dc.subjectQueue Size Distributionen_US
dc.titleState Dependent Multi channel Queuing System with Ordered Entryen_US
dc.typeArticleen_US
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


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