Title :
A fast and highly adaptive peer-to-peer lookup system for medium-scale network
Author :
Han, Jaesun ; Park, Keuntae ; Kim, Woojin ; Park, Daeyeon
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea
Abstract :
This paper presents the design and evaluation of FastAd, a fast and highly adaptive peer-to-peer (P2P) lookup system for medium-scale network where the number of nodes is not more than tens of thousands. Using routing tables larger than those of previous schemes, a lookup can be performed at just two hops, while maintenance cost of tables can be minimized by adopting lazy consistency with piggybacking. In addition, assigning dynamic node identifier (nodeId) instead of a fixed nodeId by hashing the node´s IP address, FastAd network can be organized more adaptively and adjusted dynamically with system state such as load distribution, node dynamics, and so on. As a result, each node has different responsibility to exploit its heterogeneity.
Keywords :
Internet; computer network management; file organisation; table lookup; FastAd lookup system; adaptive organization; distributed hash table; dynamic adjustment; dynamic node identifier; lazy consistency; medium-scale network; node IP address hashing; peer-to-peer lookup system; piggybacking; routing tables; Adaptive systems; Cascading style sheets; Costs; Internet; Job design; Particle measurements; Peer to peer computing; Routing; Scalability; Web server;
Conference_Titel :
Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on
Print_ISBN :
0-7695-1961-X
DOI :
10.1109/ISCC.2003.1214252
