Self-similarity properties in a queuing network model

TL;DR

This paper introduces a cellular automata-based model of subscriber telephone networks that reveals fractal properties depending on operational parameters, emphasizing its algorithmic compatibility for precise implementation.

Contribution

It presents a novel cellular automata model for telephone networks that uncovers fractal properties and is highly compatible with algorithmic methods.

Findings

Revealed fractal properties vary with model parameters

Model is compatible with algorithmic implementation

Provides a formal, rule-based approach to network modeling

Abstract

In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The main advantage of the model in question is its compatibility with algorithmic methods - a finite set of formal rules, assigned on a finite set of elements (cells), allows precise realization in the form of algorithms.