Stochastically recursive sequences and their application to service system theory

Abstract

Stochastically recursive sequences, service systems with the queue and random multiply access are considered in the paper aiming at the condition investigation of the ergodicity and stability of general stochastically recursive sequences and service nets. As a result new criteria of the capling - and strongcapling - convergences of stochastically recursive sequences have been obtainedas well as new criteria of the ergodicity and stability for service nets of Jackson's type and their generalizations. The coincidence of carrying capacity levels of random multiply access systems for centralized and decentralized algorithms from various classes has been proved. The paper results may find their field of application in ergodic theory of random processes, service system theory, in Russian Academy of Sciences Mathematical Institute, Siberian Department Mathematics Institute, Moscow State University, Novosibirsk SU, etcAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio

Similar works

Full text

thumbnail-image

OpenGrey Repository

redirect
Last time updated on 14/06/2016

This paper was published in OpenGrey Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.