A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple yet effective mechanism to solve the problem. However, they have to cope with the dynamics either of the network and the values being aggregated and thus have to integrate specific solutions to deal with them. The contribution of this paper is to analyze and compare three different solutions to handle network and values dynamics in gossip-based aggregation schemes: (i) an epoch-based approach based on periodic restarts, (ii) an optimized epoch-based approach based on concurrent aggregation threads and (iii) an original approach based on values evaporation that does not require periodic restarts. Experimental results show that our proposal is effective and often more accurate than epoch-based techniques

Handling Dynamics in Gossip-based Aggregation Schemes / Bicocchi, Nicola; Mamei, Marco; Zambonelli, Franco. - STAMPA. - (2009), pp. 380-385. (Intervento presentato al convegno IEEE Symposium on Computers and Communications 2009, ISCC 2009 tenutosi a Sousse, tun nel July 5-8, 2009) [10.1109/ISCC.2009.5202291].

Handling Dynamics in Gossip-based Aggregation Schemes

BICOCCHI, Nicola;MAMEI, Marco;ZAMBONELLI, Franco
2009

Abstract

A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple yet effective mechanism to solve the problem. However, they have to cope with the dynamics either of the network and the values being aggregated and thus have to integrate specific solutions to deal with them. The contribution of this paper is to analyze and compare three different solutions to handle network and values dynamics in gossip-based aggregation schemes: (i) an epoch-based approach based on periodic restarts, (ii) an optimized epoch-based approach based on concurrent aggregation threads and (iii) an original approach based on values evaporation that does not require periodic restarts. Experimental results show that our proposal is effective and often more accurate than epoch-based techniques
2009
IEEE Symposium on Computers and Communications 2009, ISCC 2009
Sousse, tun
July 5-8, 2009
380
385
Bicocchi, Nicola; Mamei, Marco; Zambonelli, Franco
Handling Dynamics in Gossip-based Aggregation Schemes / Bicocchi, Nicola; Mamei, Marco; Zambonelli, Franco. - STAMPA. - (2009), pp. 380-385. (Intervento presentato al convegno IEEE Symposium on Computers and Communications 2009, ISCC 2009 tenutosi a Sousse, tun nel July 5-8, 2009) [10.1109/ISCC.2009.5202291].
File in questo prodotto:
File Dimensione Formato  
ISCC09-bicocchi.pdf

Accesso riservato

Tipologia: Versione originale dell'autore proposta per la pubblicazione
Dimensione 186.34 kB
Formato Adobe PDF
186.34 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/851936
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact