Mostra el registre d'ítem simple
Socially aware microcloud service overlay optimization in community networks
dc.contributor.author | Silvestre Apolonia, Nuno Miguel |
dc.contributor.author | Freitag, Fèlix |
dc.contributor.author | Navarro Moldes, Leandro |
dc.contributor.author | Girdzijauskas, Sarunas |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2019-10-17T08:17:39Z |
dc.date.available | 2020-09-11T00:25:37Z |
dc.date.issued | 2019-09-11 |
dc.identifier.citation | Silvestre, N. [et al.]. Socially aware microcloud service overlay optimization in community networks. "Software. Practice and experience", 11 Setembre 2019, vol. 50, núm. 5, p. 675-687. |
dc.identifier.issn | 0038-0644 |
dc.identifier.uri | http://hdl.handle.net/2117/170302 |
dc.description.abstract | Community networks are a growing network cooperation effort by citizens to build and maintain Internet infrastructure in regions that are not available. Adding that, to bring cloud services to community networks (CNs), microclouds were started as an edge cloud computing model where members cooperate using resources. Therefore, enhancing routing for services in CNs is an attractive paradigm that benefits the infrastructure. The problem is the growing consumption of resources for disseminating messages in the CN environment. This is because the services that build their overlay networks are oblivious to the underlying workload patterns that arise from social cooperation in CNs. In this paper, we propose Select in Community Networks (SELECTinCN), which enhances the overlay creation for pub/sub systems over peer-to-peer (P2P) networks. Moreover, SELECTinCN includes social information based on cooperation within CNs by exploiting the social aspects of the community of practice. Our work organizes the peers in a ring topology and provides an adaptive P2P connection establishment algorithm, where each peer identifies the number of connections needed based on the social structure and user availability. This allows us to propagate messages using a reduced number of hops, thus providing an efficient heuristic to an NP-hard problem that maps the workload graph to the structured P2P overlays resulting in a number of messages close to the theoretical minimum. Experiments show that, by using social network information, SELECTinCN reduces the number of relay nodes by up to 89% using the community of practice information versus the state-of-the-art pub/sub notification systems given as baseline. |
dc.format.extent | 14 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures distribuïdes |
dc.subject.lcsh | Peer-to-peer architecture (Computer networks) |
dc.subject.lcsh | Computational complexity |
dc.subject.lcsh | Electronic data processing -- Distributed processing |
dc.subject.other | Community networks |
dc.subject.other | Community of practice |
dc.subject.other | Microclouds |
dc.subject.other | P2P overlay networks |
dc.subject.other | Social networks |
dc.title | Socially aware microcloud service overlay optimization in community networks |
dc.type | Article |
dc.subject.lemac | Xarxes punt a punt (Xarxes d'ordinadors) |
dc.subject.lemac | Complexitat computacional |
dc.subject.lemac | Processament distribuït de dades |
dc.contributor.group | Universitat Politècnica de Catalunya. CNDS - Xarxes de Computadors i Sistemes Distribuïts |
dc.identifier.doi | 10.1002/spe.2750 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.2750 |
dc.rights.access | Open Access |
local.identifier.drac | 25872481 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Silvestre, N.; Freitag, F.; Navarro, L.; Girdzijauskas, S. |
local.citation.publicationName | Software. Practice and experience |
local.citation.volume | 50 |
local.citation.number | 5 |
local.citation.startingPage | 675 |
local.citation.endingPage | 687 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [107]