Heuristics for Synthesizing Robust Networks with a Diameter Constraint Academic Article

abstract

• Robustness of a network in the presence of node or link failures plays an important role in the design of the network. A key factor that quantifies this robustness is the algebraic connectivity of the network. In this paper, the authors address the problem of finding a network that maximizes the algebraic connectivity of the network while ensuring that the length of the shortest path joining any two nodes in the network is within a given bound. This paper presentsk-opt and tabu search heuristics for finding feasible solutions for this network synthesis problem. Computational results are also presented to corroborate the performance of the proposed algorithms.

authors

• Rathinam, Sivakumar

published proceedings

• MATHEMATICAL PROBLEMS IN ENGINEERING

author list (cited authors)

• Nagarajan, H., Wei, P., Rathinam, S., & Sun, D.

citation count

• 3

complete list of authors

• Nagarajan, Harsha||Wei, Peng||Rathinam, Sivakumar||Sun, Dengfeng

publication date

• February 2014

publisher

• Hindawi  Publisher

published in

• Mathematical Problems in Engineering  Journal

keywords

• 40 Engineering
• Prevention

Digital Object Identifier (DOI)

• 10.1155/2014/326963

URI

• https://hdl.handle.net/1969.1/184518

start page

• 1

end page

• 11

volume

• 2014

URL

• http://dx.doi.org/10.1155/2014/326963