Mostra el registre d'ítem simple
Gelly-scheduling: distributed graph processing for service placement in community networks
dc.contributor.author | Coimbra, Miguel E. |
dc.contributor.author | Selimi, Mennan |
dc.contributor.author | Francisco, Alexandre P. |
dc.contributor.author | Freitag, Fèlix |
dc.contributor.author | Veiga, Luis |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2018-10-11T13:32:11Z |
dc.date.issued | 2018 |
dc.identifier.citation | Coimbra, M., Selimi, M., Francisco, A., Freitag, F., Veiga, L. Gelly-scheduling: distributed graph processing for service placement in community networks. A: ACM Symposium on Applied Computing. "The 33rd Annual ACM Symposium on Applied Computing: Pau, France: April 9-13, 2018". New York: Association for Computing Machinery (ACM), 2018, p. 151-160. |
dc.identifier.isbn | 978-1-4503-5191-1 |
dc.identifier.other | https://arxiv.org/abs/1703.10446 |
dc.identifier.uri | http://hdl.handle.net/2117/122253 |
dc.description.abstract | 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. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.publisher | Association for Computing Machinery (ACM) |
dc.subject | Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors |
dc.subject.lcsh | Cloud computing |
dc.subject.other | Community clouds |
dc.subject.other | Community network |
dc.subject.other | Leader election |
dc.subject.other | Service placement |
dc.subject.other | Optimization |
dc.subject.other | Scheduling |
dc.subject.other | Computational approach |
dc.subject.other | Distributed solutions |
dc.subject.other | Leader election |
dc.subject.other | Sequential execution |
dc.subject.other | Service placements |
dc.subject.other | Video streaming services |
dc.subject.other | Distributed computer systems |
dc.title | Gelly-scheduling: distributed graph processing for service placement in community networks |
dc.type | Conference report |
dc.subject.lemac | Computació en núvol |
dc.contributor.group | Universitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts |
dc.identifier.doi | 10.1145/3167132.3167147 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://dl.acm.org/citation.cfm?id=3167147 |
dc.rights.access | Open Access |
local.identifier.drac | 23408657 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/732505/EU/Lightweight Computation for Networks at the Edge/LightKone |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO/1PE/TIN2016-77836-C2-2-R |
local.citation.author | Coimbra, M.; Selimi, M.; Francisco, A.; Freitag, F.; Veiga, L. |
local.citation.contributor | ACM Symposium on Applied Computing |
local.citation.pubplace | New York |
local.citation.publicationName | The 33rd Annual ACM Symposium on Applied Computing: Pau, France: April 9-13, 2018 |
local.citation.startingPage | 151 |
local.citation.endingPage | 160 |