Affordable Access

A dynamical communication system on a network

Journal of Computational and Applied Mathematics
DOI: 10.1016/
  • Mathematical Theory
  • Dynamical System
  • Communication
  • Markov Chains
  • Synchronization Of Parallel Computing Processes
  • Mathematics


Abstract A dynamical system is introduced and investigated. The system contains N vertices. The vertices send messages at discrete time instants according to a given rule. A conflict of two vertices takes place if the vertices try to send messages to each other at the same instant. Each vertex sends a message to another vertex at every step if no conflict takes place. In case of a conflict, only one of the two competing vertices sends a message. Deterministic and stochastic conflict resolution rules are considered. We investigate the average number of messages sent by a vertex per a time unit, called the productivity of this vertex, the total productivity of the system and other characteristics. The productivity of vertices depends on the initial state of the system, and the criterion of efficiency is the expected average productivity of vertices provided all possible initial states of the system are equiprobable. An ergodic version of the system is also considered in which any particle moves with approximately equal to 1 probability provided there is no conflict.

There are no comments yet on this publication. Be the first to share your thoughts.