Queueing Theory for TelecommunicationsModer in učinkovit uvod v osnovne koncepte in študij čakanja v zvezi s telekomunikacijskimi sistemi. Modeli kvazi-rojstvo (ang. quasi-birth), model smrt (ang. death-model). |
Contents
Chapter | 1 |
General Concepts and Preliminaries | 23 |
Chapter 3 | 38 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
analysis arrival process arrival rate arriving customer birth-death process busy period c_rect class 2 customer continuous-time Markov chain customer arrives customers left data-link defined definition denote the number departing customer Determine discussion distributed with parameter eigenvalues example exceptional first service Exercise expected length exponentially distributed geometric distribution given idle period interarrival Laplace-Stieltjes transform layer Little's result M/G/1 queueing system M/G/1 system Markov chain matrix geometric memoryless Neuts node nonnegative null values null vector number of arrivals number of customers number of type obtain occupancy distribution one-step transition probability ordinary M/G/1 P₁ phase process Poisson arrivals Poisson process probability generating function probability vector queueing theory random variables renewal theory sequence server service rate service-time distribution sojourn solution solve statistical multiplexing stochastic equilibrium sub-busy period survivor function tagged customer techniques Theorem theta tomers transmission type 1 customers users waiting zero