Loading...
Please wait, while we are loading the content...
Output Models of MAP/PH/1(/K) Queues for an EÆ ient Network De omposition
| Content Provider | Semantic Scholar |
|---|---|
| Author | Heindl, Armin |
| Copyright Year | 2016 |
| Abstract | For non-trivial (open) queueing networks, traÆ -based de omposition often represents the only feasible { and at the same time fast { solution method besides simulation. The network is partitioned into individual nodes whi h are analyzed in isolation with respe t to approximate internal traÆ representations. Sin e the orrelations of network traÆ may have a onsiderable impa t on performan e measures, they must be aptured to some extent by the employed traÆ des riptors. The de omposition methodology presented in this paper is based on Markovian arrival pro esses (MAPs), whose orrelation stru ture is determined from the busy-period behavior of the upstream queues. The resulting ompa t MAPs in onne tion with sophisti ated moment mat hing te hniques allow an eÆ ient de omposition of large queueing networks. Compared with [13℄, the output approximation of MAP/PH/1(/K) queues { the ru ial step in MAP-based de omposition { is re ned in su h a way that also higher moments of the number of ustomers in a busy period an be taken into a ount. Numeri al experiments demonstrate the substantially enhan ed pre ision due to the improved output models and plumb the new opportunities in the trade-o between a ura y and eÆ ien y. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://webspn.hit.bme.hu/~telek/cikkek/hein02h.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
