Interpolation Approximations for Symmetric Fork-Join Queues
| dc.contributor.author | Varma, S. | en_US |
| dc.contributor.author | Makowski, Armand M. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:52:03Z | |
| dc.date.available | 2007-05-23T09:52:03Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | In 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.extent | 1369304 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5303 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1992-122 | en_US |
| dc.subject | queueing networks | en_US |
| dc.subject | Communication | en_US |
| dc.subject | Signal Processing Systems | en_US |
| dc.title | Interpolation Approximations for Symmetric Fork-Join Queues | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1