QoSR Theory And Technology Based On A New Ant Algorithm

Quality of Service Routing(QoSR) research is very important in network theory research. Due to network developing and application increasing, network routing has been needed more standards and demands. In order to solve QoS problem that voice and video can't be transferred effectively in Internet because there are delay, jitter, lost data, bandwidth. The paper study QoSR Theory and Technology based on Internet.This paper presents an extended Dijkstra algorithm. It can find out the limit of each QoS parameter constrained and can solve some QoSR problem. This paper analysies and comparies time complexity of the extended Dijkstra algorithm.As a search algorithm, ant colony algorithm has been used recent years more and more. After studying ant colony algorithm, this paper presents a new ant algorithm and reserves pheromone concept. Comparing with ant colony algorithm, the new ant algorithm is grandly upgraded in three fields. It include:1. Giving up the transfer method of probability and select the transfer method of inevitability.2. Giving up search path method of a colony of ants and select search path method of an ant.3. When an ant search path, It always go forward along a less pheromone path. After programmed and calculated, the paper confirms the new ant algorithm cansolve the problem of QoSR. It can find out a good QoS route or the best QoS route. After analyzing the algorithm, we can find that there is a linear relation between the algorithm time complexity and the number of ant's moving step.After studying the new ant algorithm, this paper prove that the ant can reach at each node of connection network After the ant moves finite step by this algorithm. This result still proves that the new ant algorithm has an initialization QoSR solution. The paper studies a relation between the algorithm time complexity and the number of ant's moving step. The result is that there is a linear relation between the algorithm time complexity and the number of ant's moving step. The paper studies a relation between the number of ant's moving step and QoSR solution. The result is that this algorithm can find out a good QoSR and sometimes find out the best QoSR after an...