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
相关论文
共 50 条
  • [1] Very large-scale neighborhood search algorithms for the design of service overlay networks
    Elias, Jocelyne
    Martignon, Fabio
    Carello, Giuliana
    TELECOMMUNICATION SYSTEMS, 2012, 49 (04) : 391 - 408
  • [2] Ordered slicing of very large-scale overlay networks
    Jelasity, Mark
    Kermarrec, Anne-Marie
    SIXTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2006, : 117 - +
  • [3] A survey of very large-scale neighborhood search techniques
    Ahuja, RK
    Ergun, Ö
    Orlin, JB
    Punnen, AP
    DISCRETE APPLIED MATHEMATICS, 2002, 123 (1-3) : 75 - 102
  • [4] Network-aware service placement and selection algorithms on large-scale overlay networks
    Famaey, J.
    Wauters, T.
    De Turck, F.
    Dhoedt, B.
    Demeester, P.
    COMPUTER COMMUNICATIONS, 2011, 34 (15) : 1777 - 1787
  • [5] Topology design for large scale service overlay networks
    Zhang D.
    Wu C.-M.
    Jiang M.
    Xiong W.
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2010, 32 (04): : 841 - 845
  • [6] Constraint-based Very Large-Scale Neighborhood search
    Mouthuy, Sebastien
    Van Hentenryck, Pascal
    Deville, Yves
    CONSTRAINTS, 2012, 17 (02) : 87 - 122
  • [7] Very large-scale neighborhood search for the quadratic assignment problem
    Ahuja, Ravindra K.
    Jha, Krishna C.
    Orlin, James B.
    Sharma, Dushyant
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (04) : 646 - 657
  • [8] Very large-scale neighborhood search techniques in timetabling problems
    Meyers, Carol
    Orlin, James B.
    PRACTICE AND THEORY OF AUTOMATED TIMETABLING VI, 2007, 3867 : 24 - +
  • [9] Constraint-based Very Large-Scale Neighborhood search
    Sébastien Mouthuy
    Pascal Van Hentenryck
    Yves Deville
    Constraints, 2012, 17 : 87 - 122
  • [10] Dynamic Overlay Node Activation Algorithms for Large-Scale Service Deployments
    Famaey, Jeroen
    Wauters, Tim
    De Turck, Filip
    Dhoedt, Bart
    Demeester, Piet
    MANAGING LARGE-SCALE SERVICE DEPLOYMENT, PROCEEDINGS, 2008, 5273 : 14 - 27
12345