Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints

Sunil Kumar, R. Srikant, P. R. Kumar

Research output: Contribution to journalArticlepeer-review


We propose a new technique for upper and lower bounding of the throughput and blocking probabilities in queueing networks with buffer capacity constraints, i.e., some buffers in the network have finite capacity. By studying the evolution of multinomials of the state of the system in its assumed steady state, we obtain constraints on the possible behavior of the system. Using these constraints, we obtain linear programs whose values upper and lower bound the performance measures of interest, namely throughputs or blocking probabilities. The main advantages of this new technique are that the computational complexity does not increase with the size of the finite buffers and that the technique is applicable to systems in which some buffers have infinite capacity. The technique is demonstrated on examples taken from both manufacturing systems and communication networks. As a special case, for the M/M/s/s queue, we establish the asymptotic exactness of the bounds, i.e., that the bounds on the blocking probability asymptotically approach the exact value as the degree of the multinomials considered is increased to infinity.

Original languageEnglish (US)
Pages (from-to)55-77
Number of pages23
JournalQueueing Systems
Issue number1-3
StatePublished - May 1998


  • Blocking
  • Communication networks
  • Finite buffers
  • Performance evaluation
  • Queueing networks

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics


Dive into the research topics of 'Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints'. Together they form a unique fingerprint.

Cite this