Index
- absorbing state
- accessible states
- adjusted service rates
- almost surely convergence
- aperiodic
- approximate probability of delay
- arrivals
- batch arrival analysis
- batch arrival model
- (k, K)-batch policy
- bulk arrival
- effective arrival rate
- Markovian
- Markovian arrival process (MAP)
- negative arrival probability
- Poisson
- process
- types of arrivals
- artificial start-up service policy
- augmentation method
- automatic teller machine (ATM)
- auxiliary equation method
- average network delay,
- 301
- balance equations
- balking
- ballot theorem
- basic ballot problem
- batch arrivals
- (k, K)-batch policy
- batch service
- Bayes' formula/theorem
- BCD I
- Bernoulli feedback and splitting
- Bernoulli probability distribution
- Bernoulli schedule
- Bernoulli trail
- Bertrand's Ballot theorem
- Bessel function
- biased coin design (BCD)
- bilateral Laplace transform
- bilevel service delay discipline
- binomial coefficients
- binomial distribution
- Binomial Theorem
- birth and death (B–D) processes/chain
- definition
- dual process
- finite B-D process
- pure birth process
- pure death process
- bivariate Markov process
- Borel, É.
- Borel set
- branching process
- breakdown process
- number of vacations
- service loss probability
- service process
- SMTP and mail system
- starting failure repair process
- system characteristics
- TCP connection
- bulk arrival retrial queue, unreliable server
- bulk/batch arrival
- bulk queuing system
- bilevel service delay discipline
- model analysis
- under N-policy
- Burke's Theorem
- busy period
- density and distribution functions
- expected ...
Get Delayed and Network Queues now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.