Показать сокращенную информацию

Interpolation Approximations for Symmetric Fork-Join Queues

dc.contributor.authorVarma, S.en_US
dc.contributor.authorMakowski, Armand M.en_US
dc.date.accessioned2007-05-23T09:52:03Z
dc.date.available2007-05-23T09:52:03Z
dc.date.issued1992en_US
dc.identifier.urihttp://hdl.handle.net/1903/5303
dc.description.abstractIn this paper we propose a family of heuristic approximations for the expected response time of K-dimensional symmetric Fork-Join systems in statistical equilibrium with general inter-arrival and service time distributions. To do this, we rely on the light traffic interpolation technique popularized by Reiman and Simon. The starting point for our approach is the formula for the heavy traffic limit for two dimensional Fork-Join queues that was obtained in [17,19]. By observing a fortuitous agreement between the light traffic derivative and the heavy traffic limit for this system under Markovian assumptions. we are able to obtain an approximation to the heavy traffic limit for -dimensional systems with general inter-arrival and service distributions. By combining this heavy traffic limit with light traffic limits, we are able to obtain interpolation approximations for the Fork-Join queue which agree extremely well with simulation results.en_US
dc.format.extent1369304 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1992-122en_US
dc.subjectqueueing networksen_US
dc.subjectCommunication en_US
dc.subjectSignal Processing Systemsen_US
dc.titleInterpolation Approximations for Symmetric Fork-Join Queuesen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Файлы в этом документе

Thumbnail

Данный элемент включен в следующие коллекции

Показать сокращенную информацию