Skip to main content
SpringerLink
Log in

Very large-scale neighborhood search algorithms for the design of service overlay networks

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of Service guarantees, while leaving the underlying network infrastructure unchanged. The deployment of a SON can be very expensive, and hence its planning requires careful decisions, including the overlay nodes’ placement and the capacity provisioning of the access links that connect the end-users to the SON infrastructure.

In this work we first propose a novel Integer Linear Programming (ILP) model for the overlay network design problem which selects the optimal number and position of overlay nodes, the capacity reserved on each overlay link, as well as the optimal routing of the incoming traffic demands.

Since such model can be solved to the optimum only for small network instances, we further propose an efficient and novel tabu search based heuristic for the planning of SONs that combines polynomial size and very large-scale neighborhoods. The very large-scale neighborhood of the solution given by tabu search is explored efficiently to obtain in a short time a new one that is both far from the current solution and cost-decreasing.

We provide numerical results of the proposed heuristic on a set of realistic, large-size instances, including real ISP topologies, and discuss the effect of different parameters on the characteristics of the planned networks. Furthermore, we compare such results with the bound obtained solving our ILP model in small network scenarios. We show that in the considered network topologies the proposed heuristic performs very close to the optimum with a short computation time, thus providing a promising framework for the design of SONs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Duan, Z., Zhang, Z.-L., & Hou, Y. T. (2003). Service overlay networks: SLAs, QoS, and bandwidth provisioning. IEEE/ACM Transactions on Networking, 11(6), 870–883.

    Article  Google Scholar 

  2. Li, Z., & Mohapatra, P. (2004). QRON: QoS-aware routing in overlay networks. IEEE Journal on Selected Areas in Communications, 22(1), 29–40.

    Article  Google Scholar 

  3. Subramanian, L., Stoica, I., Balakrishnan, H., & Katz, R. H. (2002). OverQoS: offering internet QoS using overlays. In Proceedings of the 1st workshop on hot topics in networks HotNets-I, Princeton, New Jersey, USA, October 2002.

  4. Gu, X., Nahrstedt, K., Chang, R. N., & Ward, C. (2003). QoS-assured service composition in managed service overlay networks. In Proceedings of the 23rd international conference on distributed computing systems, Providence, Rhode Island, USA, May 2003.

  5. Touch, J., & Hotz, S. (1998). The X-Bone. In Proceedings of the third global internet mini-conference (pp. 75–83), Sydney, Australia.

  6. Tran, H. T., & Ziegler, T. (2007). A design framework towards the profitable operation of service overlay networks. Computer Networks, 51(1), 94–113.

    Article  Google Scholar 

  7. Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol label switching architecture. In IETF RFC 3031, January 2001.

  8. Vieira, S. L., & Liebeherr, J. (2004). Topology design for service overlay networks with bandwidth guarantees. In The 12th IEEE international workshop on quality of service, IWQoS (pp. 211–220), Montreal, Canada, June 2004.

  9. Li, Z., & Mohapatra, P. (2007). On investigating overlay service topologies. Computer Networks, 51(1), 54–68.

    Article  Google Scholar 

  10. Capone, A., Elias, J., & Martignon, F. (2008). Models and algorithms for the design of service overlay networks. IEEE Transactions on Network and Service Management, 5(3), 143–156.

    Article  Google Scholar 

  11. Boorstyn, R. R., & Frank, H. (1977). Large-scale network topological optimization. IEEE Transactions on Communications, 25(1), 29–47.

    Article  Google Scholar 

  12. Pioro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Mateo: Morgan Kaufmann.

    Google Scholar 

  13. Ratnasamy, S., Handley, M., Karp, R., & Shenker, S. (2002). Topologically-aware overlay construction and server selection. In Proceedings of IEEE Infocom’02 (Vol. 3, pp. 1190–1199), New York, USA, June 2002.

  14. Kershenbaum, A., Kermani, P., & Grover, G. A. (1991). MENTOR: an algorithm for mesh network topological optimization and routing. IEEE Transactions on Communications, 39(4), 503–513.

    Article  Google Scholar 

  15. Grötschel, M., Monma, C. L., & Stoer, M. (1995). Design of survivable networks. Handbooks in Operations Research and Management Science, 7, 617–672.

    Article  Google Scholar 

  16. Magnanti, T. L., Mireault, P., & Wong, R. T. (1986). Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study, 26(1), 112–154.

    Google Scholar 

  17. Bley, A., Grötschel, M., & Wessäly, R. (2000). Design of broadband virtual private networks: Model and heuristics for the B-WiN. In Robust communication networks: interconnection and survivability (Vol. 53, pp. 1–16). Providence: Am. Math. Soc.

    Google Scholar 

  18. Bley, A., & Koch, T. (2002). Integer programming approaches to access and backbone IP-network planning. ZIB Preprint ZR-02-41, Konrad-Zuse-Zentrum für Informationstechnik Berlin.

  19. Bley, A. (2003). A Lagrangian approach for integrated network design and routing in IP networks. In Proceedings of the first international network optimization conference (INOC 2003), Paris (pp. 107–113). Citeseer.

  20. Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1989). A dual-ascent procedure for large scale uncapacitated network design. Operations Research, 37(5), 716–740.

    Article  Google Scholar 

  21. Minoux, M. (1989). Network synthesis and optimum network design problems: models, solution methods and applications. Networks, 19, 313–360.

    Article  Google Scholar 

  22. Hills, A. (2001). Large-scale wireless LAN design. IEEE Communications Magazine, 39(11), 98–107.

    Article  Google Scholar 

  23. Amaldi, E., Capone, A., Cesana, M., & Malucelli, F. (2007). Optimization models for the radio planning of wireless mesh networks. In Proceedings of networking 2007, Atlanta, Georgia, USA, 14–18 May 2007.

  24. Han, J., Waston, D., & Jahanian, F. (2005). Topology aware overlay networks. In Proceedings of IEEE Infocom’05, Miami, FL, 13–17 March 2005.

  25. Fan, J., & Ammar, M. H. (2006). Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In Proceedings of IEEE Infocom’06, Barcelona, Spain, April 2006.

  26. Shi, S., & Turner, J. (2002). Placing servers in overlay networks. In Proceedings of the international symposium on performance evaluation of computer and telecommunication systems (SPECTS) 2002, San Diego, CA, July 2002.

  27. Vleeschauwer, B. D., Turck, F. D., Dhoedt, B., & Demeester, P. (2004). On the construction of QoS enabled overlay networks. In Proceedings of the 5th international workshop on quality of future internet services (QofIS04) (pp. 164–173), Barcelona, Spain, October 2004.

  28. Roy, S., Pucha, H., Zhang, Z., Hu, Y. C., & Qiu, L. (2007). Overlay node placement: analysis, algorithms and impact on applications. In Proceedings of the 27th international conference on distributed computing systems, Toronto, Canada, June 2007.

  29. Zhou, L., & Sen, A. (2007). Topology design of service overlay network with a generalized cost model. In Proceedings of IEEE global telecommunications conference, GLOBECOM (pp. 75–80), November 2007.

  30. Sen, A., Zhou, L., Hao, B., Shen, B. H., & Ganguly, S. (2005). On topological design of service overlay networks. In Proceedings of the thirteenth international workshop on quality of service, IWQoS (pp. 54–68).

  31. Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123, 75–102.

    Article  Google Scholar 

  32. Ahuja, R. K., Orlin, J. B., & Sharma, D. (2000). Very large-scale neighborhood search. International Transactions in Operational Research, 7, 301–317.

    Article  Google Scholar 

  33. Guerin, R., Ahmadi, H., & Naghshineh, M. (1991). Equivalent capacity and its application to bandwidth allocation in high speed networks. IEEE Journal on Selected Areas in Communications, 9, 968–981.

    Article  Google Scholar 

  34. Schormans, J. A., Pitts, J., Williams, K., & Cuthbert, L. (1994). Equivalent capacity for on/off sources in ATM, Electronic. Electronic Letters, 30(21), 1740–1741.

    Article  Google Scholar 

  35. Hamacher, H. W., Labb, M., Nickel, S., & Sonneborn, T. (2004). Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145(1), 104–116.

    Article  Google Scholar 

  36. Sen, S., & Wang, J. (2002). Analyzing peer-to-peer traffic across large networks. In Proceedings of the 2nd ACM SIGCOMM workshop on internet measurement (pp. 137–150), Marseille, France.

  37. Ahuja, R. K., Orlin, J. B., Pallottino, S., Scaparra, M. P., & Scutellà, M. G. (2004). A multi-exchange heuristic for the single source capacitated facility location problem. Management Science, 50(6), 749–760.

    Article  Google Scholar 

  38. Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Mathematical Programming, 91, 71–97.

    Google Scholar 

  39. Thompson, P., & Orlin, J. B. (1989). Theory of cyclic transfers. Working paper, Operations Research Center, MIT.

  40. Martello, S., & Toth, P. (1990). Knapsack problems—algorithms and computer implementations. New York: Wiley.

    Google Scholar 

  41. Glover, F. (1989). Tabu search. Part I. Orsa Journal on Computing, 1, 190–206.

    Google Scholar 

  42. Glover, F. (1990). Tabu search. Part II. Orsa Journal on Computing, 2, 4–32.

    Google Scholar 

  43. Medina, A., Lakhina, A., Matta, I., & Byers, J. (2001). BRITE: an approach to universal topology generation. In Proceedings of MASCOTS 2001, Cincinnati, OH, August 2001.

  44. Medina, A., Matta, I., & Byers, J. (2000). On the origin of power-laws in internet topologies. ACM computer. ACM Communications Review, 30(2), 18–28.

    Article  Google Scholar 

  45. AMPL: A modeling language for mathematical programming. Available at http://www.ampl.com.

  46. ILOG Optimization Products. ILOG CPLEX. http://www.ilog.com/products/cplex/.

  47. Barabási, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509–512.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology and Mathematical Methods, University of Bergamo, Dalmine, BG, 24044, Italy

    Jocelyne Elias & Fabio Martignon

  2. Department of Electronics and Information, Politecnico di Milano, Milan, Italy

    Giuliana Carello

Authors
  1. Jocelyne Elias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Martignon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giuliana Carello
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jocelyne Elias.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elias, J., Martignon, F. & Carello, G. Very large-scale neighborhood search algorithms for the design of service overlay networks. Telecommun Syst 49, 391–408 (2012). https://doi.org/10.1007/s11235-010-9381-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-010-9381-4

Keywords

Search

Navigation