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 条
  • [41] Routing service in large-scale multimedia networks
    Wang, Hao
    Yu, Zhanwu
    Li, Rui
    2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 70 - +
  • [42] Carpooling Service for Large-Scale Taxicab Networks
    Zhang, Desheng
    He, Tian
    Zhang, Fan
    Lu, Mingming
    Liu, Yunhuai
    Lee, Haengju
    Son, Sang H.
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2016, 12 (03)
  • [43] Very Large-Scale Neighborhood Search for Steel Hot Rolling Scheduling Problem With Slab Stack Shuffling Considerations
    Shi, Yarong
    Liu, Shixin
    IEEE ACCESS, 2021, 9 : 47856 - 47863
  • [44] Polynomial time algorithm and its heuristics to find the best move of a very large-scale Neighborhood Search Technique
    Huynh, D
    PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 1416 - 1422
  • [45] Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations
    Ghoniem, Ahmed
    Flamand, Tulay
    Haouari, Mohamed
    INFORMS JOURNAL ON COMPUTING, 2016, 28 (03) : 575 - 588
  • [46] On the scalability of genetic algorithms to very large-scale feature selection
    Moser, A
    Murty, MN
    REAL-WORLD APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2000, 1803 : 77 - 86
  • [47] OnRipple: A distributed overlay framework for targeted immunization in large-scale networks
    Yang, Sirui
    Jin, Hai
    Liao, Xiaofei
    Yao, Hong
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, : 911 - +
  • [48] Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
    Frey, Davide
    Murphy, Amy L.
    P2P'08: EIGHTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2008, : 351 - +
  • [49] A compromised large-scale neighborhood search heuristic for cargo loading planning
    Li, Yanzhi
    Tao, Yi
    Wang, Fan
    AI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2007, 4830 : 721 - +
  • [50] A very large scale neighborhood search algorithm for the q-mode problem
    Kulkarni, Girish
    Fathi, Yahya
    IIE TRANSACTIONS, 2007, 39 (10) : 971 - 984