Queues and Point Processes |
Contents
Random marked point processes and processes with an embedded | 13 |
3 | 29 |
1 | 32 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
analogously arbitrary arrival instants arriving customer assume basic points behaviour bution condition construction points continuity theorems convergence Corollary corresponding customer-stationary defined departure instants distri embedded empty points equation system ergodic theorem exists finite finite-dimensional distributions formula FRANKEN Furthermore given holds individual ergodic theorem inequality insensitivity property instants of customers intensity interarrival lemma load loss system mapping mark space marked point process mean value mean value theorem number of customers obtain P₁ P₂ Palm distribution PMP's Poisson process possess the property priority queues probability probability space proof of theorem proved queueing discipline FCFS queueing process queueing system queueing theory random variable relationship Remark respectively RMPP Ø RMPP's satisfying sect semi-Markov processes server single-server queues statement stationary distribution stationary point stationary process stationary RMPP stationary sequence stochastic STOYAN time-stationary valid virtual waiting
References to this book
Comparison Methods for Stochastic Models and Risks Alfred Müller,Dietrich Stoyan No preview available - 2002 |