Hybrid Edge Capacity Routing in Complex Networks

The main focus on the algorithmic theory is the network optimization. The goal of network optimization is to connect vertices of the network in an inexpensive manner. In this work we present an efficient algorithm to achieve the effective optimization for an undirected large scale graph. This work is a connectivity data structure that focuses on us to know the connectivity parameters of the existing networks and proposing algorithms to make is efficient to access the information on the network. The network is made efficient by considering the network as a graph with edge weight and edge capacity. The network thus formed makes use of the dynamic programming approach and then the routing optimization is achieved using the Hierarchical edge capacity routing algorithm (HECR). By using HECR algorithm, routing is achieved at two different levels of nodes. The proposed algorithm also addressed the load balancing in the network. It is fast for large number of nodes with 3% of less time and the route found converges to optimal