Journal
33RD ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING
Volume -, Issue -, Pages 151-160Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3167132.3167147
Keywords
service placement; community network; community clouds; leader election
Funding
- Portuguese government through FCT - Fundacao para a Ciencia e Tecnologia [PTDC/EEI-SCR/6945/2014, UID/CEC/500021/2013]
- ERDF through COMPETE 2020 Programme [POCI-01-0145-FEDER-016883]
- European H2020 project LightKone [H2020-732505]
- Spanish government [TIN2016-77836-C2-2-R]
- Fundação para a Ciência e a Tecnologia [PTDC/EEI-SCR/6945/2014] Funding Source: FCT
Ask authors/readers for more resources
Community networks (CNs) have seen an increase in the last fifteen years. Their members contact nodes which operate Internet proxies, web servers, user file storage and video streaming services, to name a few. Detecting communities of nodes with properties (such as co-location) and assessing node eligibility for service placement is thus a key-factor in optimizing the experience of users. We present a novel solution for the problem of service placement as a two-phase approach, based on: 1) community finding using a scalable graph label propagation technique and 2) a decentralized election procedure to address the multi-objective challenge of optimizing service placement in CNs. Herein we: i) highlight the applicability of leader election heuristics which are important for service placement in community networks and scheduler-dependent scenarios; ii) present a parallel and distributed solution designed as a scalable alternative for the problem of service placement, which has mostly seen computational approaches based on centralization and sequential execution.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available