Model For A Merge Configuration of Identical Single Servers with Finite Capacity Buffers

Simple item page
dc.contributor.authorNikolov, A. V.
dc.date.accessioned2016-11-28T11:40:24Z
dc.date.available2016-11-28T11:40:24Z
dc.date.issued2013
dc.description.abstractWe consider a queuing network consisting of identical single servers in parallel and connected to a merger queue. All servers have finite capacity buffers of equal size. The configuration is decomposed into two subsystems: merging servers and merger server and then analyzed in isolation. All times of the merging servers are assumed to be exponentially and identically distributed, but the service time of the merger queue is quite generally distributed. First we set and solve integro-differential equations for the merger queue, then express the occupancy probabilities of the merging queue through the probabilities of the merger, which reduces significantly the number of equations describing the behavior of the network.
dc.identifier.citationNikolov A.V., Model For A Merge Configuration of Identical Single Servers with Finite Capacity Buffers, Int�l. J. of Sci. Res. (IJSR), Vol. 2, 2013, No. 12, pp. 354-362
dc.identifier.issn2277-8179
dc.identifier.otherY
dc.identifier.urihttp://repository.tml.nul.ls/handle/20.500.14155/74
dc.language.isoEn
dc.publisherInternational Journal of Scientific Research
dc.rightsCreative Commons CC BY
dc.subjectFlow conservation
dc.titleModel For A Merge Configuration of Identical Single Servers with Finite Capacity Buffersen
dc.typeArticle
Files
Collections
Research Articles