Abstract
Analyzing the existing P2P (peer to peer) routing algorithms, Flabellate Addressable Network (FAN) routing algorithm, an efficient second-moment-based resource routing algorithm supporting multi-dimensional resource description is proposed. Peers are mapped into a multi-dimensional Cartesian space with FAN routing algorithm that manages the subspaces and searches resources based on the peers' second-moment. The routing efficiency of FAN algorithm is up to O(log(N/k)). When a peer joins and leaves the FAN network, the cost for updating routing messages is O(klog(N/k)). The experimental results show that FAN routing algorithm has advantages of high efficiency of routing and low cost of network maintenance, and is an efficient structured P2P resource routing algorithm supporting multi-dimensional resource description. Some improved routing algorithms based on CAN (content-addressable network) can also be implemented in FAN network, and they can obtain better routing efficiency and lower maintenance cost.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
