Article ID Journal Published Year Pages File Type
6883006 Computer Networks 2015 18 Pages PDF
Abstract
First, the problem is formulated into an integer linear program (ILP) and it is solved to its optimality for moderate-size networks. Then, by comparing with the Moore bound and unconstrained topology optimization, we show the circulant graph can be a qualified candidate with good bandwidth efficiency. Finally, due to the scaling limitation of the ILP approach, a dynamic programming (polynomial-time) algorithm is proposed and results show that it performs very closely to the optimal solutions induced from the ILP solver.
Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Authors
,