some advanced features

for the routing process, 如果找不到，應該發到最遠得鄰居，可目前得問題是怎麽保存最遠得鄰居.我想了一個辦法就是把query加上一個經過得hop list，比如 query was sent by A, forward to B, and then to C.... until it arrives X, say it has 10 hops in between, then X knows A is 10 hops away from it. So it add A as a 10 hops away neighbour. similarly, it can keep some 5, or 8 hops away neighbour. Assume the current radius is 5, When it cannot find match in its routing table. it can should forward the query to its 8 or 10 hops away neighbour, because the 1-5 hops neighbour for sure don't have the match. so it don't need waste the time. How do you think of it? Also this way, can avoid a query forward a node already be forwarded.就是碰到了，就記下來是 記下來也可能變,那當然了，不過還可以更新啊，下次又有一個query過來，再記下一個,總記最新得