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 (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 (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 HM
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 (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 (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 (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 (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 (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 (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

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
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 t
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 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 de
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 de
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
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 p
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 rese
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Markov queueing model"

1

Percus, O. E. Queue length distributions in a Markov model of a multistage clocked queueing network. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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. 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 so
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
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