Title :
Advanced routing algorithm based on Cycloid model for P2P network
Author_Institution :
Dept. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China
Abstract :
Structured P2P network is a hot spot in recent researches. Structured P2P network routing problem is the most important. In this paper, due to the structure of Cycloid Model of P2P network routing algorithm in the cubical neighbor selection is too simple and low efficiency, we propose an improved algorithm. By using successive approximation technique and creating neighbor cycle routing table technology, improve routing efficiency and greatly reduce the average routing delay.
Keywords :
peer-to-peer computing; telecommunication network routing; Cycloid Model; P2P network routing algorithm; cubical neighbor selection; neighbor cycle routing table technology; successive approximation technique; Algorithm design and analysis; Approximation algorithms; Computational modeling; Delay; Hypercubes; Peer to peer computing; Routing; Cycloid model; P2P; cubical neighbor; cyclic neighbor; routing algorithm; routing table;
Conference_Titel :
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-1-61284-485-5
DOI :
10.1109/ICCSN.2011.6013568
