Implications of query caching for JXTA peers

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

筑波大学計算科学研究センター 平成21年度 年次報告書

1.平成21年度 基本方針、重点施策・改善目標等　……　42.平成21年度 実績報告　……　71.素粒子宇宙研究部門　……　131.1.素粒子分野　……　131.2.宇宙分野　……　262.物質生命研究部門　……　482.1.物質工学理論グループ　……　482.2.生命物理グループ　……　552.3.計算物性グループ　……　662.4.原子核理論グループ　……　803.地球生物環境研究部門　……　883.1.地球環境学分野　……　883.2.生物分野　……　964.超高速計算システム研究部門　……　1025.計算情報学研究部門　……　1105.1.計算知能分野　……　1105.2.計算メディア分野　……　12