Relevant bibliographies by topics / Markovian Arrival Process

Contents

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

Academic literature on the topic 'Markovian Arrival Process'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 'Markovian Arrival Process.'

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 "Markovian Arrival Process"

1

HUNTER, JEFFREY J. "MARKOVIAN QUEUES WITH CORRELATED ARRIVAL PROCESSES." Asia-Pacific Journal of Operational Research 24, no. 04 (August 2007): 593–611. http://dx.doi.org/10.1142/s021759590700136x.

Full text
Abstract:
In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential inter-arrivals to the queueing system, are considered. Two of these models are based upon the upper and lower bounding joint distribution functions given by the Fréchet bounds for bivariate distributions with specified marginals, the third is based on Downton's bivariate exponential distribution and fourthly the u
APA, Harvard, Vancouver, ISO, and other styles
2

Cao, Jianyu, and Weixin Xie. "Joint arrival process of multiple independent batch Markovian arrival processes." Statistics & Probability Letters 133 (February 2018): 42–49. http://dx.doi.org/10.1016/j.spl.2017.09.012.

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

Pérez-Ocón, Rafael, and Maria del Carmen Segovia. "Shock models under a Markovian arrival process." Mathematical and Computer Modelling 50, no. 5-6 (September 2009): 879–84. http://dx.doi.org/10.1016/j.mcm.2008.12.020.

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

Neuts, Marcel F., LIU Dan, and NARAYANA Surya. "Local poissonification of the markovian arrival process." Communications in Statistics. Stochastic Models 8, no. 1 (January 1992): 87–129. http://dx.doi.org/10.1080/15326349208807216.

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

Asmussen, Søren, and Ger Koole. "Marked point processes as limits of Markovian arrival streams." Journal of Applied Probability 30, no. 2 (June 1993): 365–72. http://dx.doi.org/10.2307/3214845.

Full text
Abstract:
A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.
APA, Harvard, Vancouver, ISO, and other styles
6

Asmussen, Søren, and Ger Koole. "Marked point processes as limits of Markovian arrival streams." Journal of Applied Probability 30, no. 02 (June 1993): 365–72. http://dx.doi.org/10.1017/s0021900200117371.

Full text
Abstract:
A Markovian arrival stream is a marked point process generated by the state transitions of a given Markovian environmental process and Poisson arrival rates depending on the environment. It is shown that to a given marked point process there is a sequence of such Markovian arrival streams with the property that as m →∞. Various related corollaries (involving stationarity, convergence of moments and ergodicity) and counterexamples are discussed as well.
APA, Harvard, Vancouver, ISO, and other styles
7

Johnson, Mary A., and Surya Narayana. "Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process." Queueing Systems 23, no. 1-4 (March 1996): 107–30. http://dx.doi.org/10.1007/bf01206553.

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

Jin, Fang, Chengxun Wu, and Hui Ou. "Compound Binomial Model with Batch Markovian Arrival Process." Mathematical Problems in Engineering 2020 (November 28, 2020): 1–10. http://dx.doi.org/10.1155/2020/1932704.

Full text
Abstract:
A compound binomial model with batch Markovian arrival process was studied, and the specific definitions are introduced. We discussed the problem of ruin probabilities. Specially, the recursion formulas of the conditional finite-time ruin probability are obtained and the numerical algorithm of the conditional finite-time nonruin probability is proposed. We also discuss research on the compound binomial model with batch Markovian arrival process and threshold dividend. Recursion formulas of the Gerber–Shiu function and the first discounted dividend value are provided, and the expressions of the
APA, Harvard, Vancouver, ISO, and other styles
9

Ramírez-Cobo, Pepa, Rosa E. Lillo, and Michael P. Wiper. "Nonidentifiability of the Two-State Markovian Arrival Process." Journal of Applied Probability 47, no. 03 (September 2010): 630–49. http://dx.doi.org/10.1017/s0021900200006975.

Full text
Abstract:
In this paper we consider the problem of identifiability for the two-state Markovian arrival process (MAP2). In particular, we show that the MAP2 is not identifiable, providing the conditions under which two different sets of parameters induce identical stationary laws for the observable process.
APA, Harvard, Vancouver, ISO, and other styles
10

Ramírez-Cobo, Pepa, Rosa E. Lillo, and Michael P. Wiper. "Nonidentifiability of the Two-State Markovian Arrival Process." Journal of Applied Probability 47, no. 3 (September 2010): 630–49. http://dx.doi.org/10.1239/jap/1285335400.

