The R-edge-connected Network Planning Based on Hops-Constraint
Qiao Li-xin · Journal of Circuits and Systems · 2004
The problem of R-edge-connectivity network planning based on hop-constraint is to design a network that meets the constraint of the given edge-connectivity and the number of hops while minimizing the total cost of the edge-linked connection. In this paper, a heuristic iterative algorithm is presented to solve the problem. According to this algorithm, an initial R-edge-connectivity graph is formed. Then the cost is reduced by iteratively exchanging edges. Finally some edges are added to meet the requirement of the number of hops. A better graph is obtained in terms of cost reduction through edge shifting and edge-deleting.