Relevant bibliographies by topics / Markov queueing model

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Markov queueing model'

Author: Grafiati
Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Markov queueing model.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Markov queueing model"

1

GAWRON, PIOTR, DARIUSZ KURZYK, and ZBIGNIEW PUCHAŁA. "A MODEL FOR QUANTUM QUEUE." International Journal of Quantum Information 11, no. 02 (March 2013): 1350023. http://dx.doi.org/10.1142/s0219749913500238.

Full text
Abstract:
We consider an extension of discrete time Markov chain queueing model to the quantum domain by use of discrete time quantum Markov chain. We introduce methods for numerical analysis of such models. Using these tools we show that quantum model behaves fundamentally different from the classical one.
APA, Harvard, Vancouver, ISO, and other styles
2

Tanackov, Prentkovskis, Jevtić, Stojić, and Ercegovac. "A New Method for Markovian Adaptation of the Non-Markovian Queueing System Using the Hidden Markov Model." Algorithms 12, no. 7 (June 28, 2019): 133. http://dx.doi.org/10.3390/a12070133.

Full text
Abstract:
This manuscript starts with a detailed analysis of the current solution for the queueing system M/Er/1/∞. In the existing solution, Erlang’s service is caused by Poisson’s arrival process of groups, but not individual clients. The service of individual clients is still exponentially distributed, contrary to the declaration in Kendall’s notation. From the related theory of the Hidden Markov Model (HMM), for the advancement of queueing theory, the idea of “hidden Markov states” (HMS) was taken. In this paper, the basic principles of application of HMS have first been established. The abstract HMS states have a catalytic role in the standard procedure of solving the non-Markovian queueing systems. The proposed solution based on HMS exceeds the problem of accessing identical client groups in the current solution of the M/Er/r queueing system. A detailed procedure for the new solution of the queueing system M/Er/1/∞ is implemented. Additionally, a new solution to the queueing system M/N/1/∞ with a normal service time N(μ,σ) based on HMS is also implemented.
APA, Harvard, Vancouver, ISO, and other styles
3

Böhm, W., and S. G. Mohanty. "Transient analysis of M/M/1 queues in discrete time by general server vacations." Journal of Applied Probability 31, A (1994): 115–29. http://dx.doi.org/10.2307/3214952.

Full text
Abstract:
In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.
APA, Harvard, Vancouver, ISO, and other styles
4

Böhm, W., and S. G. Mohanty. "Transient analysis of M/M/1 queues in discrete time by general server vacations." Journal of Applied Probability 31, A (1994): 115–29. http://dx.doi.org/10.1017/s0021900200107028.

Full text
Abstract:
In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.
APA, Harvard, Vancouver, ISO, and other styles
5

Balea, Paraschiv, and Gheorghe Potcovaru. "A QUEUEING MODEL FOR SOME CATALYTIC REACTIONS." SOUTHERN BRAZILIAN JOURNAL OF CHEMISTRY 9, no. 10 (December 20, 2001): 23–30. http://dx.doi.org/10.48141/sbjchem.v9.n10.2001.26_2001.pdf.

Full text
Abstract:
The waiting model associated to the catalytical process given by the chemical eq_uation C + S ↔ CS ↔ C + P (1), is described by the Markov process: {Xi(t); t≥O}, (i = 1, 2, 3, 4), where the random variables are the concentrations of the species C (the catalyst), S (the substrate}, CS (the intermediate complex formed by the substrate S and the catalyst) and P (the reaction product) at time t. The equations, that describe the evolution of the process, have been obtained.
APA, Harvard, Vancouver, ISO, and other styles
6

Tiến, Đỗ Văn, and Csaba Rotter. "A CLOSED-FORM SOLUTION FOR A QUEUEING MODEL OF ENERGY EFFICIENT ETHERNET LINKS." Journal of Computer Science and Cybernetics 37, no. 4 (October 12, 2021): 453–64. http://dx.doi.org/10.15625/1813-9663/37/4/16126.

Full text
Abstract:
To save energy consumption of Ethernet switches, IEEE has standardized a new energy-efficient operation for Ethernet links with a low-power state and transition mechanisms between the high-power state for transporting traffic and the low-power state.In this paper, we propose a queueing model with the Markov Modulated Compound Poisson Process that is able to characterize backbone packet traffic. We derive a closed-form solution for the stationary distribution of the proposed queueing model. We show that our model can capture an entire system where the transition times are constant.
APA, Harvard, Vancouver, ISO, and other styles
7

