QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

Abstract

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.Shortest Path First (SPF) algorithm (such as Dijkstra's algorithm) mainly focuses on how to find a best path to meet the request or have the largest possibility to meet the request path [8,9]. However, it may ignore the overall network resources and cause low comprehensive utilization. There may even be some problems such as network congestion, which may cause the decreasing in the overall number of requests and affect the performance of the network [10].Bellman-Ford algorithm considering two variables (path bandwidth, link transmission delay) was proposed to solve the QoS routing problem [11]. This algorithm makes assumptions about the network model, assuming that a node-based router adopts a rate-based scheduling algorithm. From the calculation formula of the maximum end-to-end delay of the scheduling algorithm, the factors that determine the path delay including link transmission delay and path bandwidth can be identified. Therefore, the network topology maps based on different bandwidths was introduced to calculate the shortest path according to the link length on different topological maps [12]. The algorithm maximizes the use of network resources at the time and satisfies a certain QoS request at that time. However, the algorithm does not consider the cost paid by the network. For example, when the available network topology map is constructed to meet a traffic request, some bandwidth is insufficient, and the link is pruned [13,14]. When there are more requests, especially in the cast of heavy network load, subsequent requests may not be satisfied because of the previous occupancy of bandwidth, which may lead to a decrease in overall reception rate [15]. In addition, if the load balancing algorithm pursues the greatest degree of balanced use of network resources, not only delay sensitive services cannot accept the computational delay caused by complex calculations, but also it is not necessary to achieve the absolute equilibrium state of the network.Based on existing SPF algor...

PS-PC: An Effective Method to Improve VoIP Technology Bandwidth Utilization over ITTP Protocol

“…This growing demand has brought the attention of VoIP developers and researchers. They have concentrated on the two main issues that face the VoIP to replace the current traditional phone systems; these are VoIP QoS and VoIP bandwidth utilization [4,5]. As for VoIP bandwidth utilization, the three main approaches to make it more efficient are packet header compression, packet payload compaction, and packets coalescence [5][6][7].…”