Show simple item record

dc.contributor.authorDshalalow, Jewgeni H.
dc.date.accessioned2014-11-18T16:30:49Z
dc.date.available2014-11-18T16:30:49Z
dc.date.issued1991
dc.identifier.citationDshalalow, J. (1991). A single-server queue with random accumulation level. Journal of Applied Mathematics and Stochastic Analysis, 4(3), 203.en_US
dc.identifier.urihttp://hdl.handle.net/11141/422
dc.description.abstractThe author studies the queueing process in a single-server bulk queueing system. Upon completion of a previous service, the server can take a group of random size from customers that are available. Or, the server can wait until the queue attains a desired level. The author establishes an ergodicity criterion for both the queueing process with continuous time parameter and the imbedded process. Under this criterion, the author obtains explicit formulas for the stationary distributions of both processes by using semi-regenerative techniques.en_US
dc.language.isoen_USen_US
dc.rightsThis published article is available in accordance with the publisher's policy. It may be subject to U.S. Copyright Law.en_US
dc.rights.urihttp://www.hindawi.com/journals/ijsa/en_US
dc.titleA single-server queue with random accumulation levelen_US
dc.typeArticleen_US
dc.identifier.doi10.1155/S1048953391000163


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record