A Simheuristic Algorithm for Service Placement in Community Networks

2020 
The growing demand for network connectivity has boosted the number of community networks (CNs). CNs are decentralized and self-organized communication networks owned and managed at the edge by volunteers. Due to the heterogeneity of edge node characteristics, high software and hardware diversity, irregular topology and unreliable behavior of the network, the performance of its services varie depending on where they are hosted. These characteristics of CNs and edge platforms running on them require of advanced simulation-optimization methods to place services. In this context, we propose a simheuristic algorithm to address this stochastic problem. The core of this approach relies on a multi-start metaheuristic with a multi-objective optimization method. Our approach combines Monte Carlo simulation and the multi-criteria optimal placement heuristic, The method is tested using real traces of Guifi.net CN, which is considered to be largest CN worldwide.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    6
    References
    0
    Citations
    NaN
    KQI
    []