Scalable peer finding on the Internet
Authors:
- 22 December 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 2205-2209
Abstract
We consider the problem of finding nearby application peers over the Internet. We define a new peer-finding scheme (called Tiers) that scales to large application peer groups. Tiers creates a hierarchy of the peers, which allows an efficient and scalable solution to this problem. The scheme can be implemented entirely in the application-layer and does not require the deployment of either any additional measurement services, or well-known reference landmarks in the network. We present detailed evaluation of Tiers and compare it to one previously proposed scheme called Beaconing. Through analysis and detailed simulations on 10,000 node Internet-like topologies we show that Tiers achieves comparable or better performance with a significant reduction in control overheads for groups of size 32 or more.Keywords
This publication has 12 references indexed in Scilit:
- Finding close friends on the Internet2005
- Application-layer anycasting2002
- A network measurement architecture for adaptive applications2002
- Scalable application layer multicast2002
- A scalable content-addressable networkACM SIGCOMM Computer Communication Review, 2001
- Chord2001
- Bayeux2001
- A framework for scalable global IP-anycast (GIA)2000
- A case for end system multicast (keynote address)ACM SIGMETRICS Performance Evaluation Review, 2000
- An architecture for a global Internet host distance estimation service1999