Queueing Modelling Fundamentals || Index

✍ Scribed by Ng, Chee-Hock; Soong, Boon-Hee

• Publisher: John Wiley & Sons, Ltd
• Year: 2008
• Tongue: English
• Weight: 116 KB
• Edition: 2
• Category: Article
• ISBN: 0470519576
• DOI: 10.1002/9780470994672.index

✦ Synopsis

page numbers in italics refer to fi gures and diagrams ABR (available bit rate) 246, 257 arrival curve 239-40 arrival process, Markov-modulated 217-42 arriving population, size of 45 asynchronous transfer mode see ATM ATM (Asynchronous Transfer Mode) networks 135, 217, 257 applications of fl uid fl ow model to 236 service categories of traffi c 245-6 available bit rate see ABR average value 13 axiom of probability 9 balance equations 190-3 Bayes' formula 6 Bernoulli random variable 10 Bernoulli trial 10, 59-60 sample sequence 75 binomial distribution 25, 59-60 binomial random variable 10, 14 birth-death processes 96-100 transition diagram 96 blocked-calls telephone system 135 blocking probability 119-20, 119 Boudec, Jean-Yves 218 broadband integrated services networks 217 Burke's theorem 176-8 Buzen's algorithm (convolution) 253 CAC (connection admission control) 244 Cauchy random variable 15 CBR (constant bit rate) 244, 245 Central limit theorem 22 central server system 213 Chapman-Kolmogorov forward equations 80 circuit-switching data networks 170 closed network, typical 255 closed queueing networks 51, 169, 171, 197-215 applications of 213-14 examples 171, 201 Jackson closed queueing networks 197-9 performance measures 207-10 closed serial network 206 conditional probability 5 and independence 5-7 congestion control 243-57 connection admission control see CAC constant bit rate see CBR continuous random variable 8, 12 continuous-state process 72 continuous time Markov chains 91-5 continuous (time) -parameter process 73