DESENT: decentralized and distributed semantic overlay generation in P2P networks

Doulkeridis, Christos; Nørvåg, Kjetil; Vazirgiannis, Michalis

doi:10.1109/jsac.2007.070104

Cited by 54 publications

(61 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In these repositories, some applicable strategies such as flooding based [10], DHT based [11], overlay based [12], gossiping [13] and swarm-based [14], [15] have been presented. Unfortunately, the analysis carried out in the DSR field are not applicable since they diverge in the following aspects:…”

Section: Related Workmentioning

confidence: 99%

Assessing Data Dissemination Strategies within Triple Spaces on the Web of Things

Gómez-Goiri

López‐de‐Ipiña

2012

2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing

View full text Add to dashboard Cite

Abstract-The upcoming of the Web of Things initiative has improved the integration of Internet-connected devices through the standard HTTP protocol and other web techniques. Unfortunately, it usually defines the data shared by these devices in a syntactic level, showing a lack of expressiveness. During the last decade, the Semantic Web (SW) has aimed to solve these problems by adding logic to the Web to make it machineunderstandable and by therefore enhancing the interoperability of the applications using it. The SW is used in the Triple Space Computing paradigm, which proposes a blackboard model where semantically described knowledge is shared between different devices in a completely RESTful, and consequently WoT compliant, manner. This paradigm's shared blackboard can be implemented using many strategies, from centralized to completely distributed. In this work, we compare and analyze the behaviors of these two extreme cases in several simulations which try to represent common IoT scenarios. Finally, we propose an improvement of the completely distributed strategy by enabling the gossiping between devices.

show abstract

Section: Related Workmentioning

confidence: 99%

Assessing Data Dissemination Strategies within Triple Spaces on the Web of Things

Gómez-Goiri

López‐de‐Ipiña

2012

2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing

View full text Add to dashboard Cite

show abstract

“…Besides clustering based on peers content, clustering based on other common features, such as the interests of peers [11], is possible. In [6], clustering is first applied on the documents of each peer, and then recursively on the derived feature vectors by selected peer representatives. While this approach does not assume predefined categories, it still requires the use of cluster representatives unlike our uncoordinated protocol.…”

Section: Related Workmentioning

confidence: 99%

“…While, there is a large body of research on the discovery and construction of clustered overlays [3,5,15,21,11,8,4,6], their maintenance, which is imperative for coping with the dynamic nature of peers, has been mostly ignored.…”

Section: Introductionmentioning

confidence: 99%

A recall-based cluster formation game in peer-to-peer systems

Koloniari

Pitoura

2009

Proc. VLDB Endow.

View full text Add to dashboard Cite

In many large-scale content sharing applications, participants or peers are grouped together forming clusters based on their content or interests. In this paper, we deal with the maintenance of such clusters in the presence of updates. We model the evolution of the system as a strategic game, where peers determine their cluster membership based on a utility function of the query recall. Peers are guided either by selfish or altruistic motives: selfish peers aim at improving the recall of their own queries, whereas altruistic peers aim at improving the recall of the queries of other peers. We study the evolution of such clusters both theoretically and experimentally under a variety of conditions. We show that, in general, local decisions made independently by each peer enable the system to adapt to changes and maintain the overall recall of the query workload.

show abstract

“…To overcome the limitations of the basic search, mechanisms are needed that enable access to remote contexts. One possible solution to the problem is to use a hierarchical overlay network based on the unstructured P2P network using the DESENT algorithm (Doulkeridis et al, 2007). Another solution is to organize the CASs in a DHT-based structured P2P network (in addition to the unstructured P2P network they already belong to) and use this for storage of location information.…”

Section: Location-based Routingmentioning

confidence: 99%

“…This can be achieved by adopting semantic overlay networks (Crespo and GarciaMolina, 2002) (Doulkeridis et al, 2007) that group together peers with similar content. We also intend to study how service churn, due to disconnections or user mobility, affects the efficiency of context-based caching and searching.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Context-based caching and routing for P2P web service discovery

Doulkeridis

Zafeiris

Nørvåg

et al. 2006

Distrib Parallel Databases

View full text Add to dashboard Cite

In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on contextbased caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches.

show abstract

DESENT: decentralized and distributed semantic overlay generation in P2P networks

Cited by 54 publications

References 7 publications

Assessing Data Dissemination Strategies within Triple Spaces on the Web of Things

Assessing Data Dissemination Strategies within Triple Spaces on the Web of Things

A recall-based cluster formation game in peer-to-peer systems

Context-based caching and routing for P2P web service discovery

Contact Info

Product

Resources

About