Loading...

Exploiting Locality Properties of Nodes for Improving Search Efficiency in P2P Networks

Hariri, Negar | 2009

657 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 39600 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Habibi, Jafar
  7. Abstract:
  8. The Use of peer-to-peer architectures instead of traditional client-server architecture can be beneficial in many aspects such as increasing scalability of the systems, enhancing fault tolerance in critical situations, extending the system resources and various other advantages. Nowadays, many applications are based on peer-to-peer architectures and as a result, a large portion of the internet traffic is produced by these applications. This has been a motivation to many researchers to focus on reducing the amount of this traffic while satisfying the content distribution demands. One of the main problems that can result in generating large amount of traffic and also long response times for users’ queries is the topology mismatch between the overlay network and the underlying physical network. In this case, the neighboring nodes in the peer-to-peer network might be located far away from each other in the underlying network. In this dissertation, the round trip time of message communication between two nodes is used as the criteria for distance calculation. Hence, if the peer-to-peer network is not congruent with the underlying network, the average message communication time between adjacent nodes might be quite high. In order to solve this problem, we change the construction process of the peer-to-peer networks to take the distances between nodes into account and use it to enhance the queries response times and to reduce the traffic. We have also investigated this problem in both structured and unstructured networks and a solution has been proposed for each of them. The main goal of the proposed approaches is to localize search traffic in order to reduce the length of the traversed path by each message. Our simulations show that using our solutions can significantly enhance the query efficiency in peer-to-peer networks
  9. Keywords:
  10. Peer-to-Peer Network ; Structured Network ; Unstructured Network ; Location Aware Algorithm ; Search Efficiency

 Digital Object List

 Bookmark

No TOC