DSpace Repository

Analysis of G–queue with unreliable server

Show simple item record

dc.contributor.author Kulshrestha, Rakhee
dc.date.accessioned 2023-08-07T06:13:33Z
dc.date.available 2023-08-07T06:13:33Z
dc.date.issued 2012-12
dc.identifier.uri https://link.springer.com/article/10.1007/s12597-012-0117-y
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11190
dc.description.abstract This paper presents a model for a discrete time single server G-queue with two types of independent arrivals, namely positive and negative. The arrival of negative customer to queueing system removes one customer from the head of the queue (RCH), which causes server breakdown. The repair of the server is non-instantaneous and after repair server is assumed as good as new. The interarrival times of both positive and negative customers and the repair times of the server are geometrically distributed. We analyse the queueing system by using Matrix Geometric method. The expressions for various performance measures such as mean queue length, throughput, delay, etc. are derived and calculated numerically. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Mathematics en_US
dc.subject G–queue en_US
dc.title Analysis of G–queue with unreliable server en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account