Peer clustering and firework query model in peer-to-peer networks.

Ng, Cheuk Hang.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.Includes bibliographical references (leaves 89-95).Abstracts in English and Chinese.Abstract --- p.iiAcknowledgement --- p.ivChapter 1 --- Introduction --- p.1Chapter 1.1 --- Problem Definition --- p.2Chapter 1.2 --- Main Contributions --- p.4Chapter 1.3 --- Thesis Organization --- p.5Chapter 2 --- Background --- p.6Chapter 2.1 --- Background of Peer-to-Peer --- p.6Chapter 2.2 --- Background of Content-Based Image Retrieval System --- p.9Chapter 2.3 --- Literature Review of Peer-to-Peer Application --- p.10Chapter 2.4 --- Literature Review of Discovery Mechanisms for Peer-to-Peer Applications --- p.13Chapter 2.4.1 --- Centralized Search --- p.13Chapter 2.4.2 --- Distributed Search - Flooding --- p.15Chapter 2.4.3 --- Distributed Search - Distributed Hash Table --- p.21Chapter 3 --- Peer Clustering and Firework Query Model --- p.25Chapter 3.1 --- Peer Clustering --- p.26Chapter 3.1.1 --- Peer Clustering - Simplified Version --- p.27Chapter 3.1.2 --- Peer Clustering - Single Cluster Version --- p.29Chapter 3.1.3 --- "Peer Clustering - Single Cluster, Multiple Layers of Con- nection Version" --- p.34Chapter 3.1.4 --- Peer Clustering - Multiple Clusters Version --- p.35Chapter 3.2 --- Firework Query Model Over Clustered Network --- p.38Chapter 4 --- Experiments and Results --- p.43Chapter 4.1 --- Simulation Model of Peer-to-Peer Network --- p.43Chapter 4.2 --- Performance Metrics --- p.45Chapter 4.3 --- Experiment Results --- p.47Chapter 4.3.1 --- Performances in different Number of Peers in P2P Network --- p.47Chapter 4.3.2 --- Performances in different TTL value of query packet in P2P Network --- p.52Chapter 4.3.3 --- "Performances in different different data sets, synthetic data and real data" --- p.55Chapter 4.3.4 --- Performances in different number of local clusters of each peer in P2P Network --- p.58Chapter 4.4 --- Evaluation of different clustering algorithms --- p.64Chapter 5 --- Distributed COntent-based Visual Information Retrieval (DIS- COVIR) --- p.67Chapter 5.1 --- Architecture of DISCOVIR and Functionality of DISCOVIR Components --- p.68Chapter 5.2 --- Flow of Operations --- p.72Chapter 5.2.1 --- Preprocessing (1) --- p.73Chapter 5.2.2 --- Connection Establishment (2) --- p.75Chapter 5.2.3 --- "Query Message Routing (3,4,5)" --- p.75Chapter 5.2.4 --- "Query Result Display (6,7)" --- p.78Chapter 5.3 --- Gnutella Message Modification --- p.78Chapter 5.4 --- DISCOVIR EVERYWHERE --- p.81Chapter 5.4.1 --- Design Goal of DISCOVIR Everywhere --- p.82Chapter 5.4.2 --- Architecture and System Components of DISCOVIR Ev- erywhere --- p.83Chapter 5.4.3 --- Flow of Operations --- p.84Chapter 5.4.4 --- Advantages of DISCOVIR Everywhere over Prevalent Web-based Search Engine --- p.86Chapter 6 --- Conclusion --- p.87Bibliography --- p.8

Content-based image retrieval: reading one's mind and helping people share.

