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.
Chapter PDF
Similar content being viewed by others
References
Gu, X., et al.: Qos-assured service composition in managed service overlay networks. In: Proc. IEEE 23rd International Conference on Distributed Computing Systems, Providence, May 2003, IEEE Computer Society Press, Los Alamitos (2003)
Baset, S., Schulzrinne, H.: An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol. In: Proceedings of the INFOCOM ’06, Barcelona, Spain (April 2006)
Vieira, S., Liebeherr, J.: Topology design for service overlay networks with bandwidth guarantees. In: Proceedings of IWQoS 2004, Montreal, Canada (June 2004)
Li, Z., Mohapatra, P.: Qron: Qos-aware routing in overlay networks. IEEE Journal Selected Areas in Communications 22, 29–40 (2004)
Zhao, B., et al.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Area in Communications (Special Issue on Service Overlay Networks)Â 22(1) (2004)
Han, J., Watson, D., Jahanian, F.: Topology Aware Overlay Networks. In: Proceedings of IEEE INFOCOM’05, Miami, USA, March 2005, IEEE Computer Society Press, Los Alamitos (2005)
Fan, J., Ammar, M.: Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies. In: Proceedings of IEEE INFOCOM’06, Barcelona, Spain, April 2006, IEEE Computer Society Press, Los Alamitos (2006)
Chun, B., et al.: Characterizing selfishly constructed overlay networks. In: Proceedings of IEEE INFOCOM’04, Hong Kong, March 2004, IEEE Computer Society Press, Los Alamitos (2004)
Fabrikant, A., et al.: On a Network Creation Game. In: Proceedings of ACM PODC, ACM Press, New York (2003)
Zhang, H., Kurose, J., Towsley, D.: Can an Overlay Compensate for a Careless Underlay?. In: Proceedings of IEEE INFOCOM’06, Barcelona, Spain, April 2006, IEEE Computer Society Press, Los Alamitos (2006)
Qiu, L., et al.: On selfish routing in internet-like environments. In: Proceedings of the ACM SIGCOMM, August 2003. All ACM Conferences, pp. 151–162. ACM Press, New York (2003)
Pioro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Fransisco (2004)
Boesch, F.T., Chen, S., McHugh, N.A.M.: On covering the points of a graph with point disjoint paths. In: Graphs and Combinatorics (Proc. Capitol Conf. on Graph Theory and Combinatorics) (1974)
Keyao zhu, http://www.networks.cs.ucdavis.edu/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Kamel, M., Scoglio, C., Easton, T. (2007). Optimal Topology Design for Overlay Networks. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., Oliveira, J.C.d., McNair, J. (eds) NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet. NETWORKING 2007. Lecture Notes in Computer Science, vol 4479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72606-7_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-72606-7_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72605-0
Online ISBN: 978-3-540-72606-7
eBook Packages: Computer ScienceComputer Science (R0)