Corporate Algorithm of Multiple Access in Cyberspace

Relevance. An integral component of cyberspace are access systems that ensure the distribution of cyberspace information and communication resources among users. The development and implementation of digital technologies requires making adjustments to the architecture and principles of functioning of access systems. At the same time, it should be borne in mind that the requirements imposed on them can be diverse, contradictory and determined by the specifics of the subject area. The purpose of the research is to propose a competitive algorithm for multiple access, the main idea of which is the rejection of the principle of adversarial load sources. The “corporativeness" of the algorithm is manifested in the use of the principle of “fair distribution” of a common resource, the transmission channel, so that all data from all sources of the load is collected and transmitted corporately without delay/loss. The main requirement for the functioning of a corporate multiple access system is to meet the general criterion of optimality. Such criteria can be: the weighted average proportion of data blocks received correctly and on time, or the weighted average delay time in transmitting data blocks, or the weighted average proportion of lost data blocks. Methods. The article outlines the concept of a corporate multiple access algorithm based on a combined method for dividing a common transmission channel: temporary separation is used between groups of load sources, and random synchronous access is used within each group. To implement the corporate access principle, a dynamic access control procedure is used. Results. A mathematical model of a corporate multiple access network and expressions for calculating the probabilistic-temporal characteristics of data block transmission have been developed. The optimization problem is formulated: choosing the optimal mode of operation of the access network, which provides for such a distribution of time windows between load sources that the extremum of the general optimality criterion is achieved. A three–stage algorithm for solving the optimization problem is proposed: stage 1 is the calculation of all possible values of the selected optimization criterion, for which the weighted average proportion of data blocks received correctly and on time is taken, stage 2 is the construction of a graphical model of the optimization problem, and stage 3 is the finding of the shortest path for the constructed graph, the set of edges that make up such a path will be solving the problem. The approbation of this algorithm is presented.The theoretical significance is the expansion in the formalization of the description of the architecture of cyberspace, the development of methods, technologies and mathematical models of multiple access in cyberspace, as well as in the calculated expressions obtained, algorithms for optimizing the functioning of systems that implement a corporate approach to multiple access.

cyberspace, access system, corporate multiple access algorithm, general optimality criterion