Sia Ka Cheung.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.Includes bibliographical references (leaves 85-91).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.ivChapter 1 --- Introduction --- p.1Chapter 1.1 --- Problem Statement --- p.1Chapter 1.2 --- Contributions --- p.3Chapter 1.3 --- Thesis Organization --- p.4Chapter 2 --- Background --- p.5Chapter 2.1 --- Content-Based Image Retrieval --- p.5Chapter 2.1.1 --- Feature Extraction --- p.6Chapter 2.1.2 --- Indexing and Retrieval --- p.7Chapter 2.2 --- Relevance Feedback --- p.7Chapter 2.2.1 --- Weight Updating --- p.9Chapter 2.2.2 --- Bayesian Formulation --- p.11Chapter 2.2.3 --- Statistical Approaches --- p.12Chapter 2.2.4 --- Inter-query Feedback --- p.12Chapter 2.3 --- Peer-to-Peer Information Retrieval --- p.14Chapter 2.3.1 --- Distributed Hash Table Techniques --- p.16Chapter 2.3.2 --- Routing Indices and Shortcuts --- p.17Chapter 2.3.3 --- Content-Based Retrieval in P2P Systems --- p.18Chapter 3 --- Parameter Estimation-Based Relevance Feedback --- p.21Chapter 3.1 --- Parameter Estimation of Target Distribution --- p.21Chapter 3.1.1 --- Motivation --- p.21Chapter 3.1.2 --- Model --- p.23Chapter 3.1.3 --- Relevance Feedback --- p.24Chapter 3.1.4 --- Maximum Entropy Display --- p.26Chapter 3.2 --- Self-Organizing Map Based Inter-Query Feedback --- p.27Chapter 3.2.1 --- Motivation --- p.27Chapter 3.2.2 --- Initialization and Replication of SOM --- p.29Chapter 3.2.3 --- SOM Training for Inter-query Feedback --- p.31Chapter 3.2.4 --- Target Estimation and Display Set Selection for Intra- query Feedback --- p.33Chapter 3.3 --- Experiment --- p.35Chapter 3.3.1 --- Study of Parameter Estimation Method Using Synthetic Data --- p.35Chapter 3.3.2 --- Performance Study in Intra- and Inter- Query Feedback . --- p.40Chapter 3.4 --- Conclusion --- p.42Chapter 4 --- Distributed COntent-based Visual Information Retrieval --- p.44Chapter 4.1 --- Introduction --- p.44Chapter 4.2 --- Peer Clustering --- p.45Chapter 4.2.1 --- Basic Version --- p.45Chapter 4.2.2 --- Single Cluster Version --- p.47Chapter 4.2.3 --- Multiple Clusters Version --- p.51Chapter 4.3 --- Firework Query Model --- p.53Chapter 4.4 --- Implementation and System Architecture --- p.57Chapter 4.4.1 --- Gnutella Message Modification --- p.57Chapter 4.4.2 --- Architecture of DISCOVIR --- p.59Chapter 4.4.3 --- Flow of Operations --- p.60Chapter 4.5 --- Experiments --- p.62Chapter 4.5.1 --- Simulation Model of the Peer-to-Peer Network --- p.62Chapter 4.5.2 --- Number of Peers --- p.66Chapter 4.5.3 --- TTL of Query Message --- p.70Chapter 4.5.4 --- Effects of Data Resolution on Query Efficiency --- p.73Chapter 4.5.5 --- Discussion --- p.74Chapter 4.6 --- Conclusion --- p.77Chapter 5 --- Future Works and Conclusion --- p.79Chapter A --- Derivation of Update Equation --- p.81Chapter B --- An Efficient Discovery of Signatures --- p.82Bibliography --- p.8

AC-RDVT: Acyclic Resource Distance Vector Routing Tables for Dynamic Grid Resource Discovery

Since the objective of grid is sharing the numerous and heterogeneous resources, resource discovery is a challenging issue. Recently appeared, Ontosum, is a resource discovery method based on semantically linked organizations and a routing algorithm Resource Distance Vector (RDV), has been presented to forward resource discovery queries into the clusters. Although this framework is efficient for large-scale grids and nodes are clustered automatically based on semantic attributes to constitute a semantically linked overlay network, but the dynamic behavior of grid isn’t considered. In this method, deceptive information is stored in RDV tables (RDVT) which cause some problems in routing process. In this paper, a method is proposed to improve the dynamism of RDV routing algorithm, so the consistency with grid environments is increased. The developed algorithm is assessed by investigating the success probability, number of hops and routing time of resource discovery.DOI:http://dx.doi.org/10.11591/ijece.v3i1.183

Adaptive Overlays in Peer-to-Peer Networks

