Elements of Queueing Theory: With ApplicationsStructure, Technique, and basic theory. Poisson queues. Non-Poisson queues. Queueing ramifications, applications, and renewal theory. |
From inside the book
Results 1-3 of 82
Page 11
... Service Procedures or Discipline . While in line customers may be chosen for service by allocation to the channels ... channel that is able to provide service to a waiting unit becomes free , the unit immedi- ately enters service without ...
... Service Procedures or Discipline . While in line customers may be chosen for service by allocation to the channels ... channel that is able to provide service to a waiting unit becomes free , the unit immedi- ately enters service without ...
Page 256
... service as a necessary and sufficient condition for the independence of the interdeparture intervals and the ... channel . Assuming Poisson input , exponential service times , no leaving of the system until all channels are entered ...
... service as a necessary and sufficient condition for the independence of the interdeparture intervals and the ... channel . Assuming Poisson input , exponential service times , no leaving of the system until all channels are entered ...
Page 290
... channels have a subset c1 , which can provide a special type of service . Arriving units require either special service at the c1 channels or general service at any of the c channels . The discipline is first - come - first- served ...
... channels have a subset c1 , which can provide a special type of service . Arriving units require either special service at the c1 channels or general service at any of the c channels . The discipline is first - come - first- served ...
Contents
A Description of Queues | 3 |
Poisson Queues | 81 |
NonPoisson Queues | 151 |
Copyright | |
4 other sections not shown
Other editions - View all
Common terms and phrases
a₁ aircraft applied arrival occurs assume average number average waiting birth-death busy period calls Chap coefficient compute congestion constant customers delay denote derivative determined equilibrium Erlang's Erlangian example expected number exponential distribution exponential service expression finite given hence independent infinite integral interval jth phase Laplace transform Laplace-Stieltjes transform machines Markoff chain matrix mean moment-generating function multiplied n₁ n₂ Note number of channels number waiting obtained Operations Research p₁ P₁(t parameter Pn(t Po(t Poisson distribution Poisson input Poisson process priority Prob probability distribution queue length queueing problems queueing theory random variables renewal renewal theory result Rouché's theorem served service channel service distribution service rate service-time distribution single-channel queue solution solving Statist steady stochastic process studied theorem tion traffic values variance waiting line waiting-time distribution zero αι λε λι μ₁ Ро