P2P Lookup Protocol of Tree-based Balanced Routing
Ming Chen · Jisuanji gongcheng · 2008
P2P lookup protocol based on DHT has become a hot-spot field. Focusing on the problem of hot spots and inefficient routing, a new tree-based lookup protocol Treed is presented. Treed introduces landmark in order to divide nodes into different regions, and constructs lookup tree according to landmark region. The experimental results show that Treed is highly effective in distributing routing traffic, and significantly reduces lookup latency.