Related Experiment Videos
Super-proximity routing in structured peer-to-peer overlay networks
Zeng-de Wu1, Wei-xiong Rao, Fan-yuan Ma
1Department of Computer Science & Engineering, Shanghai Jiaotong University, Shanghai 200030, China. wu-zd@cs.sjtu.edu.cn
Journal of Zhejiang University. Science
|December 10, 2003
Summary
Super-proximity routing algorithms enhance Peer-to-Peer (P2P) network efficiency by integrating Internet topology with overlay routing tables. This approach significantly improves data routing performance in structured P2P systems.
Area of Science:
- Computer Science
- Network Engineering
Background:
- Peer-to-Peer (P2P) systems are increasingly prevalent internet applications.
- Structured P2P overlay networks rely on identifier-based routing for robustness and efficient lookups.
- Current identifier-based routing methods often lack efficiency due to their independence from Internet topology.
Purpose of the Study:
- To improve the routing efficiency of structured Peer-to-Peer overlay networks.
- To introduce novel routing algorithms that leverage both network topology and overlay routing information.
Main Methods:
- Development of super-proximity routing algorithms.
- Integration of Internet topology awareness into the next-hop selection process.
- Combination of overlay routing tables with topological data for routing decisions.
Main Results:
- Experimental results demonstrate significant improvements in P2P routing efficiency.
- The proposed algorithms effectively utilize Internet topology for optimized routing.
- Enhanced performance in terms of speed and resource utilization for P2P data routing.
Conclusions:
- Super-proximity routing algorithms offer a substantial enhancement over traditional identifier-based routing in P2P networks.
- Combining Internet topology with overlay routing is a viable strategy for efficient P2P communication.
- The presented algorithms address the efficiency limitations of topology-agnostic P2P routing.