GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
SETS: search enhanced by topic segmentation
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Creating social networks to improve peer-to-peer networking
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Enhancing Search Performance on Gnutella-Like P2P Systems
IEEE Transactions on Parallel and Distributed Systems
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Content-based search using self-organizing peer-to-peer network
SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
| Hi-index | 0.00 |
Sharing of content on the internet has become more and more prevalent over the years. As the number of internet users grows exponentially, issues of scale related to content distribution and discovery have become more important. Peer to Peer networks have been proposed as an alternate way to traditional client server models to distribute and search content. While peer to peer networks are better than the client server models for load balancing, they generate a large amount of network traffic either during the content publish phase or during the content search phase or both. In this paper we investigate the power of location aware content groups formed from content links in a distributed manner using content metadata to improve the efficiency and accuracy of content search with the conflicting goal of keeping the network traffic to a minimum. We show by way of simulation the improvement in performance of content search over traditional approaches as in Gnutella