Baek, Jung Woo, Ho Woo Lee, Se Won Lee, and Soohan Ahn. "A Markov-modulated fluid flow queueing model under D -policy." Numerical Linear Algebra with Applications 18, no. 6 (November 2011): 993–1010. http://dx.doi.org/10.1002/nla.811.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Van Dijk, Nico M. "Perturbation theory for unbounded Markov reward processes with applications to queueing." Advances in Applied Probability 20, no. 1 (March 1988): 99–111. http://dx.doi.org/10.2307/1427272.

Full text
Abstract:
Consider a perturbation in the one-step transition probabilities and rewards of a discrete-time Markov reward process with an unbounded one-step reward function. A perturbation estimate is derived for the finite horizon and average reward function. Results from [3] are hereby extended to the unbounded case. The analysis is illustrated for one- and two-dimensional queueing processes by an M/M/1-queue and an overflow queueing model with an error bound in the arrival rate.
APA, Harvard, Vancouver, ISO, and other styles
9

Van Dijk, Nico M. "Perturbation theory for unbounded Markov reward processes with applications to queueing." Advances in Applied Probability 20, no. 01 (March 1988): 99–111. http://dx.doi.org/10.1017/s0001867800017961.

Full text
Abstract:
Consider a perturbation in the one-step transition probabilities and rewards of a discrete-time Markov reward process with an unbounded one-step reward function. A perturbation estimate is derived for the finite horizon and average reward function. Results from [3] are hereby extended to the unbounded case. The analysis is illustrated for one- and two-dimensional queueing processes by an M/M/1-queue and an overflow queueing model with an error bound in the arrival rate.
APA, Harvard, Vancouver, ISO, and other styles
10

Bäuerle, Nicole, and Ulrich Rieder. "Comparison Results for Markov-Modulated Recursive Models." Probability in the Engineering and Informational Sciences 11, no. 2 (April 1997): 203–17. http://dx.doi.org/10.1017/s0269964800004769.

Full text
Abstract:
We consider a general discrete-time stochastic recursive model that is influenced by an external Markov chain. Our aim is to investigate the effect that the transition matrix of the external process has on the system states of the model. To answer this question, we use new stochastic ordering concepts. Especially interesting are the results for infinite-stage Markov-modulated models. We illustrate our main results by three applications: an inventory model, a consumption model, and a queueing model for a time division multiplexing system.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Markov queueing model"

1

Rahme, Youssef. "Stochastic matching model on the general graphical structures." Thesis, Compiègne, 2021. http://www.theses.fr/2021COMP2604.

Full text
Abstract:
Motivé par des applications à large éventail des systèmes d’assemblage à la commande et des systèmes de l’économie collaborative, nous introduisons un modèle d’appariement aléatoire sur les hypergraphes et sur les multigraphes, étendant le modèle par Mairesse et Moyal 2016. Dans cette thèse, le modèle d’appariement aléatoire sur les structures graphiques générales est défini comme suit : étant donné une structure graphique générale de compatibilité S = (V; S) qui est constituée d’un ensemble de nœuds noté par V qui représentent les classes d’éléments et par un ensemble d’arêtes noté par S qui permettent d’apparier entre les différentes classes. Les éléments arrivent au système à un moment aléatoire, par une séquence (supposée être i:i:d:) constituée de différentes classes de V; et demandent d’être appariés selon leur compatibilité dans S: La compatibilité par groupe de deux ou plus (cas hypergraphique) et par groupe de deux avec les possibilités d’apparier entre les éléments de même classe (cas multigraphique). Les éléments, qui ne sont pas appariés, sont stockés dans le système et en attente d’un futur élément compatible et dès qu’ils sont appariés, ils quittent le système ensemble. À l’arrivée, un élément peut trouver plusieurs d’appariements possibles, les éléments qui quittent le système dépendent d’une politique d’appariement Ø à spécifier. Nous étudions la stabilité du modèle d’appariement aléatoire sur l’hypergraphe, pour des différentes topologies hypergraphiques puis, la stabilité du modèle d’appariement aléatoire sur les multigraphes en utilisant son sous-graphe maximal et sur-graphe minimal étendu pour distinguer la zone de stabilité
Motivated by a wide range of assemble-to-order systems and systems of the collaborativeeconomy applications, we introduce a stochastic matching model on hypergraphs and multigraphs, extending the model introduced by Mairesse and Moyal 2016. In this thesis, the stochastic matching model on general graph structures are defined as follows: given a compatibility general graph structure S = (V; S) which of a set of nodes denoted by V that represent the classes of items and by a set of edges denoted by S that allows matching between different classes of items. Items arrive at the system at a random time, by a sequence (assumed to be i:i:d:) that consists of different classes of V; and request to be matched due to their compatibility according to S: The compatibility by groups of two or more (hypergraphical cases) and by groups of two with possibilities of matching between the items of the same classes (multigraphical cases). The unmatched items are stored in the system and wait for a future compatible item and as soon as they are matched they leave it together. Upon arrival, an item may find several possible matches, the items that leave the system depend on a matching policy _ to be specified. We study the stability of the stochastic matching model on hypergraphs, for different hypergraphical topologies. Then, the stability of the stochastic matching model on multigraphs using the maximal subgraph and minimal blow-up to distinguish the zone of stability
APA, Harvard, Vancouver, ISO, and other styles
2

