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 ...
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...