Skip to main content

Table 1 An overview of related decentralized mechanisms to DIAS

From: A generic and adaptive aggregation service for large-scale decentralized networks

 

Aggregation

Aggregation

Interaction

Storage

 

function

values

requirements

requirements

DIAS

any

highly dynamic

dissemination

bloom filters

   

and collection

 
 

SUMMATIONa, COUNT,

   

(Ahmed et al. 2006)

AVERAGE, STANDARD,

dynamic

flooding, gossiping or

counting sketches

 

deviation b

 

random walks

 

(xHaridasan and van Renesse 2008)

distribution of

static

gossiping

synopsis diffusion

 

aggregation values

   

(Jelasity et al. 2005)

AVERAGE, COUNTc,

static,

gossiping

hash maps for count

 

summation a

recomputations

  
 

algorithm variations

   
 

for MINIMUM,

   

(Kashyap et al. 2006)

MAXIMUM, SUMMATION,

static

group formation and

synopsis diffusion

 

AVERAGE, RANK

 

gossiping

 
 

algorithm variations

   

(Kempe et al. 2003)

for SUMMATION,

static

gossiping

synopsis diffusion

 

AVERAGE and quantiles

   

(Nath et al. 2008)

SUMMATION,

static

ring/tree topologies,

synopsis diffusion

 

COUNT

 

flooding

 

(Ogston and Jarvis 2010)

SUMMATION d

dynamic

tree topology

parent and

 

queries

  

children

  1. aIt is derived by the average and count aggregates. bIt is derived by the summation and its squares. cIt is computed using the ‘inverse birthday paradox’ as explained in Section “Problem description”. dOthers aggregates could be potentially computed.