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 条
  • [21] Robust aggregation protocols for large-scale overlay networks
    Montresor, A
    Jelasity, M
    Babaoglu, O
    2004 INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2004, : 19 - 28
  • [22] A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
    Yagiura, Mutsunori
    Iwasaki, Shinji
    Ibaraki, Toshihide
    Glover, Fred
    Discrete Optimization, 2004, 1 (01) : 87 - 98
  • [23] A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
    Mouthuy, Sebastien
    Massen, Florence
    Deville, Yves
    Van Hentenryck, Pascal
    TRANSPORTATION SCIENCE, 2015, 49 (02) : 223 - 238
  • [24] Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
    Kammerdiner, Alla
    Semenov, Alexander
    Pasiliao, Eduardo L.
    JOURNAL OF GLOBAL OPTIMIZATION, 2024, 88 (03) : 653 - 683
  • [25] Fighting erosion in dynamic large-scale overlay networks
    Baldoni, R.
    Bonomi, S.
    Querzoni, L.
    Rippa, A.
    Piergiovanni, S. Tucci
    Virgillito, A.
    21ST INTERNATIONAL CONFERENCE ON ADVANCED NETWORKING AND APPLICATIONS, PROCEEDINGS, 2007, : 110 - +
  • [26] A Generic Optimized Time Management Algorithms (OTMA) Framework for Simulating Large-Scale Overlay Networks
    Rizvi, Syed S.
    Elleithy, Khaled M.
    14TH COMMUNICATIONS AND NETWORKING SYMPOSIUM 2011 (CNS 2011) - 2011 SPRING SIMULATION MULTICONFERENCE - BK 3 OF 8, 2011, : 27 - 34
  • [27] DESIGN OF LARGE-SCALE NETWORKS
    FRANK, H
    FRISCH, IT
    PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1972, 60 (01): : 6 - &
  • [28] An Overlay Approach for Service Discovery in a Large-Scale Decentralized Cloud
    Liew, Soung-Yue
    Teoh, Ee Na
    Lau, Phooi Yee
    Chong, Poh Kit
    Nazir, Amril
    Karuppiah, Ettikan K.
    Yassin, Yaszrina Mohamad
    IEEE ASIA PACIFIC CLOUD COMPUTING CONGRESS 2012, 2012, : 68 - 71
  • [29] Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem
    Mitrovic-Minic, Snezana
    Punnen, Abraham P.
    DISCRETE OPTIMIZATION, 2009, 6 (04) : 370 - 377
  • [30] Routing management in very large-scale networks
    Garcia-Luna-Aceves, J.J.
    Future Generation Computer Systems, 1988, 4 (02) : 81 - 93
12345