Abstract
This paper presents a Markov arrival process (MAP) based methodology for the analysis of two-class queueing networks with priority service nodes. We apply the multi-class extension of MAP, referred to as Marked MAP (MMAP), for the description of the input and internal traffic in the queueing network. The MMAP traffic description allows to capture not only the dependency structure of the traffic classes themselves, but also the inter-class dependency of the high and low priority traffic. To carry out MMAP based queueing network analysis the paper presents several contributions: the departure process analysis of the MMAP/MAP/1 priority queue, an MMAP construction method based on the joint moments of two consecutive inter-departure times and some new results towards the efficient performance analysis of the MMAP/MAP/1 priority queue. Numerical examples illustrate the accuracy of the proposed traffic based decomposition method.
Sign-in/Register to access full text options 
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.
