Open AccessQoS Routing Algorithm Based on Entropy Granularity in the Network Transmission
Author(s) -
Xiaoling Li,
Hao Hu
Publication year - 2019
Publication title -
cybernetics and information technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.272
H-Index - 17
eISSN - 1314-4081
pISSN - 1311-9702
DOI - 10.2478/cait-2019-0036
Subject(s) - computer science , computer network , distributed computing , granularity , quality of service , equal cost multi path routing , static routing , entropy (arrow of time) , the internet , shortest path problem , dijkstra's algorithm , policy based routing , routing protocol , routing (electronic design automation) , theoretical computer science , graph , physics , quantum mechanics , world wide web , operating system
With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.