Dynamic computations in ever-changing networks

Authors:
Idit Keidar
Affiliations:
Technion, Haifa, Israel
Venue:
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Year:
2011

Citing 2
Cited 0

Correctness of gossip-based membership under message loss

Proceedings of the 28th ACM symposium on Principles of distributed computing
LiMoSense --- live monitoring in dynamic sensor networks

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities

Quantified Score

Hi-index	0.00

Visualization

Abstract

This talk focuses on dynamic computations (sometimes called live, on-going, continuous, or stabilizing), which continuously adapt their output to reflect input and network topology changes. Three specific examples are discussed: continuous weighted matching, live monitoring, and peer sampling (also called gossip-based membership). Such computations are of interest in ever-changing networks, where the network topology itself (nodes and links) constantly changes, as do the inputs to the computation, e.g., sensor reads. Everchanging networks occur in many settings nowadays, including ad-hoc, vehicular, and sensor networks, social networks, and clouds spanning multiple data-centers.