Exploring a New Markov Chain Model for Multiqueue Systems

Abstract

Copyright and moral rights to this thesis/research project are retained by the author and/or other copyright owners. The work is supplied on the understanding that any use for commercial gain is strictly forbidden. A copy may be downloaded for personal, non-commercial, research or study without prior permission and without charge. Any use of the thesis/research project for private study or research must be properly acknowledged with reference to the work's full bibliographic details.This thesis/research project may not be reproduced in any format or medium, or extensive quotations taken from it, or its content changed in any way, without first obtaining permission in writing from the copyright holder(s).If you believe that any material held in the repository infringes copyright law, please contact the Repository Team at Middlesex University via the following email address:eprints@mdx.ac.ukThe item will be removed from the repository while any claim is being investigated.

A Survey on Usage Analytics for Imaging Diagnostic Equipments

“…The policies for maximum waiting time standards which is followed in the hospital is being described in [9]. Logistic regression and artificial neural network were discussed in [10]. The logistic regression approach looks good for this work.…”

Analysis of a Three-Queue Polling System with Probabilistic Routing

“…P(0), the overall probability of an idle system at an arbitrary switch point, can be estimated using a novel technique introduced in Mapp et. al (2010), called the Zero-server Markov chain for exhaustive service polling systems.…”

Markov Chain Application in Object-Oriented Software Designing

“…Adnan and Islam [13] have presented a technique for voice correction and interpolation using Markov chain detection. Mapp et al [14] have proposed to describe multiqueue systems in terms of a new Markov Chain called the Zero-Server Markov Chain (ZSMC). Dirk [15] has introduced the reader into mixing time estimations via coupling arguments and uses the mixing of pheromone models for analyzing the expected optimization time of ant colony optimization.…”