The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions

The computation algorithm of capacity indices of the telecommunication networks with repeated transmissions

0.00 Avg rating0 Votes
Article ID: iaor20123712
Volume: 73
Issue: 4
Start Page Number: 677
End Page Number: 688
Publication Date: Apr 2012
Journal: Automation and Remote Control
Authors:
Keywords: networks, queues: applications
Abstract:

The results are presented of the investigation of an approximate method for the calculation of characteristics of the telecommunication network of commutation of packages with a bounded buffer storage of nodes and retrials of transmissions of packages from sources and transit nodes. As a model of the telecommunication network use is made of the queuing network (QN) represented by an aggregate of isolated queuing systems (QS’s) with bounded accumulators and retrials of transmissions. The algorithm is suggested for the verification of realizability of primary input flows (delivery of all incoming packages to the appropriate finite nodes in the finite time) and the computation of blocking probabilities of nodes, the load of transmission links, mean values of the number of packages, and the dwell time of packages in the network operating in the stationary mode.

Reviews

Required fields are marked *. Your email address will not be published.