Implications of query caching for JXTA peers

  • Rozlina Mohamed

Student thesis: Doctoral ThesisDoctor of Philosophy

Abstract

This dissertation studies the caching of queries and how to cache in an efficient way, so that retrieving previously accessed data does not need any intermediary nodes between the data-source peer and the querying peer in super-peer P2P network. A precise algorithm was devised that demonstrated how queries can be deconstructed to provide greater flexibility for reusing their constituent elements. It showed how subsequent queries can make use of more than one previous query and any part of those queries to reconstruct direct data communication with one or more source peers that have supplied data previously. In effect, a new query can search and exploit the entire cached list of queries to construct the list of the data locations it requires that might match any locations previously accessed. The new method increases the likelihood of repeat queries being able to reuse earlier queries and provides a viable way of by-passing shared data indexes in structured networks. It could also increase the efficiency of unstructured networks by reducing traffic and the propensity for network flooding. In addition, performance evaluation for predicting query routing performance by using a UML sequence diagram is introduced. This new method of performance evaluation provides designers with information about when it is most beneficial to use caching and how the peer connections can optimize its exploitation.
Date of Award16 Jul 2014
LanguageEnglish
SupervisorChristopher Buckingham (Supervisor)

Keywords

  • peer-to-peer
  • super-peer network
  • query routing
  • query caching
  • UML sequence diagram

Cite this

Implications of query caching for JXTA peers
Mohamed, R. (Author). 16 Jul 2014

Student thesis: Doctoral ThesisDoctor of Philosophy