Collaborative home media community with semantic support

2008

This paper provides an overview of MediaDART, a framework for building online services for distributing and sharing digital media. Inspired by the participative model of Web 2.0, MediaDART relies on a scalable and decentralized architecture that can grow with the contribution of users. The architecture is based on an arbitrary number of nodes interconnected through a p2p network implementing a distributed hash table (DHT). The DHT provides resource storage and parallel resource processing for operations of feature extraction, adaptation and composition. MediaDART adopts application-level multicast based on distribution trees for delivery in streaming and implements algorithms to dynamically replicate resources across the network. The framework allows content description through user-defined tags. Tools for personalized content retrieval based on recommendation algorithms and user profiling are included too. This paper also describes two prototype applications and outlines further work.

Informatics Engineering and …, 2011

Peer-to-peer computing is emerging as a new distributed computing paradigm for many novel applications that involve exchange of information among a large number of peers with little centralized coordination. Scalability is without doubt the foremost requirement for a peer-to-peer system. To obtain a high factor of scalability, we partition network search space using a global ontology. Our proposed system takes the form of a semantic layer that can be superimposed on top of any P2P infrastructure. This layer is subdivided as semantic categories through a Hilbert curve which has the merit of good preservation of locality. We choose HyperCup structure to support semantic category in order to increase fault tolerance and overcome bottleneck problem. HyperCup was also selected, because of its efficient broadcast algorithm. Classification within a semantic category will be conducted through multidimensional data analysis. The classification process will be recursively repeated with ontolo...

Proceedings of the …, 2003

2013

Peer-to-peer computing is emerging as a new distributed computing paradigm for many novel applications that involve exchange of information among a large number of peers with little centralized coordination. Scalability is without doubt the foremost requirement for a peer-to-peer system. To obtain a high factor of scalability, we partition network search space using a global ontology. Our proposed system takes the form of a semantic layer that can be superimposed on top of any P2P infrastructure. This layer is subdivided as semantic categories through a Hilbert curve which has the merit of good preservation of locality. We choose HyperCup structure to support semantic category in order to increase fault tolerance and overcome bottleneck problem. HyperCup was also selected, because of its efficient broadcast algorithm. Classification within a semantic category will be conducted through multidimensional data analysis. The classification process will be recursively repeated with ontolo...

2010

For the last few years peer-to-peer (p2p) networks have become widely used tools for sharing any kind of information from multimedia data to text documents. The vast amount of shared information leads issues on finding relevant information over p2p networks. Existing p2p file search and information retrieval techniques are based on the name of files, which is insufficient when searching relevant documents. In this paper we present a method to perform semantic information retrieval over p2p networks. Our method semantically inspects the content of shared data in peers to generate conceptual information about documents and general information about the peer.

International Journal of Web Engineering and Technology, 2008

Open Hypermedia Systems (OHS) aim to provide efficient dissemination, adaptation and integration of hyperlinked multimedia resources. Content available in Peer-to-Peer (P2P) networks could add significant value to OHS provided that challenges for efficient discovery and prompt delivery of rich and up-to-date content are successfully addressed. This paper proposes an architecture that enables the operation of OHS over a P2P overlay network of OHS servers based on semantic annotation of (a) peer OHS servers and of (b) multimedia resources that can be obtained through the link services of the OHS. The architecture provides efficient resource discovery. Semantic query-based subscriptions over this P2P network can enable access to up-to-date content, while caching at certain peers enables prompt delivery of multimedia content. Advanced query resolution techniques are employed to match different parts of subscription queries (subqueries). These subscriptions can be shared among different interested peers, thus increasing the efficiency of multimedia content dissemination.

2010

The amount of data that home users generate, store, and peruse has grown significantly in the past few years. Increasingly, organizing this huge amount of data-in order to make it easy to browse, query and access-is becoming challenging. Many recent proposals have emphasized the importance of data management in home networks and proposed mechanisms for managing replicas across devices to increase availability. Essentially, they capture the relationship "is copy of" between files across devices. However, files can be semantically related. Users are often interested in finding data that has such semantic relationships; tracking these relationships helps users to effectively search based on content or human-understandable context, organize data and manage the limited storage while ensuring availability of information. However, inferring semantic relationships just based on user-defined tags and file names can be challenging, since users may not follow any standard or unique naming conventions. We argue that such semantic relationships should be derived on the basis of content itself, and propose to leverage recent developments in multimedia processing literature, with minimal user involvement. The decentralized, heterogeneous and dynamic operational environment of home networks present interesting systems and network challenges. In this paper, we have highlighted several candidate designs and system-optimizations that can help build an effective semantic-aware data management for home networks. As ongoing work, we are working on a prototype implementation of a decentralized data management system.

Bases de Données …, 2010

Dans cet article, nous proposons P2Prec, un service de recommandation pour systèmes de gestion de contenus P2P, qui exploite les données sociales des utilisateurs. L'idée est de recommander à l'utilisateur des documents de qualité en utilisant les notes données par les amis (ou amis d'amis) experts du sujet. Pour gérer les données sociales, nous nous appuyons sur des descriptions FOAF. P2Prec a une architecture P2P hybride, indépendante du système de gestion de contenus P2P, qui exploite l'efficacité d'une DHT pour indexer les fichiers FOAF et la robustesse du gossip pour disséminer les sujets d'expertise entre amis. Dans notre évaluation expérimentale, avec les données de CiteSeer, nous montrons que P2Prec permet d'obtenir un rappel maximum, avec de très bonnes performances. De plus, il améliore le rappel et la précision des réponses par un facteur 2 par rapport aux solutions centralisées.

Existing shared object spaces cannot be used to build large scale distributed systems as their realizations do not scale up. Inefficient mechanisms for handling failures and object lookups, use of centralized components as well as inability to operate without global knowledge inhibit their scalability. This paper proposes a platform named Virat that focuses on the integration of shared object spaces with Peer-to-Peer (P2P) systems. Virat provides a shared object space abstraction over a wide area distributed system. It is built using a unique two-layered P2P architecture that combines the advantages of structured and unstructured P2P systems. Virat is a platform over which collaborative data sharing services can be provided from the edges of the Internet. We also present extensive performane studies to demonstrate that Virat can outperform centralized shared object spaces and performs as good, if not better than OpenDHT, a state of the art P2P shared storage space, in both Intranet and Internet test beds.