Approximate Model for a Merge Configuration of Multiservers With Finite Capacity Intermediate 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 queueing network consisting of multiservers in parallel and connected to a merger queue. All servers have an infinite capacity buffers. The configuration is decomposed into two subsystems: merging multi-servers and merger server and then analyzed in isolation. All times are assumed to be exponentially distributed. First we set and solve the equations for the aggregated merger queue, then express the occupancy probabilities of the original queue through the probabilities of the aggregated one, which reduces significantly the number of equations describing the behavior of the network. Using the fore-mentioned result, we derive expressions for the occupancy probabilities and other parameters of the merging queue.
dc.identifier.citationNikolov, Approximate Model for a Merge Configuration of Multiservers with Finite Intermediate Buffers,Intl. J. of Appl. Maths, No. 3, 2013, pp. 391-401
dc.identifier.issn1311-1728
dc.identifier.otherY
dc.identifier.urihttp://dx.doi.org/10.12732/ijam.v26i3.12
dc.identifier.urihttp://repository.tml.nul.ls/handle/20.500.14155/75
dc.language.isoEn
dc.publisherInternational Journal of Applied Mathematics
dc.rights2013 Academic Publications
dc.subjectFlow conservation
dc.titleApproximate Model for a Merge Configuration of Multiservers With Finite Capacity Intermediate Buffersen
dc.typeArticle
Files
Collections
Research Articles