Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks

László Ast, Tibor Cinkler, Gábor Fodor, Sándor Rácz, Søren Blaabjerg

Research output: Contribution to journalArticle

2 Citations (Scopus)


For the end-to-end (Originator-Destination pair) call blocking probability computation in multirate loss networks the so-called reduced load approximation under link independence assumption is often used, because it allows the derivation of analytical and numerical results. Its accuracy and extendibility to multirouting or multicasting networks (like the B-ISDN), however, is seldom studied. This paper attempts to generalize this assumption and to assess the usefulness of this generalization by comparing simulation and approximation results on link, route, and end-to-end blocking probability evaluation for these kinds of networks. The accuracy of the approximation is examined by a simulation tool called Flexible Simulation Platform for ATM Networks. An important application example of this generalized link-, route- and Originator-Destination pair blocking measure is the formulation of an optimization model for multirate loss networks, which optimizes carried traffic and network revenue.

Original languageEnglish
Pages (from-to)56-65
Number of pages10
Issue number1
Publication statusPublished - Jan 1 1997


  • Blocking probability
  • Multiservice networks
  • Resource management
  • Revenue optimization

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks'. Together they form a unique fingerprint.

  • Cite this