Knowledge

Category:Queueing theory

Source đź“ť

221: 558: 404: 80: 47: 100: 470: 582: 260: 587: 577: 145: 121: 438: 524: 409: 299: 67: 287: 592: 389: 546: 497: 357: 187: 536: 394: 209: 485: 453: 377: 352: 172: 512: 197: 162: 399: 475: 226: 192: 541: 448: 340: 362: 167: 367: 323: 238: 150: 133: 22: 17: 182: 502: 443: 243: 571: 507: 480: 433: 335: 248: 421: 372: 177: 104: 71: 51: 458: 311: 270: 265: 84: 282: 35:
This category has the following 4 subcategories, out of 4 total.
120:
The following 58 pages are in this category, out of 58 total.
8: 122:This list may not reflect recent changes 222:Decomposition method (queueing theory) 7: 559:Uniformization (probability theory) 117:Pages in category "Queueing theory" 126: 37: 29: 14: 405:Method of supplementary variables 1: 261:Flow-equivalent server method 146:Adversarial queueing network 525:Spectral expansion solution 410:Micro-bursting (networking) 300:Heavy traffic approximation 609: 16:The main article for this 15: 471:Quasi-birth–death process 390:Markovian arrival process 547:Traffic generation model 498:Rational arrival process 358:Layered queueing network 81:Queueing theory journals 537:Teletraffic engineering 439:Palm–Khintchine theorem 395:Matrix geometric method 210:Cumulative flow diagram 173:Bartlett's theorem 48:Poisson point processes 513:Ross's conjecture 198:Buzen's algorithm 486:Queuing Rule of Thumb 454:Product-form solution 378:Lyapunov optimization 353:Ladder height process 288:Gordon–Newell theorem 101:Single queueing nodes 583:Stochastic processes 193:Burke's theorem 163:Backpressure routing 588:Network performance 578:Operations research 400:Mean value analysis 188:Birth–death process 476:Quasireversibility 341:Kelly's lemma 227:Drift plus penalty 68:Queueing theorists 542:Traffic equations 449:Processor sharing 368:Little's law 600: 593:Queue management 363:Lindley equation 168:Balance equation 106: 86: 73: 53: 608: 607: 603: 602: 601: 599: 598: 597: 568: 567: 566: 565: 564: 563: 551: 529: 517: 490: 463: 426: 414: 382: 345: 328: 324:Jackson network 316: 304: 292: 275: 253: 239:Ehrenfest model 231: 214: 202: 155: 151:Arrival theorem 138: 134:Queueing theory 114: 113: 112: 111: 108: 107: 91: 88: 87: 75: 74: 58: 55: 54: 28: 27: 23:Queueing theory 12: 11: 5: 606: 604: 596: 595: 590: 585: 580: 570: 569: 562: 561: 555: 552: 550: 549: 544: 539: 533: 530: 528: 527: 521: 518: 516: 515: 510: 505: 503:Residence time 500: 494: 491: 489: 488: 483: 478: 473: 467: 464: 462: 461: 456: 451: 446: 444:Polling system 441: 436: 430: 427: 425: 424: 418: 415: 413: 412: 407: 402: 397: 392: 386: 383: 381: 380: 375: 370: 365: 360: 355: 349: 346: 344: 343: 338: 332: 329: 327: 326: 320: 317: 315: 314: 308: 305: 303: 302: 296: 293: 291: 290: 285: 279: 276: 274: 273: 268: 263: 257: 254: 252: 251: 246: 244:Engset formula 241: 235: 232: 230: 229: 224: 218: 215: 213: 212: 206: 203: 201: 200: 195: 190: 185: 180: 175: 170: 165: 159: 156: 154: 153: 148: 142: 139: 137: 136: 130: 128: 127: 118: 115: 110: 109: 99: 98: 95: 92: 90: 89: 79: 78: 76: 66: 65: 62: 59: 57: 56: 46: 45: 42: 39: 38: 33: 30: 13: 10: 9: 6: 4: 3: 2: 605: 594: 591: 589: 586: 584: 581: 579: 576: 575: 573: 560: 557: 556: 553: 548: 545: 543: 540: 538: 535: 534: 531: 526: 523: 522: 519: 514: 511: 509: 508:Retrial queue 506: 504: 501: 499: 496: 495: 492: 487: 484: 482: 481:Queuing delay 479: 477: 474: 472: 469: 468: 465: 460: 457: 455: 452: 450: 447: 445: 442: 440: 437: 435: 434:Palm calculus 432: 431: 428: 423: 420: 419: 416: 411: 408: 406: 403: 401: 398: 396: 393: 391: 388: 387: 384: 379: 376: 374: 371: 369: 366: 364: 361: 359: 356: 354: 351: 350: 347: 342: 339: 337: 336:Kelly network 334: 333: 330: 325: 322: 321: 318: 313: 310: 309: 306: 301: 298: 297: 294: 289: 286: 284: 281: 280: 277: 272: 269: 267: 264: 262: 259: 258: 255: 250: 249:Erlang (unit) 247: 245: 242: 240: 237: 236: 233: 228: 225: 223: 220: 219: 216: 211: 208: 207: 204: 199: 196: 194: 191: 189: 186: 184: 181: 179: 176: 174: 171: 169: 166: 164: 161: 160: 157: 152: 149: 147: 144: 143: 140: 135: 132: 131: 129: 125: 123: 116: 102: 97: 96: 93: 82: 77: 69: 64: 63: 60: 49: 44: 43: 40: 36: 32:Subcategories 31: 25: 24: 19: 422:Offered load 373:Loss network 183:Beneš method 178:BCMP network 119: 34: 21: 459:Punctuality 312:Input queue 271:Fluid queue 266:Fluid limit 572:Categories 283:G-network 18:category 105:(17 P) 72:(31 P) 52:(17 P) 85:(1 P) 20:is 574:: 124:. 103:‎ 83:‎ 70:‎ 50:‎ 554:U 532:T 520:S 493:R 466:Q 429:P 417:O 385:M 348:L 331:K 319:J 307:I 295:H 278:G 256:F 234:E 217:D 205:C 158:B 141:A 94:S 61:Q 41:P 26:.

Index

category
Queueing theory
Poisson point processes
Queueing theorists
Queueing theory journals
Single queueing nodes
This list may not reflect recent changes
Queueing theory
Adversarial queueing network
Arrival theorem
Backpressure routing
Balance equation
Bartlett's theorem
BCMP network
Beneš method
Birth–death process
Burke's theorem
Buzen's algorithm
Cumulative flow diagram
Decomposition method (queueing theory)
Drift plus penalty
Ehrenfest model
Engset formula
Erlang (unit)
Flow-equivalent server method
Fluid limit
Fluid queue
G-network
Gordon–Newell theorem
Heavy traffic approximation

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