Name
Abstract | ||
|---|---|---|
This paper presents the design and evaluation of FastAd,a fast and highly adaptive peer-to-peer(P2P) lookup systemfor medium-scale network where the number of nodes is notmore than tens of thousands. Using routing tables largerthan those of previous schemes, a lookup can be performedat just two hops, while maintenance cost of tables can beminimized by adopting lazy consistency with piggybacking.In addition, assigning dynamic node idetifier(nodeId) insteadof a fixed nodeId by hashing the node's IP address,FastAd network can be organized more adaptively and adjusteddynamically with system state such as load distribution,node dynamics, and so on. As a result, each node hasdifferent responsibility to exploit its heterogeneity. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ISCC.2003.1214252 | ISCC |
Keywords | Field | DocType |
lazy consistency,lookup systemfor medium-scale network,adaptive peer-to-peer,dynamic node idetifier,load distribution,ip address,fastad network,node dynamic,highly adaptive peer-to-peer lookup,fixed nodeid,node hasdifferent responsibility,medium-scale network,internet,p2p | Piggybacking (Internet access),Ip address,Peer-to-peer,Identifier,Computer science,Computer network,Exploit,Hash function,Routing table,The Internet,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-1346 | 0-7695-1961-X | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| jaesun han | 1 | 0 | 0.34 |
| Keuntae Park | 2 | 50 | 5.14 |
| woojin kim | 3 | 0 | 0.34 |
| Daeyeon Park | 4 | 161 | 27.12 |