Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Secure routing for structured peer-to-peer overlay networks
This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
The effect of network topology on the spread of epidemics
- A. Ganesh, L. Massoulié, D. Towsley
- Mathematics, Computer ScienceProceedings IEEE 24th Annual Joint Conference of…
- 13 March 2005
This paper identifies topological properties of the graph that determine the persistence of epidemics and shows that if the ratio of cure to infection rates is larger than the spectral radius of thegraph, then the mean epidemic lifetime is of order log n, where n is the number of nodes.
Peer-to-Peer Membership Management for Gossip-Based Protocols
This paper presents SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership and proposes additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns.
Probabilistic Reliable Dissemination in Large-Scale Systems
- A. Kermarrec, L. Massoulié, A. Ganesh
- Computer ScienceIEEE Trans. Parallel Distributed Syst.
- 1 March 2003
This paper provides a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (the system size, failure rates, and number of gossip targets) and shows how reliability can be maintained while alleviating drawback.
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
This paper presents a novel peer-to-peer membership service which operates in a completely decentralized manner in that nobody has global knowledge of membership, and demonstrates that membership information is replicated robustly enough to support gossip with high reliability.
Peer counting and sampling in overlay networks: random walk methods
This article addresses the problem of counting the number of peers in a peer-to-peer system and more generally of aggregating statistics of individual peers over the whole system, and proposes two generic techniques to solve this problem.
Congestion pricing and user adaptation
- A. Ganesh, K. Laevens, R. Steinberg
- Computer ScienceProceedings IEEE INFOCOM . Conference on Computer…
- 22 April 2001
This work proposes a decentralized scheme for user adaptation that uses congestion prices as a mechanism for providing both feedback and incentives to end-systems.
Thresholds for virus spread on networks
This work characterise how the size of the population that eventually becomes infected depends on the network topology, and shows that if the ratio of cure to infection rates is larger than the spectral radius of the graph, and the initial infected population is small, then the finalinfected population is also small in a sense that can be made precise.
How to distribute antidote to control epidemics
We give a rigorous analysis of variations of the contact process on a finite graph in which the cure rate is allowed to vary from one vertex to the next, and even to depend on the current state of…
Modeling the Impact of Buffering on 802.11
A finite load, large buffer model for the WLAN medium access protocol IEEE 802.11 is developed that gives throughput and delay predictions and it is shown that increased buffering can help this inequity, but only at the expense of possibly significantly increased delays.