Queuing Networks for “Transparent” Calls

  • Authors:
  • V. V. Rykov

  • Affiliations:
  • Gubkin Russian State University of Oil and Gas, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consideration was given to the model of a queuing network for “transparent” calls with arbitrarily distributed service times. Its operation was described and studied in terms of the multidimensional alternating process and a method for its Markovization. The stationary probability distribution of this process was shown to be representable in the multiplicative form. Calculational formulas for stationary probabilities of network resource blockings were obtained.