Rýzner, Zdeněk. "Využití teorie hromadné obsluhy při návrhu a optimalizaci paketových sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219285.

Full text
Abstract:
This master's thesis deals with queueing theory and its application in designing node models in packet-switched network. There are described general principles of designing queueing theory models and its mathematical background. Further simulator of packet delay in network was created. This application implements two described models - M/M/1 and M/G/1. Application can be used for simulating network nodes and obtaining basic network characteristics like packet delay or packet loss. Next, lab exercise was created, in that exercise students familiarize themselves with basic concepts of queueing theory and examine both analytical and simulation approach to solving queueing systems.
APA, Harvard, Vancouver, ISO, and other styles
3

Menéndez, Gómez José Mar­ía. "Computational Methods for Control of Queueing Models in Bounded Domains." Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/28036.

Full text
Abstract:
The study of stochastic queueing networks is quite important due to the many applications including transportation, telecommunication, and manufacturing industries. Since there is often no explicit solution to these types of control problems, numerical methods are needed. Following the method of Boué-Dupuis, we use a Dynamic Programming approach of optimization on a controlled Markov Chain that simulates the behavior of a fluid limit of the original process. The search for an optimal control in this case involves a Skorokhod problem to describe the dynamics on the boundary of closed, convex domain. Using relaxed stochastic controls we show that the approximating numerical solution converges to the actual solution as the size of the mesh in the discretized state space goes to zero, and illustrate with an example.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
4

Gautam, S. Vijay. "Performance Analysis Of A Variation Of The Distributed Queueing Access Protocol." Thesis, Indian Institute of Science, 1995. https://etd.iisc.ac.in/handle/2005/149.

