Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Brian Fralix"'
Publikováno v:
Stochastic Systems, Vol 6, Iss 2, Pp 420-458 (2016)
A variety of problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes with transiti
Externí odkaz:
https://doaj.org/article/93885b57ce3c451da9fef973f0ce8ec1
Autor:
Kayla Javier, Brian Fralix
Publikováno v:
Journal of Applied Probability. 60:14-29
We present a study of the joint distribution of both the state of a level-dependent quasi-birth–death (QBD) process and its associated running maximum level, at a fixed time t: more specifically, we derive expressions for the Laplace transforms of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef175e58ce1440328a459374f9e0f11e
https://doi.org/10.1017/jpr.2022.22
https://doi.org/10.1017/jpr.2022.22
Publikováno v:
Journal of Mathematical Biology. 86
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f468af2e550e95057350a1a47629691
https://doi.org/10.1007/s00285-023-01913-9
https://doi.org/10.1007/s00285-023-01913-9
Autor:
Brian Fralix
Publikováno v:
Queueing Systems. 100:193-195
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce81938f76dd6eba881d3fee4d152065
https://doi.org/10.1007/s11134-022-09765-8
https://doi.org/10.1007/s11134-022-09765-8
Autor:
Brian Fralix, Kayla Javier
Publikováno v:
Stochastic Models. 36:223-250
We consider two different continuous-time Markov chain models recently studied in Gobel et al.[8], which were created to model the interactions between a small pool of miners, and a larger collecti...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b430e3dc5b7c35d20ee7325d3dea9e79
https://doi.org/10.1080/15326349.2020.1761390
https://doi.org/10.1080/15326349.2020.1761390
Autor:
Brian Fralix
Publikováno v:
Queueing Systems. 95:29-52
We analyze the time-dependent behavior of various types of infinite-server queueing systems, where, within each system we consider, jobs interact with one another in ways that induce batch departures from the system. One example of such a queue was i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f977d5e0ec8a5349067456e87de4afc4
https://doi.org/10.1007/s11134-019-09643-w
https://doi.org/10.1007/s11134-019-09643-w
Autor:
Brian Fralix, Xiaoyuan Liu
Publikováno v:
Methodology and Computing in Applied Probability. 21:1119-1149
We explain how lattice-path counting techniques can be used in conjunction with the random-product representations from Buckingham and Fralix (Markov Process Related Field 21:339–368 2015) to study both the stationary and time-dependent behavior of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a63f61af1d58c2dc28cb4ec46dbe9fb0
https://doi.org/10.1007/s11009-018-9658-8
https://doi.org/10.1007/s11009-018-9658-8
Autor:
Brian Fralix
Publikováno v:
Probability in the Engineering and Informational Sciences. 33:367-386
We use the random-product technique from [5] to study both the steady-state and time-dependent behavior of a Markovian reentrant-line model, which is a generalization of the preemptive reentrant-line model studied in the work of Adan and Weiss [2]. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c546ed2f609fdb8c3e338f0bd14a327
https://doi.org/10.1017/s0269964818000268
https://doi.org/10.1017/s0269964818000268
Autor:
Brian Fralix
Publikováno v:
Mathematical Methods of Operations Research. 88:339-367
We analyze a Markovian smart polling model, which is a special case of the smart polling models studied in the work of Boon et al. (Queueing Syst 66:239–274, 2010), as well as a generalization of the gated M / M / 1 queue considered in Resing and R
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d17851e1a2a3f385e440dc4a2f9ba24
https://doi.org/10.1007/s00186-018-0638-0
https://doi.org/10.1007/s00186-018-0638-0
Autor:
Brian Fralix, Jori Selen
Publikováno v:
Queueing Systems, 87(3-4), 379-415. Springer
We analyze the time-dependent behavior of an $M/M/c$ priority queue having two customer classes, class-dependent service rates, and preemptive priority between classes. More particularly, we develop a method that determines the Laplace transforms of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0374aa940dd45ecee269dcb30c2f0845
https://research.tue.nl/en/publications/f4aa365e-efcb-44ed-ba1d-eafc1fb46869
https://research.tue.nl/en/publications/f4aa365e-efcb-44ed-ba1d-eafc1fb46869