Developing and modeling a hybrid dynamic routing protocol

Nowadays, the growth of network services significantly increases the requirements for the quality and speed of solving network management problems in ever-growing data centers. The load increase in data centers leads to the need for structural scaling that implies increasing the number of servers and routers. There is a need for simple scalable routing protocols to facilitate automation and management of ever-growing networks, especially in data centers. The work aims to present and simulate a new hybrid dynamic routing protocol including an upgraded distance vector routing algorithm and a link state algorithm. The article discusses the solution to the problems of developing a hybrid dynamic routing protocol, which guarantees loop freedom and provides scaling requirements through the development and implementation of simple algorithms that ensure reliable transmission of data and service traffic containing route information and detects channels, networks, and directly connected neighboring routers connected to the current router. The scalability requirements of the new hybrid dynamic routing protocol are met since the distance vector routing algorithm calculates the distances to infrastructure nodes, and not to the network prefixes themselves. The link state algorithm advertises network prefixes only once, which leads to a reduction in the link state database and a reduction in calculations after topology changes. Loop freedom is achieved by in-troducing a newly developed distributed sequence number algorithm. A simulation model has been developed to simulate the hybrid dynamic routing protocol. The simulation allowed estimating the amount and volume of service traffic, which confirmed the effectiveness of the developed protocol in the conditions of scaling the data center network.