PARALLEL OPTIMAL ROUTING CONTROL BY COMMODITIES FOR LARGE DATA NETWORKS

In this paper, a new distributed algorithm is proposed to solve optimal routing problems (ORPs) for large data network with multicommodities. Contrast to the existing algorithms for general network topology, which have parallel time complexity of O (M2) assuming that all the nodes of the network have a processor, our algorithm takes O (m2) time units using the same number of processors if some mild network conditions are met. Here, is the diameter of the network; M is the number of commodities; m is a positive number usually much smaller than M. The exact value of m depends on the pattern of the OD pairs including the locations of origin nodes and destination nodes, and the flow demand of OD pairs. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation tool and the results show that our algorithm is much faster than the general algorithms.

PARALLEL OPTIMAL ROUTING CONTROL BY COMMODITIES FOR LARGE DATA NETWORKS Conference Paper