G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 21:995--1002, August 2003. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Observations on the Dynamic Evolution of Peer-to-Peer.. - Liben-Nowell.. (2002) (3 citations) (Correct)
....an ideal starting state, and do not show how the system returns to this ideal state after the failures; thus, accumulation of failures over time eventually disrupts the system. See, e.g. 1, 3, 4, 5, 6] Perhaps the closest to our evolutionary analysis is the recent work of Pandurangan et al. [2], who study a centralized, flooding based P2P protocol. Using a Poisson arrival departure model, they show that their protocol results in an overlay network whose diameter remains logarithmic, with high probability. However, their scheme does not solve the problem of routing within the P2P ....
....at time t. Finally, the half life of the entire system is the minimum half life over all times t. Intuitively, a half life of means that after time t , only half the state of the system can be extrapolated from its state at time t. For example, consider a Poisson model of arrivals departures [2]: nodes arrive according to a Poisson process with rate , while each node in the system departs independently according to an exponential distribution with rate parameter (i.e. expected node lifetime is 1= If there are N nodes in the system at time t, then the expected doubling time is N= ....
PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. Building low-diameter peer-to-peer networks. In Proc. FOCS 2001.
Controlling the Cost of Reliability in Peer-to-Peer Overlays - Mahajan, Castro, Rowstron (2003) (19 citations) (Correct)
....join and leave the overlay. Saia et al. use a butterfly network to build an overlay that routes efficiently even with large adversarial failures provided that the network keeps growing [8] Pandurangan et al. present a centralized algorithm to ensure connectivity in the face of node failures [5]. Liben Nowell et al. provide an asymptotic analysis of the cost of maintaining Chord [12] Ledlie et al. [3] present some simulation results of Chord in an idealized model with Poisson arrivals and departures. We too study the overlay maintenance cost in dynamic environments but we provide an exact ....
G. Pandurangan, P. Raghavan, and E. Upfal. Building lowdiameter peer-to-peer networks. In IEEE FOCS, Oct. 2001.
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary.. - Ganesan, Sun, Garcia-Molina (2003) (6 citations) (Correct)
....Hence, frequent network topology changes have very little impact on performance. Moreover, these systems can operate on any type of P2P overlay network, thus allowing others to construct an optimal overlay. For example, Raghavan suggested a low diameter overlay with high connectivity in [3]; Cohen suggested constructing overlays where nodes with similar content are neighbors in [4] When there are significant bandwidth differences between clients, Morpheus [5] a client using FastTrack) changes the topology so that high bandwidth super peers are at the core of the overlay and low ....
G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter peer-to-peer networks," in Proceedings of 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001.
Observations on the Dynamic Evolution of Peer-to-Peer.. - Liben-Nowell.. (2002) (3 citations) (Correct)
....an ideal starting state, and do not show how the system returns to this ideal state after the failures; thus, accumulation of failures over time eventually disrupts the system. See, e.g. 1, 3, 4, 5, 6] Perhaps the closest to our evolutionary analysis is the recent work of Pandurangan et al. [2], who study a centralized, flooding based P2P protocol. Using a Poisson arrival departure model, they show that their protocol results in an overlay network whose diameter remains logarithmic, with high probability. However, their scheme does not solve the problem of routing within the P2P ....
....at time t. Finally, the half life of the entire system is the minimum half life over all times t. Intuitively, a half life of # means that after time t # , only half the state of the system can be extrapolated from its state at time t. For example, consider a Poisson model of arrivals departures [2]: nodes arrive according to a Poisson process with rate #, while each node in the system departs independently according to an exponential distribution with rate parameter (i.e. expected node lifetime is 1 ) If there are N nodes in the system at time t, then the expected doubling time is N # ....
PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. Building low-diameter peer-to-peer networks. In Proc. FOCS 2001.
Observations on the Dynamic Evolution of Peer-to-Peer.. - Liben-Nowell.. (2001) (3 citations) (Correct)
....an ideal starting state, and do not show how the system returns to this ideal state after the failures; thus, accumulation of failures over time eventually disrupts the system. See, e.g. 1, 3, 4, 5, 6] Perhaps the closest to our evolutionary analysis is the recent work of Pandurangan et al. [2], who study a centralized, flooding based P2P protocol. Using a Poisson arrival departure model, they show that their protocol results in an overlay network whose diameter remains logarithmic, with high probability. However, their scheme does not solve the problem of routing within the P2P ....
....time . Finally, the half life of the entire system is the minimum half life over all times . Intuitively, a half life of means that after time only half the state of the system can be extrapolated from its state at time For example, consider a Poisson model of arrivals departures [2]: nodes arrive according to a Poisson process with rate , while each node in the system departs independently according to an exponential distribution with rate parameter (i.e. expected node lifetime is ) If there are the system at time , then the expected doubling time and the ....
PANDURANGAN, G., RAGHAVAN, P., AND UPFAL, E. Building low-diameter peer-to-peer networks. In Proc. FOCS 2001.
Active and Concurrent Topology Maintenance - Xiaozhou Li Jayadev (Correct)
No context found.
G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications, 21:995--1002, August 2003.
Tree Vector Indexes: Efficient Range Queries for Dynamic .. - Peer-To-Peer Networks.. (2006) (Correct)
No context found.
G. Pandurangan, P. Raghavan, and E. Upfal. Building lowdiameter peer-to-peer networks. IEEE J. on Selected Areas of Communications, 21(6):995--1002, Aug. 2003.
Survivable Monitoring in Dynamic Networks - Ateniese, Riley, Scheideler (2004) (Correct)
No context found.
G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS '01), 2001.
T-Man: Fast Gossip-based Constructions of Large-Scale.. - Jelasity, Babaoglu (2004) (Correct)
No context found.
G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications (JSAC), 21(6):995--1002, Aug. 2003.
Newscast Computing - Jelasity, Kowalczyk, van Steen (2003) (Correct)
No context found.
G. Pandurangan, P. Raghavan, and E. Upfal, "Building low-diameter peer-to-peer networks," IEEE Journal on Selected Areas in Communications (JSAC), vol. 21, no. 6, pp. 995--1002, Aug. 2003. [Online]. Available: http://www.cs.purdue.edu/homes/gopal/papers.html
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC