Construction of a data distribution scheme in packet-switched data transmission networks

Abstract

A data transmission network is one of the basic components of a computer network. It represents its communications network, which connects data processing centers (nodes) to each other via certain transport modes.

The nodes, in turn, achieves the basic functions of distributing the data in the network to ensure that it reaches the subscribers of the network within a specified period of time and with the least possible loss by controlling the routing of the data according to more convenient paths to achieve the required communication process with the best conditions and requirements into consideration the network status of load and technical characteristics of its components.

In this research, we will focus on building a data distribution scheme within the network through an algorithm that provides all the capabilities available for transfer from each node in  the network  to all nodes of the network and for the priority of these paths. The most appropriate parameters were chosen according to the network parameters in terms of delay time, the number of steps between the transmitter and the receiver and the distance, in order to avoid congestion and overload situation in some network location.

After constructing the algorithm, we will give an example of a six-node network and describe how to structure the data distribution schema and then how to generalize the method to any network, regardless of its structure and number of nodes