Optimal topology design for overlay networks

Authors:
Mina Kamel;Caterina Scoglio;Todd Easton
Affiliations:
Electrical and computer Engineering Department, Kansas State University, Manhattan, KS;Electrical and computer Engineering Department, Kansas State University, Manhattan, KS;Industrial and Manufacturing Systems Engineering Department, Kansas State University, Manhattan, KS
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 6
Cited 2

QoS-Assured Service Composition in Managed Service Overlay Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
On selfish routing in internet-like environments

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On a network creation game

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
QRON: QoS-aware routing in overlay networks

IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Design and performance evaluation of service overlay networks topologies

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Resilient virtual network design for end-to-end cloud services

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

Overlay topology design has been one of the most challenging research areas over the past few years. In this paper, we consider 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 traffic demands between the nodes affects the decision of creating new overlay links. The heuristics are also compared through extensive numerical evaluation, and guidelines for the selection of the best heuristic as a function of the cost parameters are also provided.