Abstract
The decomposition based approximate numerical analysis of queueing networks of MAP/MAP/1 queues with FIFO scheduling is considered in this paper. One of the most crucial decisions of decomposition based queueing network analysis is the description of inter-node traffic. Utilizing recent results on Markov arrival processes (MAPs), we apply a given number of joint moments of the consecutive inter-event times to describe the inter-node traffic. This traffic description is compact (uses far less parameters than the alternative methods) and flexible (allows an easy reduction of the complexity of the model). Numerical examples demonstrate the accuracy and the computational complexity of the proposed approximate analysis method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
