Results 1 - 8 of 8

The essence of P2P: A reference architecture for overlay networks

by Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas Girdzijauskas, Manfred Hauswirth, Seif Haridi - IN P2P2005, THE 5TH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING , 2005
"... The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specic attention from both developers and researchers. A wide variety of algorithms, data structures, and archite ..."
Abstract - Cited by 38 (7 self) - Add to MetaCart
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specic attention from both developers and researchers. A wide variety of algorithms, data structures, and architectures have been proposed. The terminologies and abstractions used, however, have become quite inconsistent since the P2P paradigm has attracted people from many different communities, e.g., networking, databases, distributed systems, graph theory, complexity theory, biology, etc. In this paper we propose a reference model for overlay networks which is capable of modeling different approaches in this domain in a generic manner. It is intended to allow researchers and users to assess the properties of concrete systems, to establish a common vocabulary for scientic discussion, to facilitate the qualitative comparison of the systems, and to serve as the basis for defining a standardized API to make overlay networks interoperable.
(Show Context)

How to Build Google2Google - An (Incomplete) Recipe

by Wolfgang Nejdl - In International Semantic Web Conference , 2004
"... This talk explores aspects relevant for peer-to-peer search infrastructures, which we think are better suited to semantic web search than centralized approaches. It does so in the form of an (incomplete) cookbook recipe, listing necessary ingredients for putting together a distributed search infr ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
This talk explores aspects relevant for peer-to-peer search infrastructures, which we think are better suited to semantic web search than centralized approaches. It does so in the form of an (incomplete) cookbook recipe, listing necessary ingredients for putting together a distributed search infrastructure. The reader has to be aware, though, that many of these ingredients are research questions rather than solutions, and that it needs quite a few more research papers on these aspects before we can really cook and serve the final infrastructure. We'll include appropriate references as examples for the aspects discussed (with some bias to our own work at L3S), though a complete literature overview would go well beyond cookbook recipe length limits.
(Show Context)

Paths to Stardom: Calibrating the Potential of a Peer-based Data Management System

by Mihai Lupu, Beng Chin, Ooi Y. C. Tay - In Proc. of SIGMOD , 2008
"... As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database applications. Indexing methods are adapted on top of P2P networks and querying methods are developed to handle the data ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database applications. Indexing methods are adapted on top of P2P networks and querying methods are developed to handle the data distribution on different nodes. These procedures largely depend on how nodes are connected to each other. So far, limited attempts have been made to compare all these systems in a generalized framework. This is because the systems are quite different from each other, and there are so many of them that brute force comparison is practically impossible. Fortunately, it has recently been observed that a large subset of the most important P2P networks share a common algebraic and combinatorial base, in the form of Cayley graphs. The specific requirements of Peer-based Data Management Systems (PDMS), such as query completeness, range queries, load balancing, communication overhead, and scalability are strongly related to the properties of the underlying graphs, and naturally, some graphs are better than others. We conduct a comprehensive graph-theoretic analysis from the point of view of PDMS and identify the necessary conditions for a graph to be considered a potential network structure for a PDMS. In so doing, we provide a basis for the future development of such networks. We complement our analytical study with extensive experimental results and identify three measures that provide significant information about the potential of a [Cayley] graph to support the requirements of a PDMS.
(Show Context)

A Framework for Supporting DBMS-like Indexes in the Cloud Gang Chen

