50 search results - page 2 / 10 » Scaling all-pairs overlay routing |
CCR
2008
13 years 5 months ago
2008
Conventional wisdom has held that routing protocols cannot achieve both scalability and high availability. Despite scaling relatively well, today's Internet routing system do...
GCC
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
HOTOS
2003
IEEE
13 years 10 months ago
2003
IEEE
Current peer-to-peer lookup algorithms have been designed with the assumption that routing information at each member node must be kept small, so that the bookkeeping required to ...
NSDI
2004
13 years 6 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
Tulip is an overlay for routing, searching and publish-lookup information sharing. It offers a unique combination of the advantages of both structured and unstructured overlays, t...