Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The design and implementation of a next generation name service for the internet
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Nondeterministic Queries in a Relational Grid Information Service
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
The main name system: an exercise in centralized computing
ACM SIGCOMM Computer Communication Review
Load Balancing with Multiple Hash Functions in Peer-to-Peer Networks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Phalanx: withstanding multimillion-node botnets
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Proceedings of the 15th ACM conference on Computer and communications security
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Proxy View of Quality of Domain Name Service, Poisoning Attacks and Survival Strategies
ACM Transactions on Internet Technology (TOIT)
| Hi-index | 0.00 |
This paper indicates that a scalable fault-tolerant name service can be provided utilizing an overlay network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying overlay network to scale. Finally, we observe that the overlay network is sensitive to bandwidth and CPU limitations.