A Distributed Network Model in which Hosts Can Perform Message Switching Functions

In the paper, an abstract model of a distributed network containing only hosts and switches is developed; this model allows us to estimate some problems that need to be solved in such a network, taking into account, among other things, non-functional parameters. It is assumed that hosts offer packages of certain services, and messages (requests) between hosts are forwarded via intermediate nodes according to switching rules. A rule determines which neighboring nodes a message received by a node is forwarded to, depending on where the message came from and the parameter vector in its header. Accordingly, the configuration of nodes determines the set of paths from host to host along which packets will be forwarded. The situation is modeled using a graph of physical connections, the vertices of which are hosts and switches, and the edges correspond to the physical connections between them. It is usually assumed that only hosts in such a network receive, process, and send information to other hosts, but do not switch messages. This function is assigned to other nodes, switches. However, we assume that with modern technologies, in some cases a host can perform the switching functions, i.e. such a host (like a switch) contains a system of switching rules that specify where the received message is sent if for some reason the host cannot process the obtained request/message. A network model is proposed in which the message switching function is performed not only by each switch, but also by each host. The paper discusses the problems associated with non-functional parameters of a distributed network, namely, reachability/unreachability of hosts, message looping, network overload with messages, and non-scalability. Optimization issues of the network parameters are discussed based on the set of services provided by each host. In addition, we discuss self-tuning algorithms for a distributed network that optimize network parameters, message transmission over the configured network and incremental (repeated partial) self-tuning algorithms when changing network parameters, in particular, its topology that does not disrupt network operation.

1. М.С.Э. Танненбаум. Распределенные системы, Москва, ДМК Пресс, 2021.

2. Г.И. Радченко. Распределенные вычислительные системы. Челябинск, 2012.

3. Sezer. S, Scott-Hayward. S, Chouhan P.K., Fraser B., Lake D., Finnegan J., Viljoen N., Miller M. and Rao N. Are we ready for sdn? Implementation challenges for software-defined networks IEEE Communications Magazine, 2013, 51 (7), pp. 36-43.

4. Mohammed, A. H., Khaleefah, R. M., k. Hussein, M., and Amjad Abdulateef, I. A review software defined networking for internet of things. In 2020 International Congress on Human-Computer Interaction, Optimization and Robotic Applications (HORA), 2020, pp. 1–8.

5. OpenNetworkingFoundation (2012). Software-defined networking: The new norm for networks. ONF White Paper. 2012.

6. Burdonov, I.; Kossachev, A.; Yevtushenko, N.; López, J.; Kushik, N. and Zeghlache, D. (2021). Preventive Model-based Verification and Repairing for SDN Requests. In Proceedings of the 16th International Conference on Evaluation of Novel Approaches to Software Engineering - ENASE, ISBN 978-989-758-508-1 ISSN 2184-4895, pp. 421-428. DOI: 10.5220/0010494504210428.

7. Igor Burdonov, Nina Yevtushenko and Alexander Kossatchev. Implementing a virtual network on the SDN data plane. Proceedings 2020 IEEE East-West Design & Test Symposium (EWDTS). 2020, pp. 279- 283.

8. Бурдонов И.Б., Евтушенко Н.В., Косачев А.С. Реализация распределенных и параллельных вычислений в сети SDN. Труды института системного программирования. 2022, т. 34, № 3, с. 159- 172.

9. Оре О. Теория графов. М.: Наука, 1968, с. 59, 68.