Full text
Abstract:
"A distributed queueing Medium Access Control (MAC) protocol is used in Distributed Queue Dual Bus (DQDB) networks. A modified version of the MAC protocol was proposed by R.R. Pillai and U. Mukherji in an attempt to overcome some of the shortcomings of the DQDB MAC protocol. They analyzed the performance of the system for Bernoulli arrivals and for large propagation delays between the nodes. We extend the performance analysis of the modified MAC protocol for a DQDB type of Network. The parameter of interest to us is the bus access delay. This has two components, viz., the request bus access delay and the data bu6 access delay. We use the model at the request point at node and present methods to evaluate the delay experienced in such a model. The model is an n-priority ./D/l queue with D vacations (non-preemptive priority) where n is the number of nodes sending requests on the request bus for transmission on the data bus. The methods presented help to evaluate the request bus access delay when the arrivals at each node are Markovian Arrival Processes (MAPs). The algorithms for evaluating the mean request bus access delay are based on matrix geometric techniques. Thus, one can use the algorithms developed in the literature to solve for the finite buffers case too. This model, for the request bus access delay, holds irrespective of the propagation delay between the nodes. We also evaluate the inter-departure time of class 1 customers and virtual customers in a 2-priority M/G/l system with G vacations (non-preemptive priority). In the case of Poisson arrivals at all the nodes, we would have a 2-priority M/D/l system with D vacations (non-preemptive priority). We thus evaluate the inter-arrival time of the free slots on the data bus as seen by Node 2. Note that this is independent of the number of active nodes in the network We then develop methods to evaluate the mean data bus access delay experienced by the customers at Node 2 in a three-node network with 2 nodes communicating with the third when the propagation delay between the nodes is large. We consider the case of finite Local Queue buffers at the two nodes. Using this assumption we arrive at process of arrivals to the Combined Queue and the process of free slots on the data bus to be Markov Modulated Bernoulli processes. The model at the combined queue at Node 2 then has a Quasi Birth-Death evolution. Thus, this system is solved by using the Ramaswami-Latouche algorithm. The stationary probabilities are then used to evaluate the mean data bus access delay experienced at Node 2. The finite buffer case of this system can be solved by G.Wi Stewart's algorithm. The method in modelling the system and the results are presented in detail for Poisson arrivals. The extension of this to more complex processes is also explained. We encounter in the analysis an explosion of the state-space of the system. We try to counter this by considering approximations to the process of free slots on the data bus. The approximations considered are on the basis of what are known as Idealized Aggregates. The performance of the approximation is also detailed. It works very well under low and moderate load but underestimates the mean delay under heavy load. Thereafter, we discuss the performance of the system with reference to the mean of the access delay and the standard deviation of the access delay under varying traffic at the two nodes. For this part we use simulation results to discuss the performance. The comparison between the performance measures at both the nodes is also done. Then we develop methods/techniques to understand the performance of the system when we have finite propagation delays between the nodes. We concentrate on the 3-node problem and calculate performance bounds based on linear programs. This is illustrated in detail for Bernoulli arrivals for the case of 1 slot propagation delay between the nodes as well as for the case of 2 slots propagation delay. The performance of the bounds obtained is also detailed. The presence of an idling system at the combined queue of Node 2 makes the bounds somewhat loose. Finally, we discuss the performance of the system with reference to the mean access delay and the standard deviation of the access delay under varying load on the system. Again, we rely on simulation studies. Finally, we study the performance of the system as a multiplexer. For this, we re­strict the traffic to Markov Modulated Processes (or those which would satisfy the Gartner-Ellis Theorem requirements). The traffic is characterized by what are known as Envelope Processes - Lower and Upper. The class of processes which satisfy the conditions of the Gartner-Ellis theorem come under the category where both the Envelope Processes exist and the Minimum Envelope Rate and the Maximum Lower Envelope Rate are the same. We use the system evolution equations at the combined queue at any node to develop re­lations between the various input and output processes. First, this is done for a. system of this kind, in isolation. Then, we consider this system as a part of the modified protocol and present relations, among the various input and output processes, which are specific to the modified protocol. The possible use of all of the above to do Admission Control at the entry point to the Asynchronous Transfer Mode (ATM) network is also presented.
APA, Harvard, Vancouver, ISO, and other styles
5

Gautam, S. Vijay. "Performance Analysis Of A Variation Of The Distributed Queueing Access Protocol." Thesis, Indian Institute of Science, 1995. http://hdl.handle.net/2005/149.

