The presentation of such resource search algorithms for structural peer-to-peer（P2P） architecture as Chord

CAN

and Pastry has changed the flooding resource search mode for unstructured P2P architecture and reduced the P2P resource search information flow

thus enhancing the system scalability.However

these algorithms fail to take into consideration of the effects of the practical physical distances between peers on the search path lengths.In this article

a structural search algorithm

called CGC（Combination of Grapes and CBT） based on peer ability and territory is proposed

which combines the advantages of CBT and Grapes and gives full account of the peer regions and capability

thus constructing a P2P system with short search path and compatible peer ability.