Optimal routing in data networks with joint consideration of servers and the subnet

This paper presents an idea of the multisite optimal routing problem and propose an optimal routing algorithm for serving the problem. In this algorithm, virtual nodes which represent different sites of origin are introduced. It can be proven that the complexity of finding the shortest path of the algorithm is almost the same as that of the general Dijsktra shortest path algorithm. Simulation and analysis of examples are given to validate this algorithm. The results show that the capacities of network servers have a quite large influence on the optimal routing results of the whole network. The average packet delay in the whole network based on the solution of multisite routing problem obtained by the presented algorithm is much better than that of previous results based on the optimal routing of subnet. It is safe to say that this solution should have positive effects to the rapid development of the information super highway.