Full text
Abstract:
"A distributed queueing Medium Access Control (MAC) protocol is used in Distributed Queue Dual Bus (DQDB) networks. A modified version of the MAC protocol was proposed by R.R. Pillai and U. Mukherji in an attempt to overcome some of the shortcomings of the DQDB MAC protocol. They analyzed the performance of the system for Bernoulli arrivals and for large propagation delays between the nodes. We extend the performance analysis of the modified MAC protocol for a DQDB type of Network. The parameter of interest to us is the bus access delay. This has two components, viz., the request bus access delay and the data bu6 access delay. We use the model at the request point at node and present methods to evaluate the delay experienced in such a model. The model is an n-priority ./D/l queue with D vacations (non-preemptive priority) where n is the number of nodes sending requests on the request bus for transmission on the data bus. The methods presented help to evaluate the request bus access delay when the arrivals at each node are Markovian Arrival Processes (MAPs). The algorithms for evaluating the mean request bus access delay are based on matrix geometric techniques. Thus, one can use the algorithms developed in the literature to solve for the finite buffers case too. This model, for the request bus access delay, holds irrespective of the propagation delay between the nodes. We also evaluate the inter-departure time of class 1 customers and virtual customers in a 2-priority M/G/l system with G vacations (non-preemptive priority). In the case of Poisson arrivals at all the nodes, we would have a 2-priority M/D/l system with D vacations (non-preemptive priority). We thus evaluate the inter-arrival time of the free slots on the data bus as seen by Node 2. Note that this is independent of the number of active nodes in the network We then develop methods to evaluate the mean data bus access delay experienced by the customers at Node 2 in a three-node network with 2 nodes communicating with the third when the propagation delay between the nodes is large. We consider the case of finite Local Queue buffers at the two nodes. Using this assumption we arrive at process of arrivals to the Combined Queue and the process of free slots on the data bus to be Markov Modulated Bernoulli processes. The model at the combined queue at Node 2 then has a Quasi Birth-Death evolution. Thus, this system is solved by using the Ramaswami-Latouche algorithm. The stationary probabilities are then used to evaluate the mean data bus access delay experienced at Node 2. The finite buffer case of this system can be solved by G.Wi Stewart's algorithm. The method in modelling the system and the results are presented in detail for Poisson arrivals. The extension of this to more complex processes is also explained. We encounter in the analysis an explosion of the state-space of the system. We try to counter this by considering approximations to the process of free slots on the data bus. The approximations considered are on the basis of what are known as Idealized Aggregates. The performance of the approximation is also detailed. It works very well under low and moderate load but underestimates the mean delay under heavy load. Thereafter, we discuss the performance of the system with reference to the mean of the access delay and the standard deviation of the access delay under varying traffic at the two nodes. For this part we use simulation results to discuss the performance. The comparison between the performance measures at both the nodes is also done. Then we develop methods/techniques to understand the performance of the system when we have finite propagation delays between the nodes. We concentrate on the 3-node problem and calculate performance bounds based on linear programs. This is illustrated in detail for Bernoulli arrivals for the case of 1 slot propagation delay between the nodes as well as for the case of 2 slots propagation delay. The performance of the bounds obtained is also detailed. The presence of an idling system at the combined queue of Node 2 makes the bounds somewhat loose. Finally, we discuss the performance of the system with reference to the mean access delay and the standard deviation of the access delay under varying load on the system. Again, we rely on simulation studies. Finally, we study the performance of the system as a multiplexer. For this, we re­strict the traffic to Markov Modulated Processes (or those which would satisfy the Gartner-Ellis Theorem requirements). The traffic is characterized by what are known as Envelope Processes - Lower and Upper. The class of processes which satisfy the conditions of the Gartner-Ellis theorem come under the category where both the Envelope Processes exist and the Minimum Envelope Rate and the Maximum Lower Envelope Rate are the same. We use the system evolution equations at the combined queue at any node to develop re­lations between the various input and output processes. First, this is done for a. system of this kind, in isolation. Then, we consider this system as a part of the modified protocol and present relations, among the various input and output processes, which are specific to the modified protocol. The possible use of all of the above to do Admission Control at the entry point to the Asynchronous Transfer Mode (ATM) network is also presented.
APA, Harvard, Vancouver, ISO, and other styles
6

Horký, Miroslav. "Modely hromadné obsluhy." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232033.

Full text
Abstract:
The master’s thesis solves models of queueing systems, which use the property of Markov chains. The queueing system is a system, where the objects enter into this system in random moments and require the service. This thesis solves specifically such models of queueing systems, in which the intervals between the objects incomings and service time have exponential distribution. In the theoretical part of the master’s thesis I deal with the topics stochastic process, queueing theory, classification of models and description of the models having Markovian property. In the practical part I describe realization and function of the program, which solves simulation of chosen model M/M/m. At the end I compare results which were calculated in analytic way and by simulation of the model M/M/m.
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Xiaobai. "Stochastic models for MRI lesion count sequences from patients with relapsing remitting multiple sclerosis." Columbus, Ohio : Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1142907194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ramirez, Jose A. "Optimal and Simulation-Based Approximate Dynamic Programming Approaches for the Control of Re-Entrant Line Manufacturing Models." University of Cincinnati / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1282329260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tribastone, Mirco. "Scalable analysis of stochastic process algebra models." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4629.

