The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 2330 of Mathematical Reviews Vol. , Issue 96d
[page]

1996
*
Mathematical Reviews
*

“Chapter 8 contains some topics on

*queueing*models described by*Markov**chains*. One of these is the well-known*method*of imbedded*Markov**chains*. ...*In*Chapter 9,*Markov*60 PROBABILITY*THEORY*AND STOCHASTIC PROCESSES 2330*queueing*models are examined with the help of continuous-time*Markov**chains*. ...##
###
Page 3561 of Mathematical Reviews Vol. , Issue 2000e
[page]

2000
*
Mathematical Reviews
*

The first five chapters of the book cover the basics of probability and statistics,

*Markov**chains*,*methods**for*deriving stationary distributions of*Markov**chains*, aggregation and disaggregation*methods*... ISBN 0-471-19366-6 This book discusses*Markov**chains*and*queueing*networks from the point of view of practitioners*in*the field of*computer*perfor- mance analysis. ...##
###
Page 2731 of Mathematical Reviews Vol. , Issue 91E
[page]

1991
*
Mathematical Reviews
*

An arrival

*occurs*from a par- ticular source if the*Markov**chain*corresponding to that source is*in*any state other than 0. ... Apart from the contribution to the*theory*of*Markov**chains*and*queues*, the model may be applicable to scheduling of*computer*and communication systems.” 91e:60281 60K25 90B22 Sakasegawa, Hirotaka (J-TSUKS-SO ...##
###
Idle and Busy Period Analysis of Two Class Data Traffic through Queueing Technique

2015
*
International Journal of Computer Applications
*

*In*this paper we use a

*queueing*

*theory*approach to model the system with two class data traffic.we develop and analyze the idle and busy period of two class data traffic through

*queueing*system using

*Markov*... We also develop the

*markov*

*chain*

*for*calculating the number of customers served during busy period. The length of busy period is also calculated through the construction of

*Markov*

*chain*. ...

*Computer*Networks and Systems

*Queueing*

*Theory*and Performance Evaluation. Springer Verlag, New York, 1994. ...

##
###
A Study of Petri Nets, Markov Chains and Queueing Theory as Mathematical Modelling Languages Aiming at the Simulation of Enterprise Application Integration Solutions: A First Step

2016
*
Procedia Computer Science
*

This paper reports on a study of Petri Nets,

doi:10.1016/j.procs.2016.09.147
fatcat:goqrpvwxnza2bgdfsl3dzz3eyu
*Markov**Chains*and*Queueing**Theory*, aiming to construct simulation models from conceptual models of integration solutions modeled with Guaraná. ... Guaraná technology provides a domain-specific language that allows*for*the design of conceptual models to represent integration solutions. ... First author is also thanks the UFFS University*for*the support to the development of his research. ...##
###
Page 1456 of Mathematical Reviews Vol. , Issue 81D
[page]

1981
*
Mathematical Reviews
*

S. 81d:60105
An autoregressive model

*for*multilag*Markov**chains*. J. Appl. Probab. 17 (1980), no. 2, 350-362. ... The*method*of solution, using imbedded*Markov**chains*, is also completely analogous to that usually applied to G]/ M/s [see L. Takacs, Acta Math. Acad. Sci. ...##
###
Markov modulated periodic arrival process offered to an ATM multiplexer

1995
*
Performance evaluation (Print)
*

We provide an analytical approach to solve

doi:10.1016/0166-5316(93)e0058-d
fatcat:or4qfndkzbcalncpdaeo5ykbse
*for*this*queueing*system via an approximation to the transient behavior of the nD/D/l*queue*. ... The solution to the*queue*length distribution is given*in*terms of a solution to a linear differential equation with variable coefficients. ... Matrix geometric*methods*[2] and spectral expansion techniques [6] are proposed*computational**methods*to solve*for**queueing*systems*for*which the input is an MMPP. ...##
###
Page 5048 of Mathematical Reviews Vol. , Issue 911
[page]

1991
*
Mathematical Reviews
*

The book is intended

*for*specialists*in*the application of*queueing**theory*and*for*developers of*computer*systems. ... A*Markov**chain*embedded*in*an M/GI/1*queue*with two classes of customers, changeover times, and instantaneous Bernoulli feed- back is presented. ...##
###
A bibliography on semi-Markov processes

1976
*
Journal of Computational and Applied Mathematics
*

*Methods*

*in*the

*Theory*of

*Queues*, Kalamazoo, Springer-Verlag, N.Y., 1-21. Moment formulas

*for*the

*Markov*renewal branching pro. cess. 1975a Purdue Mimeograph Series, nr. 434, Purdue University, U.S.A. ... A value iteration algorithm

*for*

*Markov*renewal program- ming. 1969a "

*Computing*

*Methods*

*in*Optimazation problems IF', Acade- mic Press, N.Y. MR : 41-6566, Zbl : 221-580. Flaspohler David C. ... Yadin Micha

*Queueing*with alternating priorities treated as a random walk on the lattice

*in*the plane. 1970a J. AppL Probability, 7, 196-218. ...

##
###
Computational uses of the method of phases in the theory of queues

1975
*
Computers and Mathematics with Applications
*

If the service times

doi:10.1016/0898-1221(75)90015-2
fatcat:5qy2xaiiwrfn7g3crkyo3y6gyy
*in*a discrete time*queue*have densities of phase type, several transient and stationary probability distributions of interest may be*computed*by highly efficient algorithms, which ... are presented*in*the paper. • This paper was prepared*for*presentation as an invited address to the joint ORSA -TIMS Meeting, San Juan , Puerto Rico, October 1974. ... ], P n + 1(i) = b(K -i)p;[Pn(O) + f3n+ l(l)](l min(K ,i-l ) + L Pv(Pn(i -v)T + f3n +l(i -V + l)a] v = 1 (27)*Computational*uses of the*method*of phases*in*the*theory*of*queues**for*2:-:; i < L i , min(K ...##
###
Page 4871 of Mathematical Reviews Vol. , Issue 99g
[page]

1999
*
Mathematical Reviews
*

*In*general, the performance measure

*for*the modified

*chains*can be efficiently

*computed*with the matrix-geometric ap- proach. ... Upper and lower bounds

*for*the performance measure are obtained by redirecting transitions

*in*the

*Markov*

*chain*to more (or less) attractive states. ...

##
###
Page 2893 of Mathematical Reviews Vol. , Issue 95e
[page]

1995
*
Mathematical Reviews
*

technology and operations research, and therefore the author begins with the fundamentals of probability

*theory*, the*theory*of*Markov**chains*and*queueing**theory*, and ends with new and nontrivial material ... The book is intended*for*applied mathematicians, undergraduate and graduate students.” Contents: Chapter 1. A brief survey; Chapter 2.*Markov**chains*; Chapter 3. Multiplicative networks; Chapter 4. ...##
###
Page 707 of Mathematical Reviews Vol. , Issue 84b
[page]

1984
*
Mathematical Reviews
*

This

*Markov**chain*is called a randomized*Markov*renewal process. ... Ergodic theorems are stated which are,*in*fact, special cases of results well known from the*Markov*renewal*theory*applied to ({a,,,€,,,{,,], n=0). ...##
###
Page 3577 of Mathematical Reviews Vol. , Issue 90F
[page]

1990
*
Mathematical Reviews
*

, uncoupling

*Markov**chains*, and the*theory*of nearly reducible systems. ... Applications of stochastic complemen- tation are explored with respect to problems involving uncoupling procedures*in*the*theory*of*Markov**chains*. ...##
###
Analytical and stochastic modelling techniques

2016
*
Annals of Operations Research
*

Analytical and stochastic modelling

doi:10.1007/s10479-016-2168-6
fatcat:dxo43alu5feazawbt45ttz3x64
*methods*are widely used*in*engineering to assess and design various technical and information systems, such as*computer*and communication networks, software systems, ... The ASMTA conference series is a main forum to discuss the latest developments*in*analytical, numerical, and simulation algorithms*for*stochastic systems, including Markovian processes,*queueing*networks ... Combining*queueing**theory*and game*theory*, Hayel, Quadri, Jiménez, and Brotcorne investigate last-mile delivery services*for*e-commerce*in*which consumers can choose between free delivery at a relay point ...
« Previous

*Showing results 1 — 15 out of 7,191 results*