A Semantic Overlay Network for Unstructured Peer-to-Peer Protocols

Peer-to-Peer computing has become a popular net-working paradigm for file sharing, distributed comput-ing, collaborative working, etc. The widely used un-structured Peer-to-Peer protocols mainly face two prob-lems affecting their working efficiency: 1) inefficient flooding-based search, 2) topology mismatch between the overlay network and its underlying network. In this pa-per, we propose to organize nodes into a semantic over-lay network called CON which is composed of special interest groups based on nodes ’ contents. CON guides the content search with semantic information so that avoids most of the flooding cost. In order to alleviate the mismatch problem, nodes in CON establish links according to their underlay proximity. Simulation re-sults show that our mechanism efficiently increases the query success rate and reduces the traffic cost and query latency. We also compare CON with the similar work, which illuminates CON performs better in many as-pects. 1