Drei aktuelle Trends haben neue Perspektiven für die Recherche in Unternehmensdaten geschaffen: Eine Explosion lokal gespeicherter Daten, der Bedarf des Austausches dieser Daten in und zwischen einzelnen Unternehmen und ein zunehmender Kundenwunsch nach einer integrativen Suche in lokalen und entfernten Quellen. Alle drei Aspekte zusammen bewirken einen Marktwert für Dienste der Art 'Integrierte Suche'. Ein wesentlicher Teilaspekt eines unternehmensübergreifenden Suchdienstes ist die Auswahl relevanter Datenquellen, beispielsweise vernetzte Desktops im Unternehmen. Der Mehrwert dieses Dienstes entsteht in der effizienten und geschickten Auswahl von Quellen; der Dienst soll möglichst wenig Quellen anfragen und trotzdem möglichst alle relevanten Quellen finden. Aufgrund der Unübersehbarkeit und Dynamik der Daten sowie der Volatilität und Autonomie der Quellen ist die Entwicklung dieses Dienstes eine besondere Herausforderung für die Informatik. Die vorliegende Dissertation beschreibt einen solchen Dienst am Beispiel von Peer-to-Peer Netzwerken. Inspiriert durch Milgram's Untersuchungen der Small World Netzwerke entwickeln wir eine neue Routing Strategie für ein volatiles Netzwerk, in dem ein Peer eine Person repräsentiert. Aus den Interaktionen der Peers leiten wir zusätzliche Verbindungen im Netzwerk, sogenannte Shortcuts, ab, die jeder Peer lokal in einem Index speichert. Dadurch entsteht ein Overlay Netzwerk, welches eine für das effiziente Routing besonders hilfreiche Anordnung der Peers aufweist: Peers mit ähnlichen Interessen sind direkt miteinander vernetzt. Eine dynamische Kombination von themenspezifischen, vernetzungsabhängigen und zufälligen Routing Strategien entlang der Shortcuts ermöglicht die gezielte und effiziente Auswahl relevanter Quellen mit minimaler Belastung des Netzwerkes und ohne manuelle Unterstützung durch den Benutzer. Für die Verwaltung der lokalen Shortcut Indices entwickeln wir einen neue Indexstrategie. Diese erlaubt die gezielte Aktualisierung lokal gespeicherter Shortcuts und berücksichtigt sowohl Änderungen der Verfügbarkeit von Quellen als auch von Daten im Netzwerk. Die Ergebnisse der vorliegenden Arbeit unterstützen maßgeblich die Entwicklung eines integrierten Suchdienstes. Simulationen zeigen, dass, gegenüber vergleichbaren Ansätzen, der Recall für eine Anfrage deutlich erhöht und die Kosten für eine Anfrage drastisch gesenkt werden. Shortcut Overlay Netzwerke sind robust, sie tolerieren wechselnde Interessen sowie eine hohe Volatilität der Peers. Diese Eigenschaften, kombiniert mit der vollständig lokalen Erstellung, Auswahl und Verwaltung der Indices, machen Shortcut Overlay Netzwerke zu einer sehr vielversprechenden Alternative zu Flooding-basierten Ansätzen oder verteilten Hashtabellen.In research and business currently we notify three key trends: the explosion of unstructured data; the critical need to formally manage content; and internetworking and collaboration within and between enterprises. Peer-to-Peer information systems address the need to access content wherever it resides, to produce content while maintaining control over it, and to collaborate efficiently by sharing real-time data within a distributed network of stakeholders. Enterprises that are highly dependent on sharing real-time information across geographically spread knowledge workers are likely to benefit immediately from peer-to-peer information systems. This thesis focuses on the issue of determining a relevant peer in a completely decentralized and volatile setting without any static peers, such as necessitated by peer-to-peer information systems in virtual organizations. Example applications, such as the networked semantic desktop and legal music sharing, serve as rationale throughout the thesis. We discuss, which routing strategies exist, when they should be used, and -most importantly- how can we enhance their recall and lower their communication costs. The full autonomy of peers as well as the full control of their own resources preclude prominent resource location and query routing schemes, such as distributed hash tables. We propose a new resource location and a semantic query routing approach that exploits social metaphors of topical experts and experts' experts as well as semantic similarity of queries and information sources. The novel design principle of our approach lies in the dynamic adaptation of the network topology, driven by the history of successful or semantically similar queries. This is memorized by using bounded local shortcut indexes storing semantically labelled shortcuts and a dynamic shortcut selection strategy, which forwards queries to a community of peers that are likely to best answer queries. Our results support the development of a completely decentralized peer-to-peer information system significant. Extensive simulations show that the clustering of peers within semantic communities drastically improves the overall performance of our algorithm even in a highly volatile setting, while our index policy locally indices the 'right' peers, that provide resources to the core interests of a requesting peer. Shortcut overlays are robust; they tolerate interests shifts and high network volatility. These attractive properties, combined with the locality preserving design of the index management and peer selection algorithm, pose shortcut overlay networks as a very promising alternative to state of the art semantic routing approaches