Full text
Abstract:
The performance modelling of large-scale systems using discrete-state approaches is fundamentally hampered by the well-known problem of state-space explosion, which causes exponential growth of the reachable state space as a function of the number of the components which constitute the model. Because they are mapped onto continuous-time Markov chains (CTMCs), models described in the stochastic process algebra PEPA are no exception. This thesis presents a deterministic continuous-state semantics of PEPA which employs ordinary differential equations (ODEs) as the underlying mathematics for the performance evaluation. This is suitable for models consisting of large numbers of replicated components, as the ODE problem size is insensitive to the actual population levels of the system under study. Furthermore, the ODE is given an interpretation as the fluid limit of a properly defined CTMC model when the initial population levels go to infinity. This framework allows the use of existing results which give error bounds to assess the quality of the differential approximation. The computation of performance indices such as throughput, utilisation, and average response time are interpreted deterministically as functions of the ODE solution and are related to corresponding reward structures in the Markovian setting. The differential interpretation of PEPA provides a framework that is conceptually analogous to established approximation methods in queueing networks based on meanvalue analysis, as both approaches aim at reducing the computational cost of the analysis by providing estimates for the expected values of the performance metrics of interest. The relationship between these two techniques is examined in more detail in a comparison between PEPA and the Layered Queueing Network (LQN) model. General patterns of translation of LQN elements into corresponding PEPA components are applied to a substantial case study of a distributed computer system. This model is analysed using stochastic simulation to gauge the soundness of the translation. Furthermore, it is subjected to a series of numerical tests to compare execution runtimes and accuracy of the PEPA differential analysis against the LQN mean-value approximation method. Finally, this thesis discusses the major elements concerning the development of a software toolkit, the PEPA Eclipse Plug-in, which offers a comprehensive modelling environment for PEPA, including modules for static analysis, explicit state-space exploration, numerical solution of the steady-state equilibrium of the Markov chain, stochastic simulation, the differential analysis approach herein presented, and a graphical framework for model editing and visualisation of performance evaluation results.
APA, Harvard, Vancouver, ISO, and other styles
10

Majedi, Mohammad. "A Queueing Model to Study Ambulance Offload Delays." Thesis, 2008. http://hdl.handle.net/10012/4019.

Full text
Abstract:
The ambulance offload delay problem is a well-known result of overcrowding and congestion in emergency departments. Offload delay refers to the situation where area hospitals are unable to accept patients from regional ambulances in a timely manner due to lack of staff and bed capacity. The problem of offload delays is not a simple issue to resolve and has caused severe problems to the emergency medical services (EMS) providers, emergency department (ED) staff, and most importantly patients that are transferred to hospitals by ambulance. Except for several reports on the problem, not much research has been done on the subject. Almost all research to date has focused on either EMS or ED planning and operation and as far as we are aware there are no models which have considered the coordination of these units. We propose an analytical model which will allow us to analyze and explore the ambulance offload delay problem. We use queuing theory to construct a system representing the interaction of EMS and ED, and model the behavior of the system as a continuous time Markov chain. The matrix geometric method will be used to numerically compute various system performance measures under different conditions. We analyze the effect of adding more emergency beds in the ED, adding more ambulances, and reducing the ED patient length of stay, on various system performance measures such as the average number of ambulances in offload delay, average time in offload delay, and ambulance and bed utilization. We will show that adding more beds to the ED or reducing ED patient length of stay will have a positive impact on system performance and in particular will decrease the average number of ambulances experiencing offload delay and the average time in offload delay. Also, it will be shown that increasing the number of ambulances will have a negative impact on offload delays and increases the average number of ambulances in offload delay. However, other system performance measures are improved by adding more ambulances to the system. Finally, we will show the tradeoffs between adding more emergency beds, adding more ambulances, and reducing ED patient length of stay. We conclude that the hospital is the bottleneck in the system and in order to reduce ambulance offload delays, either hospital capacity has to be increased or ED patient length of stay is to be reduced.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Markov queueing model"

1

Percus, O. E. Queue length distributions in a Markov model of a multistage clocked queueing network. New York: Courant Institute of Mathematical Sciences, New York University, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Meyer, Carl D., and Robert J. Plemmons, eds. Linear Algebra, Markov Chains, and Queueing Models. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

D, Meyer C., and Plemmons Robert J, eds. Linear algebra, Markov chains, and queueing models. New York: Springer-Verlag, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Meyer, Carl D., and Robert J. Plemmons. Linear Algebra, Markov Chains, and Queueing Models. Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Carl D. Meyer Robert J. Plemmons. Linear Algebra, Markov Chains, and Queueing Models. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Markov queueing model"

1

Hong, S., H. G. Perros, and H. Yamashita. "Approximate Analysis of a Discrete-Time Queueing Model of the Shared Buffer ATM Switch." In Linear Algebra, Markov Chains, and Queueing Models, 211–29. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4613-8351-2_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Walrand, Jean. "Networks—B." In Probability in Electrical Engineering and Computer Science, 93–113. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49995-2_6.

