Small World Peer Networks in Distributed Web Search

@inproceedings{akavipat:smallworld:2004:www04, abstract = {In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local adaptive routing algorithm used to dynamically change the topology of the peer network based on a simple learning scheme driven by query response interactions among neighbors. We test the algorithm via simulations with 70 model users based on actual Web crawls. We find that the network topology rapidly converges from a random network to a small world network, with emerging clusters that match the user communities with shared interests.}, author = {Akavipat, Ruj and Wu, Leshin and Menczer, Filippo }, booktitle = {13th World Wide Web Conference (WWW2004)}, citeulike-article-id = {507506}, comment = {Summary: The hyphothesis was that it is feasable to organize p2p systems in interest (or topic) clusters. It is also shown that adaptive routing can work. This was validated by simulation based on real serach queries and real content}, keywords = {p2p, smallworld}, month = {May}, posted-at = {2006-02-17 09:31:14}, priority = {0}, title = {Small World Peer Networks in Distributed Web Search}, url = {http://www.www2004.org/proceedings/docs/2p396.pdf}, year = {2004} }

TY - CONF ID - akavipat:smallworld:2004:www04 L3 - citeulike-article-id:507506 TI - Small World Peer Networks in Distributed Web Search T2 - 13th World Wide Web Conference (WWW2004) N2 - In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local adaptive routing algorithm used to dynamically change the topology of the peer network based on a simple learning scheme driven by query response interactions among neighbors. We test the algorithm via simulations with 70 model users based on actual Web crawls. We find that the network topology rapidly converges from a random network to a small world network, with emerging clusters that match the user communities with shared interests. KW - p2p KW - smallworld N1 - Summary: The hyphothesis was that it is feasable to organize p2p systems in interest (or topic) clusters. It is also shown that adaptive routing can work. This was validated by simulation based on real serach queries and real content AU - Akavipat, Ruj AU - Wu, Leshin AU - Menczer, Filippo PY - 2004/05// UR - http://www.www2004.org/proceedings/docs/2p396.pdf ER -