DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11195
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKulshrestha, Rakhee-
dc.date.accessioned2023-08-07T06:50:58Z-
dc.date.available2023-08-07T06:50:58Z-
dc.date.issued2009-
dc.identifier.urihttps://www.kau.edu.sa/Files/320/Researches/52743_23049.pdf-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11195-
dc.description.abstractIn this paper, we develop a finite queueing model having single and batch service modes for telecommunication system, where two types of traffic, i.e. voice and data arrive in Poisson fashion. The server starts service only when N packets are accumulated in the system. The server performs service singly until there are C packets in the system. After then type 2 packets are discarded and all type 1 packets are served in a batch. The arrival rates of packets depend upon the server’s status. The transient state probabilities of system states are obtained by solving a set of linear equations with the help of Laplace Transform technique. Performance indices such as average queue length, expected idle time, and expected busy period are determined. We also investigate the optimal value of threshold parameter N and C after which the server changes the mode of service in order to minimize the expected cost. The numerical illustrations are provided to visualize the effect of various parameters on system performanceen_US
dc.language.isoenen_US
dc.publisherJKAUen_US
dc.subjectMathematicsen_US
dc.subjectBi-levelen_US
dc.subjectN-policyen_US
dc.subjectIntegrated trafficen_US
dc.subjectPriorityen_US
dc.subjectStatedependent ratesen_US
dc.subjectOptimal Controlen_US
dc.titleTransient Analysis of a Telecommunication System Using State Dependent Markovian Queue under Bi-Level Control Policyen_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.