Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be selfish or cooperative are the main issues that affect the performance of overlay networks, and have to be considered in designing a good topology. In this paper, we study the problem of finding the overlay topology that minimizes a cost function which takes into account the overlay link creation cost and the routing cost. First, we formulate the problem as an Integer Linear Programming (ILP) given a traffic matrix in case of cooperative and non cooperative node behavior. Then, we propose some heuristics to find near-optimal overlay topologies with a reduced complexity. The solutions of the ILP problem in average-size networks have been analyzed, showing that the knowledge of traffic demands affects the decision of creating new overlay links and the resulting optimal topology are different from the regular to...
Mina Kamel, Caterina M. Scoglio, Todd Easton