¡@¡@Kademlia[1] provides a concept of using XOR between ID to present logical distance. As Kademlia uses logical distance to search, it cannot take physical distance into consideration, which can lead the result to be the closest in logical, but the farthest in physical.
¡@¡@In this paper, ping rate is used to represent the meaning of physical distance, and construct a physical network in Kademlia. The operations like lookup and search will take logical and physical distance into consideration at the same time, called PRKad.
¡@¡@The simulation result shows that PRKad can actually automatically choose the more efficiency nodes, which means the close nodes in physical network, to decrease the time using of the following operations.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0719112-211845 |
| Date | 19 July 2012 |
| Creators | Lin, Jung-Wei |
| Contributors | Wei-kuang Lai, Ying-Chih Lin, Chun-Hung Lin, Yun-Nan Chang, Shi-Huang Chen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719112-211845 |
| Rights | user_define, Copyright information available at source archive |
Page generated in 0.002 seconds