A Semantic Overlay Network for P2P Schema-Based Data Integration

Comito, Carmela; Patarin, Simon; Talia, Domenico

doi:10.1109/iscc.2006.19

Cited by 12 publications

(6 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, many scholars are researching semanticbased search technology in P2P network [4][5][6][7][8][9][10][11] . Jianming Lv [12] proposed a semantic search algorithm that can execute full-text information retrieval in structured P2P network.…”

Section: Related Workmentioning

confidence: 99%

“…Based on the contents of nodes to share resources, Alessandro Linari [17] proposed the concept of semantic overlay networks and language statistical model, and use this model to describe the properties of the node and select the node with similar properties to do its neighbors, which can build a high efficient P2P network that supports fuzzy semantic search, but the algorithm is mainly effective to non-structured P2P network. Carmela Comito [18] proposed a semantic overlay network based on data integration. The algorithm integrates shared resource of P2P subnet in a non-structured approach, and exchanging shared resource information and resource query information among the P2P subnets in a structured (DHT) approach.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Fuzzy Search Algorithm for Structured P2P Network Based on Multi-dimensional Semantic Matrix

Lu¹,

Hu²

2012

JNW

View full text Add to dashboard Cite

Structured P2P network is highly efficient and low cost in resources search, but it only supports single-keyword precise search rather than multi-keyword fuzzy search. This paper puts forward a novel search algorithm FSA-MDSM based on semantic vector matrix, in which the P2P node resources can be transferred into a number of semantic vectors which are formed into a vector matrix in terms of a free semantic dictionary. And according to the similarity of vectors semantics, the vectors are classified into several sub-blocks, each of which is managed by a virtual node. Those virtual nodes with similar semantics will cluster into several special subnets by the way of exchange of the semantic information, and a semantics routing table will be generated. The table can guide a node to locate target resource rapidly. The simulation experiments demonstrate that by using FSA-MDSM algorithm, a fuzzy semantic search can be supported efficiently in the Structured P2P network and its original advantage can not be lost basicall

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Fuzzy Search Algorithm for Structured P2P Network Based on Multi-dimensional Semantic Matrix

Lu¹,

Hu²

2012

JNW

View full text Add to dashboard Cite

show abstract

“…Some hybrid systems [28][29][30] combine structured and unstructured P2P networks. Semantic searches in unstructured P2Ps are ontology-based, IR-based, or Misc (miscellaneous).…”

Section: Related Workmentioning

confidence: 99%

A Semantic Searching Scheme in Heterogeneous Unstructured P2P Networks

Huang¹,

2011

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

Semantic-based searching in peer-to-peer (P2P) networks has drawn significant attention recently. A number of semantic searching schemes, such as GES proposed by Zhu Y et al., employ search models in Information Retrieval (IR). All these IR-based schemes use one vector to summarize semantic contents of all documents on a single node. For example, GES derives a node vector based on the IR model: VSM (Vector Space Model). A topology adaptation algorithm and a search protocol are then designed according to the similarity between node vectors of different nodes. Although the single semantic vector is suitable when the distribution of documents in each node is uniform, it may not be efficient when the distribution is diverse. When there are many categories of documents at each node, the node vector representation may be inaccurate. We extend the idea of GES and present a new class-based semantic searching scheme (CSS) specifically designed for unstructured P2P networks with heterogeneous single-node document collection. It makes use of a state-of-the-art data clustering algorithm, online spherical k-means clustering (OSKM), to cluster all documents on a node into several classes. Each class can be viewed as a virtual node. Virtual nodes are connected through virtual links. As a result, the class vector replaces the node vector and plays an important role in the class-based topology adaptation and search process. This makes CSS very efficient. Our simulation using the IR benchmark TREC collection demonstrates that CSS outperforms GES in terms of higher recall, higher precision, and lower search cost.

show abstract

“…The PeerSim simulator is a widespread platform for testing distributed applications [10,13,1]. It has been designed for scalability and is simple to use.…”

Section: Description Of the Simulationsmentioning

confidence: 99%

Blue Banana: resilience to avatar mobility in distributed MMOGs

Legtchenko

Monnet

Thomas

2010

2010 IEEE/IFIP International Conference on Dependable Systems &Amp; Networks (DSN)

View full text Add to dashboard Cite

Massively Multiplayer Online Games (MMOGs) recently emerged as a popular class of applications with millions of users. To offer acceptable gaming experience, such applications need to render the virtual world surrounding the player with very low latency. However, current state-of-the-art MMOGs based on peer-to-peer overlays fail to satisfy these requirements. This happens because avatar mobility implies many data exchanges through the overlay. As state-of-the-art overlays do not anticipate this mobility, the needed data is not delivered on time, which leads to transient failures at the application level. To solve this problem, we propose Blue Banana, a mechanism that models and predicts avatar movement, allowing the overlay to adapt itself by anticipation to the MMOG needs. Our evaluation is based on large-scale traces derived from Second life. It shows that our anticipation mechanism decreases by 20% the number of transient failures with only a network overhead of 2%.

show abstract

A Semantic Overlay Network for P2P Schema-Based Data Integration

Cited by 12 publications

References 18 publications

A Fuzzy Search Algorithm for Structured P2P Network Based on Multi-dimensional Semantic Matrix

A Fuzzy Search Algorithm for Structured P2P Network Based on Multi-dimensional Semantic Matrix

A Semantic Searching Scheme in Heterogeneous Unstructured P2P Networks

Blue Banana: resilience to avatar mobility in distributed MMOGs

Contact Info

Product

Resources

About