Queuing Theory Based Optimal Flow Routing Algorithm And The Application In NS-2Network

In this paper, by analyzing the diversity of current network environment, we have gotsome characteristics of network congestion and network failures that are common in currentnetwork. These two issues have affected the operation of the network. After a thoroughanalysis we have drawn the conclusion that the basic reason affecting the network includesnon-optimal network routing, uneven charge of transmission path and so on. In this paper, wefocus on the optimization problem for path allocation. We compared several routingalgorithms, performed data analysis, found there are some shortcomings in these routingalgorithms, and designed a new routing algorithm——optimal flow routing algorithm basedon queuing theory, combining with the impact parameters in the real transmission.First, by taking advantage of queuing theory, we proposed a path allocation model,which uses path length, one of the main factors that affect the end to end transportation ofnetwork, to inference a network data transportation affecting formula about path length, andto design an algorithm according to the parameters relation reflected from the formula.Then, we have proved that the path allocation solution selected by this algorithm is anoptimal solution. And according to the allocation method of the model and the path lengthrelated formula, this algorithm can get an optimal path set and return it.Finally, we applied this optimal flow routing algorithm in NS-2network, which is basedon classic network topology. And designed and implemented an application system ofsearching for optimal pathes in NS-2network. This system is composed of a communicationmodule, topology model module and result display module. In this system, the optimal flowrouting algorithm will be applied on the classic network generated by the topology modelmodule, and the found optimal paths will be returned by the result display module.Meanwhile, by thoroughly analyzing the results, we have proved that this algorithm can solvethe problems of distributed network traffic flow and soothing network latency, and can greatlyimproved the network transportation quality. Moreover, the computation complexity of theresult is O (n*long), which has a good theoretical feasibility and is lower than most of otherrouting algorithm results.Our study has proved that the optimal flow routing algorithm based on queuing theory is correct and feasible. However, the optimal flow routing algorithm based on profound queuingtheory and also concerning about the multi-complexity of network is open to discussion anddeserves further research.