Abstract:
The article considers an extensive class of queueing systems with repeated calls that incorporate non-full-access arrangements, various communications networks, and so forth. For systems of this type, general asymptotic formulas are obtained for the fundamental probability characteristics under low system load, and a number of general qualitative properties of the servicing process are established.