This paper presents a complete methodology for modeling gradings (also called non-full-availability groups) servicing single-service and multi-service traffic streams. The methodology worked out by the authors makes it possible to determine traffic characteristics of various types of gradings with state-dependent call arrival processes, including a new proposed structure of the Erlang’s Ideal Grading with the multirate links. The elaborated models of the gradings can be used for modeling different systems of modern networks, for example, the radio interfaces of the UMTS system, switching networks carrying a mixture of different multirate traffic streams, and video-on-demand systems. The results of the analytical calculations are compared with the results of the simulation data for selected gradings, which confirm high accuracy of the proposed methodology.

The paper proposes a formal derivation of recurrent equations describing the occupancy distribution in the full-availability group with multirate Binomial-Poisson-Pascal BPP traffic. The paper presents an effective algorithm for determining the occupancy distribution on the basis of derived recurrent equations and for the determination of the blocking probability as well as the loss probability of calls of particular classes of traffic offered to the system. A proof of the convergence of the iterative process of estimating the average number of busy traffic sources of particular classes is also given in the paper.

No abstract

No abstract

No abstract

No abstract

No abstract

No abstract