Full text
Abstract:
In this paper we consider the problem of identifiability for the two-state Markovian arrival process (MAP2). In particular, we show that the MAP2 is not identifiable, providing the conditions under which two different sets of parameters induce identical stationary laws for the observable process.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Markovian Arrival Process"

1

Narayana, Surya 1962. "Some descriptors of the Markovian arrival process." Thesis, The University of Arizona, 1991. http://hdl.handle.net/10150/291729.

Full text
Abstract:
The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes which has been extensively used to model arrival (or service) processes in queues. This thesis mainly deals with the first two moment matrices of the counts for the MAP. We derive asymptotic expansions for these two moment matrices and also derive efficient and stable algorithms to compute these matrices numerically. Simpler expressions for some of the classical mathematical descriptors of the superposition of independent MAPs also are derived.
APA, Harvard, Vancouver, ISO, and other styles
2

Frigui, Imed. "Analysis of a time-limited polling system with Markovian arrival process and phase type service." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq23604.pdf.

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

Eum, Suyong, and suyong@ist osaka-u. ac jp. "Traffic Matrix Estimation in IP Networks." RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080215.155526.

Full text
Abstract:
An Origin-Destination (OD) traffic matrix provides a major input to the design, planning and management of a telecommunications network. Since the Internet is being proposed as the principal delivery mechanism for telecommunications traffic at the present time, and this network is not owned or managed by a single entity, there are significant challenges for network planners and managers needing to determine equipment and topology configurations for the various sections of the Internet that are currently the responsibility of ISPs and traditional telcos. Planning of these sub-networks typically
APA, Harvard, Vancouver, ISO, and other styles
4

Baey, Sébastien. "Contribution à la qualité de service d'une pile radio flexible pour la transmission de données multimédia en mode paquet sur interface radio UMTS WCDMA." Paris 11, 2004. http://www.theses.fr/2004PA112111.

Full text
Abstract:
Cette thèse traite de l'intégration du trafic multimédia sur la voie montante de l'interface radio de l'UMTS. Le problème est abordé dans sa globalité, considérant à la fois les possibilités de partage de la ressource, une bonne caractérisation du trafic à transmettre et les possibilités ouvertes dans la norme UMTS. L'attention est plus particulièrement portée sur la vidéo MPEG4 et les données de type Internet. La première partie de la thèse dégage une approche du partage de ressource radio en mode WCDMA. Les performances du mécanisme de multiplexage de niveau couche physique avec qualité de t
APA, Harvard, Vancouver, ISO, and other styles
5

Klemm, Alexander, Christoph Lindemann, and Marco Lohmann. "Modeling IP traffic using the batch Markovian arrival process." 2003. https://ul.qucosa.de/id/qucosa%3A32407.

Full text
Abstract:
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation of Poisson jump probabilities. Moreover, we identify the BMAP as an analytically tractable model of choice for aggregated traffic modeling of IP networks. The key idea of this aggregated traffic model lies in customizing the BMAP such that diffe
APA, Harvard, Vancouver, ISO, and other styles
6

Frigui, Imed. "Analysis of a tim -limited polling system with Markovian arrival process and phase type service." 1997. http://hdl.handle.net/1993/787.

Full text
Abstract:
Polling systems have been the subject of many studies and are of interest in the analysis of communication systems, operating systems scheduler, traffic intersections, and manufacturing systems. For communication and operating systems, the time-limited service discipline is very important since it allows one to limit the time the server is away from a particular queue. Nevertheless, it has received little attention, whereas, the exhaustive and gated service discipline have been studied extensively. In addition, most of the available results ignore correlation between arrivals. In this thesis,
APA, Harvard, Vancouver, ISO, and other styles
7

Li, W., Demetres D. Kouvatsos, and Rod J. Fretwell. "On the Analytic Assessment of the Impact of Traffic Correlation on Queues in Continuous Time Domain." 2016. http://hdl.handle.net/10454/11031.

Full text
Abstract:
No<br>Given only the traffic correlations of counts and intervals, a Batch Renewal Arrival Process (BRAP) is completely determined, as the least biased choice and thus, it provides the analytic means to construct suitable traffic models for the study of queueing systems independently of any other traffic characteristics. In this context, the BRAP and the Batch Markovian Arrival Process (BMAP) are employed in the continuous time domain towards the analysis of the stable BRAP/GE/1 and BMAP/GE/1 queues with infinite capacity, single servers and generalized exponential (GE) service times. Novel cl
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Markovian Arrival Process"

