{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:49:28Z","timestamp":1773143368888,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T00:00:00Z","timestamp":1277337600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11235-010-9381-4","type":"journal-article","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:20:06Z","timestamp":1277245206000},"page":"391-408","source":"Crossref","is-referenced-by-count":7,"title":["Very large-scale neighborhood search algorithms for the design of\u00a0service overlay networks"],"prefix":"10.1007","volume":"49","author":[{"given":"Jocelyne","family":"Elias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Martignon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliana","family":"Carello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,24]]},"reference":[{"issue":"6","key":"9381_CR1","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/TNET.2003.820436","volume":"11","author":"Z. Duan","year":"2003","unstructured":"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\u2013883.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"9381_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/JSAC.2003.818782","volume":"22","author":"Z. Li","year":"2004","unstructured":"Li, Z., & Mohapatra, P. (2004). QRON: QoS-aware routing in overlay networks. IEEE Journal on Selected Areas in Communications, 22(1), 29\u201340.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"9381_CR3","unstructured":"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."},{"key":"9381_CR4","unstructured":"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."},{"key":"9381_CR5","unstructured":"Touch, J., & Hotz, S. (1998). The X-Bone. In Proceedings of the third global internet mini-conference (pp.\u00a075\u201383), Sydney, Australia."},{"issue":"1","key":"9381_CR6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.comnet.2006.04.012","volume":"51","author":"H. T. Tran","year":"2007","unstructured":"Tran, H. T., & Ziegler, T. (2007). A design framework towards the profitable operation of service overlay networks. Computer Networks, 51(1), 94\u2013113.","journal-title":"Computer Networks"},{"key":"9381_CR7","doi-asserted-by":"crossref","unstructured":"Rosen, E., Viswanathan, A., & Callon, R. (2001). Multiprotocol label switching architecture. In IETF RFC 3031, January 2001.","DOI":"10.17487\/rfc3031"},{"key":"9381_CR8","doi-asserted-by":"crossref","unstructured":"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.\u00a0211\u2013220), Montreal, Canada, June 2004.","DOI":"10.1109\/IWQOS.2004.1309384"},{"issue":"1","key":"9381_CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.comnet.2006.04.011","volume":"51","author":"Z. Li","year":"2007","unstructured":"Li, Z., & Mohapatra, P. (2007). On investigating overlay service topologies. Computer Networks, 51(1), 54\u201368.","journal-title":"Computer Networks"},{"issue":"3","key":"9381_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/TNSM.2009.031102","volume":"5","author":"A. Capone","year":"2008","unstructured":"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\u2013156.","journal-title":"IEEE Transactions on Network and Service Management"},{"issue":"1","key":"9381_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R. R. Boorstyn","year":"1977","unstructured":"Boorstyn, R. R., & Frank, H. (1977). Large-scale network topological optimization. IEEE Transactions on Communications, 25(1), 29\u201347.","journal-title":"IEEE Transactions on Communications"},{"key":"9381_CR12","volume-title":"Routing, flow, and capacity design in communication and computer networks","author":"M. Pioro","year":"2004","unstructured":"Pioro, M., & Medhi, D. (2004). Routing, flow, and capacity design in communication and computer networks. San Mateo: Morgan Kaufmann."},{"key":"9381_CR13","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R., & Shenker, S. (2002). Topologically-aware overlay construction and server selection. In Proceedings of IEEE Infocom\u201902 (Vol.\u00a03, pp.\u00a01190\u20131199), New York, USA, June 2002.","DOI":"10.1109\/INFCOM.2002.1019369"},{"issue":"4","key":"9381_CR14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/26.81738","volume":"39","author":"A. Kershenbaum","year":"1991","unstructured":"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\u2013513.","journal-title":"IEEE Transactions on Communications"},{"key":"9381_CR15","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0927-0507(05)80127-6","volume":"7","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C. L., & Stoer, M. (1995). Design of survivable networks. Handbooks in Operations Research and Management Science, 7, 617\u2013672.","journal-title":"Handbooks in Operations Research and Management Science"},{"issue":"1","key":"9381_CR16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","volume":"26","author":"T. L. Magnanti","year":"1986","unstructured":"Magnanti, T. L., Mireault, P., & Wong, R. T. (1986). Tailoring Benders decomposition for uncapacitated network design. Mathematical Programming Study, 26(1), 112\u2013154.","journal-title":"Mathematical Programming Study"},{"key":"9381_CR17","first-page":"1","volume-title":"Robust communication networks: interconnection and survivability","author":"A. Bley","year":"2000","unstructured":"Bley, A., Gr\u00f6tschel, M., & Wess\u00e4ly, R. (2000). Design of broadband virtual private networks: Model and heuristics for the B-WiN. In Robust communication networks: interconnection and survivability (Vol.\u00a053, pp.\u00a01\u201316). Providence: Am. Math. Soc."},{"key":"9381_CR18","unstructured":"Bley, A., & Koch, T. (2002). Integer programming approaches to access and backbone IP-network planning. ZIB Preprint ZR-02-41, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin."},{"key":"9381_CR19","unstructured":"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.\u00a0107\u2013113). Citeseer."},{"issue":"5","key":"9381_CR20","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T. L., & Wong, R. T. (1989). A dual-ascent procedure for large scale uncapacitated network design. Operations Research, 37(5), 716\u2013740.","journal-title":"Operations Research"},{"key":"9381_CR21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M. (1989). Network synthesis and optimum network design problems: models, solution methods and applications. Networks, 19, 313\u2013360.","journal-title":"Networks"},{"issue":"11","key":"9381_CR22","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/35.965365","volume":"39","author":"A. Hills","year":"2001","unstructured":"Hills, A. (2001). Large-scale wireless LAN design. IEEE Communications Magazine, 39(11), 98\u2013107.","journal-title":"IEEE Communications Magazine"},{"key":"9381_CR23","doi-asserted-by":"crossref","unstructured":"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\u201318 May 2007.","DOI":"10.1007\/978-3-540-72606-7_25"},{"key":"9381_CR24","unstructured":"Han, J., Waston, D., & Jahanian, F. (2005). Topology aware overlay networks. In Proceedings of IEEE Infocom\u201905, Miami, FL, 13\u201317 March 2005."},{"key":"9381_CR25","doi-asserted-by":"crossref","unstructured":"Fan, J., & Ammar, M. H. (2006). Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In Proceedings of IEEE Infocom\u201906, Barcelona, Spain, April 2006.","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"9381_CR26","unstructured":"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."},{"key":"9381_CR27","doi-asserted-by":"crossref","unstructured":"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.\u00a0164\u2013173), Barcelona, Spain, October 2004.","DOI":"10.1007\/978-3-540-30193-6_17"},{"key":"9381_CR28","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ICDCS.2007.127"},{"key":"9381_CR29","doi-asserted-by":"crossref","unstructured":"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.\u00a075\u201380), November 2007.","DOI":"10.1109\/GLOCOM.2007.22"},{"key":"9381_CR30","doi-asserted-by":"crossref","unstructured":"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.\u00a054\u201368).","DOI":"10.1007\/11499169_6"},{"key":"9381_CR31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. K. Ahuja","year":"2002","unstructured":"Ahuja, R. K., Ergun, \u00d6., Orlin, J. B., & Punnen, A. P. (2002). A\u00a0survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123, 75\u2013102.","journal-title":"Discrete Applied Mathematics"},{"key":"9381_CR32","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1475-3995.2000.tb00201.x","volume":"7","author":"R. K. Ahuja","year":"2000","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2000). Very large-scale neighborhood search. International Transactions in Operational Research, 7, 301\u2013317.","journal-title":"International Transactions in Operational Research"},{"key":"9381_CR33","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/49.103545","volume":"9","author":"R. Guerin","year":"1991","unstructured":"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\u2013981.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"21","key":"9381_CR34","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1049\/el:19941192","volume":"30","author":"J. A. Schormans","year":"1994","unstructured":"Schormans, J. A., Pitts, J., Williams, K., & Cuthbert, L. (1994). Equivalent capacity for on\/off sources in ATM, Electronic. Electronic Letters, 30(21), 1740\u20131741.","journal-title":"Electronic Letters"},{"issue":"1","key":"9381_CR35","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2003.09.011","volume":"145","author":"H. W. Hamacher","year":"2004","unstructured":"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\u2013116.","journal-title":"Discrete Applied Mathematics"},{"key":"9381_CR36","doi-asserted-by":"crossref","unstructured":"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.\u00a0137\u2013150), Marseille, France.","DOI":"10.1145\/637201.637222"},{"issue":"6","key":"9381_CR37","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1287\/mnsc.1030.0193","volume":"50","author":"R. K. Ahuja","year":"2004","unstructured":"Ahuja, R. K., Orlin, J. B., Pallottino, S., Scaparra, M. P., & Scutell\u00e0, M. G. (2004). A multi-exchange heuristic for the single source capacitated facility location problem. Management Science, 50(6), 749\u2013760.","journal-title":"Management Science"},{"key":"9381_CR38","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. K. Ahuja","year":"2001","unstructured":"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\u201397.","journal-title":"Mathematical Programming"},{"key":"9381_CR39","unstructured":"Thompson, P., & Orlin, J. B. (1989). Theory of cyclic transfers. Working paper, Operations Research Center, MIT."},{"key":"9381_CR40","volume-title":"Knapsack problems\u2014algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems\u2014algorithms and computer implementations. New York: Wiley."},{"key":"9381_CR41","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search. Part I. Orsa Journal on Computing, 1, 190\u2013206.","journal-title":"Orsa Journal on Computing"},{"key":"9381_CR42","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search. Part II. Orsa Journal on Computing, 2, 4\u201332.","journal-title":"Orsa Journal on Computing"},{"key":"9381_CR43","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/MASCOT.2001.948886"},{"issue":"2","key":"9381_CR44","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/505680.505683","volume":"30","author":"A. Medina","year":"2000","unstructured":"Medina, A., Matta, I., & Byers, J. (2000). On the origin of power-laws in internet topologies. ACM computer. ACM Communications Review, 30(2), 18\u201328.","journal-title":"ACM Communications Review"},{"key":"9381_CR45","unstructured":"AMPL: A modeling language for mathematical programming. Available at http:\/\/www.ampl.com ."},{"key":"9381_CR46","unstructured":"ILOG Optimization Products. ILOG CPLEX. http:\/\/www.ilog.com\/products\/cplex\/ ."},{"issue":"5439","key":"9381_CR47","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9381-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-010-9381-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-010-9381-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:50:09Z","timestamp":1559386209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-010-9381-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,24]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9381"],"URL":"https:\/\/doi.org\/10.1007\/s11235-010-9381-4","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,24]]}}}