Papers by Gopal Pandurangan
A wireless sensor network consists of a large number of small, resource-constrained devices and u... more A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Computing aggregates such as average, minimum, maximum and sum is fundamental to various primitive functions of a sensor network like system monitoring, data querying, and collaborative information processing. In this paper we present
ISCA International Conference on Parallel and Distributed Computing Systems, 2006
The decentralized and ad hoc nature of peer-to- peer (P2P) networks means that both the structure... more The decentralized and ad hoc nature of peer-to- peer (P2P) networks means that both the structure of the network, and the content stored within it are highly variable. Real-world studies indicate that only a small number of peers remain persistent over significant time periods, and that the perceived importance of objects stored in the network, measured in terms of access
Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures - SPAA '12, 2012
Microsensors operate under severe energy constraints. Depending on the application, sensors can b... more Microsensors operate under severe energy constraints. Depending on the application, sensors can be thrown randomly in an area of interest ("sprinkled in a field") or, in some cases, can be manually placed in specific positions. The sensor network is typically ad hoc, formed by local self-configuration. Data-centric routing is a new use- ful paradigm for energy-constrained sensor networks. The data
We study randomized gossip-based processes in dynamic networks that are motivated by discovery pr... more We study randomized gossip-based processes in dynamic networks that are motivated by discovery processes in large-scale distributed networks like peer-to-peer or social networks. A well-studied problem in peer-to-peer networks is the resource discovery problem. There, the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network - new edges are added to the network - and the process continues in the changed network. Rigorously analyzing such dynamic (stochastic) processes with a continuously self-changing topology remains a challenging problem with obvious applications. This paper studies and analyzes two natural gossip-based discovery processes. In the push process, each node repeatedly chooses two random neighbors and puts them in contact (i.e., "pushes"...
Distributed Computing, 2015
Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99, 1999
Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures - SPAA '13, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014
Proceedings of the 2014 ACM symposium on Principles of distributed computing - PODC '14, 2014
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11, 2011
Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10, 2010
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Journal of Computer and System Sciences, 2015
ABSTRACT Motivated by the need for robust and fast distributed computation in highly dynamic Peer... more ABSTRACT Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to design fast algorithms (running in a small number of rounds) that guarantee, despite high node churn rate, that almost all nodes reach a stable agreement. Our main contributions are randomized distributed algorithms that guarantee stable almost-everywhere agreement with high probability even under high adversarial churn in number of rounds that is polylogarithmic in n, where n is the stable network size. In particular, we present the following results:
Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13, 2013
Lecture Notes in Computer Science, 2014
Uploads
Papers by Gopal Pandurangan