1

Gass, Saul I., and Carl M. Harris. "Markovian arrival process (Map)." In Encyclopedia of Operations Research and Management Science, 486. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_581.

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

He, Qi-Ming. "From the Poisson Process to Markovian Arrival Processes." In Fundamentals of Matrix-Analytic Methods, 85–154. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7330-5_2.

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

Moiseev, Alexander, and Anatoly Nazarov. "Tandem of Infinite-Server Queues with Markovian Arrival Process." In Communications in Computer and Information Science, 323–33. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30843-2_34.

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

Klemm, Alexander, Christoph Lindemann, and Marco Lohmann. "Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process." In Computer Performance Evaluation: Modelling Techniques and Tools, 92–110. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46029-2_6.

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

Klimenok, Valentina. "Two-Server Queueing System with Unreliable Servers and Markovian Arrival Process." In Information Technologies and Mathematical Modelling. Queueing Theory and Applications, 42–55. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68069-9_4.

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

Mei, Liu, and Alexander Dudin. "Analysis of Retrial Queue with Heterogeneous Servers and Markovian Arrival Process." In Infosys Science Foundation Series, 29–49. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5951-8_3.

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

Claeys, Dieter, Joris Walraevens, Koenraad Laevens, Bart Steyaert, and Herwig Bruneel. "A Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process." In Analytical and Stochastic Modeling Techniques and Applications, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13568-2_1.

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

Klimenok, Valentina, and Alexander Dudin. "Algorithmic Analysis of Dual Tandem Queue with Batch Markovian Arrival Process and Repeated Attempts at the First Station." In Communications in Computer and Information Science, 190–203. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-14228-9_17.

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

Breuer, Lothar. "Spatial Markovian Arrival Processes." In From Markov Jump Processes to Spatial Queues, 91–105. Dordrecht: Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-010-0239-4_7.

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

Breuer, Lothar. "Examples of Markovian Arrival Processes." In From Markov Jump Processes to Spatial Queues, 43–51. Dordrecht: Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-010-0239-4_3.

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

Conference papers on the topic "Markovian Arrival Process"

1

Fang, Jin, and Mo Xiaoyun. "Dynamic Multi-Mode Portfolio Optimization Strategy for Markovian Arrival Process." In 2017 International Conference on Robots & Intelligent System (ICRIS). IEEE, 2017. http://dx.doi.org/10.1109/icris.2017.42.

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

Grigoreva, Elena, Maximilian Laurer, Mikhail Vilgelm, Thomas Gehrsitz, and Wolfgang Kellerer. "Coupled Markovian Arrival Process for Automotive Machine Type Communication traffic modeling." In ICC 2017 - 2017 IEEE International Conference on Communications. IEEE, 2017. http://dx.doi.org/10.1109/icc.2017.7996498.

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

Okamura, Hiroyuki, Junjun Zheng, and Tadashi Dohi. "Formulation of Opportunity-Based Age Replacement Models with Markovian Arrival Process." In 2020 Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modeling (APARM). IEEE, 2020. http://dx.doi.org/10.1109/aparm49247.2020.9209344.

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

Arivudainambi, D., and P. Godhandaraman. "Analysis of a single server batch Markovian arrival process with feedback." In 2011 3rd International Conference on Electronics Computer Technology (ICECT). IEEE, 2011. http://dx.doi.org/10.1109/icectech.2011.5942072.

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

Okamura, Hiroyuki, Hidenari Kishikawa, and Tadashi Dohi. "Application of Deterministic Annealing EM Algorithm to Markovian Arrival Process Parameter Estimation." In Trusted Computing (UIC/ATC). IEEE, 2010. http://dx.doi.org/10.1109/uic-atc.2010.61.

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

Bouchti, Abdelali El, and Abdelkrim Haqiq. "Quality of Service analysis of control access scheme of multimedia traffic in HSDPA channel using Markovian Arrival Process and stochastic reward Nets." In 2012 Second International Conference on Innovative Computing Technology (INTECH). IEEE, 2012. http://dx.doi.org/10.1109/intech.2012.6457819.

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

Chydzinski, Andrzej. "Packet Loss Process in a Queue with Markovian Arrivals." In 2008 Seventh International Conference on Networking ICN. IEEE, 2008. http://dx.doi.org/10.1109/icn.2008.104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Markovian Arrival Process' for particular source types:
Journal articles
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