Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Brocade: Landmark Routing on Overlay Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
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
Peer-exchange schemes to handle mismatch in peer-to-peer systems
The Journal of Supercomputing
Aurelia: building locality-preserving overlay network over heterogeneous P2P environments
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Exploiting the heterogeneity in structured peer-to-peer systems
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Roogle: supporting efficient high-dimensional range queries in p2p systems
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A practical peer-performance-aware DHT
AP2PC'04 Proceedings of the Third international conference on Agents and Peer-to-Peer Computing
A peer-to-peer expressway over Chord
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
The high heterogeneity of large-scale p2p system leads us to the philosophy that the size of a node’s routing table and its updating cost should correspond to the node’s capacity. With this philosophy, we design a novel structured overlay: SmartBoa. SmartBoa categorizes nodes into different levels according to their capacities. A node at level k has a routing table with N/2k entries (N is the system scale). An efficient non-redundant multicast algorithm is introduced to distribute nodes’ changing reports. With the multicast the routing table’s updating cost is in proportion to its size. Node can change its level freely so as to adapt to fluctuation of the system. At the same cost as the O(log N) overlay, SmartBoa maintains with much larger routing tables and has much higher routing efficiency. A low-bandwidth (64 kbps) node can maintain 10,000 routing entries at the cost of only 10 percent of its bandwidth. Without the high bandwidth requirement of an one-hop overlay, SmartBoa is much more scalable.