安全組：呂建明(存儲(chǔ)版)
【正文】 ? Or all of them ? Difference between them ? A Peer how to find another peer in o(logn) ? How to form the local routing table of peer ? Tapestry /pastry routing table Tapestry /pastry Node 5230 find node 42AD CAN Neighbor :節(jié)點(diǎn)地址除了在某一個(gè)位上數(shù)字相鄰，其它位的數(shù)字都相同： 節(jié)點(diǎn) 0011的鄰居有： 101 011 000 0010 Routing table : IP Address of neighbor set Routing : according the logical ncartesian coordinate space We will use CAN ? 地址 向量 相近的節(jié)點(diǎn)互為鄰居 。 ? 路由特征： 帶啟發(fā)的 廣播查找的過程，啟發(fā)的方法包括 span ring、 degree based、 supper nodes 、routing index、 LSI method、 bloom filter 等等。安全組 : 呂建明 20203 P2P設(shè)計(jì)思想及其 在存儲(chǔ)和共享上的應(yīng)用 outline What is p2p Why p2p How p2p P2p storage and sharing –my work Road map What is p2p a type of work in which each workstation has equivalent capabilities and responsibilities. This differs from client/server architectures, in which some puters are dedicated to serving the others. ――― What is p2p Peertopeer is a munications model in which each party has the same capabilities and either party can initiate a munication session. Other models with which it might be contrasted include the client/server model and the master/slave model。 ? 往往引入集中節(jié)點(diǎn)來提高效率。（ N是總節(jié)點(diǎn)數(shù)） ☆ 這一類的系統(tǒng)包括 CAN、 Tapestry、 Pastry、 kademlia、Chord等 Structured works DHT data3 key3 data2 key2 data1 key1 data0 key0 data14 key14 data13 key13 data12 key12 data11 key11 data10 key10 data9 key9 data8 key8 data7 key7 data6 key6 data5 key5 data4 key4 a b c d e f
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1