Abstract
This paper proposes two improvements of fitting algorithms for Markovian arrival processes (MAPs). The first improvement is to enhance the computation speed of Ryd\'en's EM algorithm (1996) for estimating MAP parameters. The second one is to provide an efficient sub-class of MAPs to be appropriate for fitting to real traffic data. More precisely, we propose a traffic modeling based on a hidden Markov model which belongs to a sub-class of MAPs. Such a modeling framework leads to a faster fitting algorithm than the conventional algorithm with general MAPs. In numerical examples, we present the effectiveness of proposed fitting algorithms through a real traffic trace.
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.