by Hoang Tam Vo, Sai Wu, Beng Chin Ooi, M. Tamer Özsu
"... To support “Database as a service ” (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fas ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
To support “Database as a service ” (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fast location of data distributed over the network. In such a distributed environment, the indexes have to be distributed over the network to achieve scalability and reliability. Each cluster node maintains a subset of the index data. As in conventional DBMS, indexes incur maintenance overhead and the problem is more complex in the distributed environment since the data are typically partitioned and distributed based on a subset of attributes. Further, the distribution of indexes is not straight forward, and there is therefore always the question of scalability, in terms of data volume, network size, and number of indexes. In this paper, we examine the problem of providing DBMS-like indexing mechanisms in cloud DaaS, and propose an extensible, but simple and efficient indexing framework that enables users to define their own indexes without knowing the structure of the underlying network. It is also designed to ensure the efficiency of hopping between cluster nodes during index traversal, and reduce the maintenance cost of indexes. We implement three common indexes, namely distributed hash indexes, distributed B +-tree-like indexes and distributed multi-dimensional indexes, to demonstrate the usability and effectiveness of the framework. We conduct experiments on Amazon EC2 and an in-house cluster to verify the efficiency and scalability of the framework. 1.

A Survey of Semantic Based Peer-to-Peer Systems

by Vijay Srinivas Agneeswaran
"... This paper makes a step in identifying the state of the art in semantic P2P systems. On one hand, lot of research in the P2P systems community has focused on fault-tolerance and scalability, resulting in numberous algorithms, systems such as Chord, Pastry and P-Grid. These systems, however, have no ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper makes a step in identifying the state of the art in semantic P2P systems. On one hand, lot of research in the P2P systems community has focused on fault-tolerance and scalability, resulting in numberous algorithms, systems such as Chord, Pastry and P-Grid. These systems, however, have no notion of semantics and consequently, have difficulty in knowledge sharing. On the other hand, research in the semantic web community have focused on knowledge sharing among different nodes with possibly different schemas. These have tended to use centralized repositories. The obvious benefits of combining P2P and semantic systems would be to have large scale collection of structured data. Several recent efforts have focused on this combination. However, there have been no attempt to have these efforts grouped in one place for easy assimilation and for finding interesting future directions; this paper fills the gap. 1
(Show Context)

P 3N: Profiling the Potential of a Peer-based Data Management System

by Mihai Lupu
"... A large number of peer-to-peer (P2P) networks have been introduced in the literature since their popular advent in the late 1990s. In particular, structured P2P overlays have gained much attention since 2001. They are noted mainly for their theoretical properties ..."
Abstract - Add to MetaCart
A large number of peer-to-peer (P2P) networks have been introduced in the literature since their popular advent in the late 1990s. In particular, structured P2P overlays have gained much attention since 2001. They are noted mainly for their theoretical properties
(Show Context)

Generic Peer-to-Peer Networks: Theory, Implementation and Applications in Image Retrieval Using the Wavelet Transform

by Mihai Lupu, Beng Chin Ooi, Tomas Lozano-perez , 2008
"... This work is only part of my learning experience of the past 4 years. What has been learned in the process of writing the thesis is probably more important to me personally and professionally then its contents themselves. For this, I am deeply grateful to all with whom I have interacted, in some for ..."
Abstract - Add to MetaCart
This work is only part of my learning experience of the past 4 years. What has been learned in the process of writing the thesis is probably more important to me personally and professionally then its contents themselves. For this, I am deeply grateful to all with whom I have interacted, in some form or another, during this journey: from the lady selling the coffee in the local canteen, to Singapore itself; to both for providing an auspicious work environment. Among all these people and institutions, two persons naturally stand out as guiding companions: prof. Ooi Beng Chin, my supervisor in Singapore and prof. Stuart Madnick, my supervisor at MIT. With them, I had the opportunity to see two sides of the world, both physically and conceptually. From prof. Ooi I picked up many technical ideas and even more facts-of-life pertaining to research in computer science. Prof. Madnick showed me how much the real world needs practical systems and how many research ideas can be gen-erated from real-world problems. Apart from what I have learned from them directly, I am grateful to both of them for putting me in contact with other people and other environments,
(Show Context)

On Symmetry for Network Virtual Topology

by Wenjun Xiao, Weibing Wang
"... Abstract—General networks such as Internet are complex heterogeneous networks, which are constructed by many different organizations, and so become non-effective ones. Therefore one constructed a level of software over networks which is called overlay or virtual topology. In this paper we present pr ..."
Abstract - Add to MetaCart
Abstract—General networks such as Internet are complex heterogeneous networks, which are constructed by many different organizations, and so become non-effective ones. Therefore one constructed a level of software over networks which is called overlay or virtual topology. In this paper we present principle of symmetry for general network topology by using Cayley graph models and show its necessity to improving network performance. We explain the main conclusions of the paper by many examples in optical, wireless and peer-to-peer networks.