Gelly-scheduling: distributed graph processing for service placement in community networks
| Autor: | Miguel E. Coimbra, Felix Freitag, Mennan Selimi, Alexandre P. Francisco, Luís Veiga |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors, Universitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Optimization
Web server Leader election Distributed solutions Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors [Àrees temàtiques de la UPC] Computació en núvol Computer science Community network Service placement 02 engineering and technology Community networks computer.software_genre Scheduling (computing) 0202 electrical engineering electronic engineering information engineering Cloud computing Computational approach Community clouds business.industry Scheduling 020206 networking & telecommunications Graph Distributed computer systems Video streaming services Service placements Scalability Sequential execution Graph (abstract data type) 020201 artificial intelligence & image processing The Internet business Heuristics computer Computer network |
| Zdroj: | SAC Recercat. Dipósit de la Recerca de Catalunya instname UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|