Full text
Abstract:
AbstractThis chapter provides the derivations of the results in the previous chapter. It also develops the theory of continuous-time Markov chains.Section 6.1 proves the results on the spreading of rumors. Section 6.2 presents the theory of continuous-time Markov chains that are used to model queueing networks, among many other applications. That section explains the relationships between continuous-time and related discrete-time Markov chains. Sections 6.3 and 6.4 prove the results about product-form networks by using a time-reversal argument.
APA, Harvard, Vancouver, ISO, and other styles
3

Meena, Rakesh Kumar, and Pankaj Kumar. "Performance Analysis of Markov Retrial Queueing Model under Admission Control F-Policy." In Mathematical Modeling and Computation of Real-Time Problems, 65–78. First edition. | Boca Raton : CRC Press, 2021.: CRC Press, 2020. http://dx.doi.org/10.1201/9781003055037-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sharma, Reema, Navin Kumar, and T. Srinivas. "Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 91–103. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-73423-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kerobyan, K., R. Covington, R. Kerobyan, and K. Enakoutsa. "An Infinite-Server Queueing $$MMAP_k|G_k|\infty $$ Model in Semi-Markov Random Environment Subject to Catastrophes." In Information Technologies and Mathematical Modelling. Queueing Theory and Applications, 195–212. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97595-5_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kalashnikov, Vladimir V. "Markov Queueing Models." In Mathematical Methods in Queuing Theory, 261–95. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bhat, U. Narayan. "Extended Markov Models." In An Introduction to Queueing Theory, 115–39. Boston: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4725-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bhat, U. Narayan. "Imbedded Markov Chain Models." In An Introduction to Queueing Theory, 75–114. Boston: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4725-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bhat, U. Narayan. "Imbedded Markov Chain Models." In An Introduction to Queueing Theory, 85–125. Boston, MA: Birkhäuser Boston, 2015. http://dx.doi.org/10.1007/978-0-8176-8421-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kalashnikov, Vladimir V. "Discrete-Time Markov Queueing Models." In Mathematical Methods in Queuing Theory, 233–60. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-2197-4_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Markov queueing model"

1

Gangadhar, Nandyala D., and Govind R. Kadambi. "Complete Solution of a Markov Modulated Tandem Fluid Queueing Model of a Voice Network." In 2022 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT). IEEE, 2022. http://dx.doi.org/10.1109/conecct55679.2022.9865843.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Peng-Yong Kong. "A Markov chain model for packet queueing delay analysis of a mobile user in HetNets." In 2015 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2015. http://dx.doi.org/10.1109/wcnc.2015.7127773.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, R. P., G. Sutton, and I. B. Collings. "A 3-D Markov Chain Queueing Model of IEEE 802.11 DCF with Finite Buffer and Load." In ICC 2009 - 2009 IEEE International Conference on Communications. IEEE, 2009. http://dx.doi.org/10.1109/icc.2009.5198576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Morrison, James R., and P. R. Kumar. "Linear Programming Performance Bounds for Markov Chains With Polyhedrally Translation Invariant Probabilities and Applications to Unreliable Manufacturing Systems and Enhanced Wafer Fab Models." In ASME 2002 International Mechanical Engineering Congress and Exposition. ASMEDC, 2002. http://dx.doi.org/10.1115/imece2002-39274.

Full text
Abstract:
Our focus is on a class of Markov chains which have a polyhedral translation invariance property for the transition probabilities. This class can be used to model several applications of interest which feature complexities not found in usual models of queueing networks, for example failure prone manufacturing systems which are operating under hedging point policies, or enhanced wafer fab models featuring batch tools and setups or affine index policies. We present a new family of performance bounds which is more powerful both in expressive capability as well as the quality of the bounds than some earlier approaches.
APA, Harvard, Vancouver, ISO, and other styles
5

Boutoumi, Bachira, and Nawel Gharbi. "N-policy Priority Queueing Model for Energy and Delay Minimization in Wireless Sensor Networks Using Markov Chains." In 2023 International Conference on Advances in Electronics, Control and Communication Systems (ICAECCS). IEEE, 2023. http://dx.doi.org/10.1109/icaeccs56710.2023.10104978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Markov queueing model' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography