Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T11:53:20.046Z Has data issue: false hasContentIssue false

Analyzing discrete-time bulk-service Geo/Geob/m queue

Published online by Cambridge University Press:  08 November 2006

Veena Goswami
Affiliation:
Department of Computer Science, Kalinga Institute of Industrial Technology, Bhubaneswar-751024, India; veena_goswami@yahoo.com
Umesh C. Gupta
Affiliation:
Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India; umesh@maths.iitkgp.ernet.in; sujit.samanta@rediffmail.com
Sujit K. Samanta
Affiliation:
Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India; umesh@maths.iitkgp.ernet.in; sujit.samanta@rediffmail.com
Get access

Abstract

This paper analyzes adiscrete-time multi-server queue in which service capacity of eachserver is a minimum of one and a maximum of b customers. Theinterarrival- and service-times are assumed to be independent andgeometrically distributed. The queue is analyzed under theassumptions of early arrival system and late arrival system withdelayed access. Besides, obtaining state probabilities atarbitrary and outside observer's observation epochs, someperformance measures and waiting-time distribution in the queuehave also been discussed. Finally, it is shown that in limitingcase the results obtained in thispaper tend to the continuous-time counterpart.

Information

Type
Research Article
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable