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

被引：0
作者：
Jocelyne Elias
Fabio Martignon
Giuliana Carello
机构：
[1] University of Bergamo,Department of Information Technology and Mathematical Methods
[2] Politecnico di Milano,Department of Electronics and Information
来源：
Telecommunication Systems | 2012年 / 49卷
关键词：
Service overlay networks; Network design; Optimization; Heuristic; Very large-scale neighborhood; Tabu search;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：391 / 408
页数：17
相关论文
共 61 条
[1]  
Duan Z.(2003)Service overlay networks: SLAs, QoS, and bandwidth provisioning IEEE/ACM Transactions on Networking 11 870-883
[2]  
Zhang Z.-L.(2004)QRON: QoS-aware routing in overlay networks IEEE Journal on Selected Areas in Communications 22 29-40
[3]  
Hou Y. T.(2007)A design framework towards the profitable operation of service overlay networks Computer Networks 51 94-113
[4]  
Li Z.(2007)On investigating overlay service topologies Computer Networks 51 54-68
[5]  
Mohapatra P.(2008)Models and algorithms for the design of service overlay networks IEEE Transactions on Network and Service Management 5 143-156
[6]  
Tran H. T.(1977)Large-scale network topological optimization IEEE Transactions on Communications 25 29-47
[7]  
Ziegler T.(1991)MENTOR: an algorithm for mesh network topological optimization and routing IEEE Transactions on Communications 39 503-513
[8]  
Li Z.(1995)Design of survivable networks Handbooks in Operations Research and Management Science 7 617-672
[9]  
Mohapatra P.(1986)Tailoring Benders decomposition for uncapacitated network design Mathematical Programming Study 26 112-154
[10]  
Capone A.(1989)A dual-ascent procedure for large scale uncapacitated network design Operations Research 37 716-740
1234567