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
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Maisie: A Language for the Design of Efficient Discrete-Event Simulations
IEEE Transactions on Software Engineering
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
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
On the scalability of rendezvous-based location services for geographic wireless ad hoc routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
With network pipes growing fatter, peer to peer systems are fast emerging as a viable alternative to the client-server model. One of the major problems in P2P networks is the efficient and fast content distribution and search. In this paper we investigate the problem of replicating content information among the peer nodes in a scalable manner using coordinate based placement such that an automatic identification of near by replica locator nodes is possible to improve the search latency when finding content sources. We also investigate the use of social groups as content information aggregators to facilitate faster and more accurate search. We try to improve the overall accessibility of content in the network by hierarchically distributing the content information. We show by way of simulation the improvement in performance of content location using the above methods.