On Two Queuing Systems with «Transparent» Calls Applying to the Multicast Network Analysis

Abstract

Two multicast service models with different users behavior are considered. We present corresponding mathematical models as queuing systems M|G|1|0|T with arbitrary distributed service times and transparent (T) calls. Calculation formulas for stationary probabilities of service customers and other characteristics are obtained.