@article{845,
  author = {Gilles Nachouki, Mohamed Quafafou},
  title = {Enlarge Research in cSON, a Maximal Covering Tree-Based Approach},
  journal = {Journal of Networking Technology},
  year = {2012},
  volume = {3},
  number = {2},
  doi = {},
  url = {http://www.dline.info/jnt/fulltext/v3n2/4.pdf},
  abstract = {We propose to enlarge research in cSON (community Semantic Overlay Network) a semantic overlay network that requires an organization of peers into communities. cSON is developed for an efficient research in unstructured Peer-to- Peer (P2P) system. In this paper, a community is composed of one super-peer (e.g. the administrator of the community) and of several peers: the super-peer describes a domain (e.g. ontology) and a peer (with its own data schema) joins one community which is in accordance with its own domain. One challenge in cSON is how to efficiently extend the scope of the research to all communities (and not only to neighboring communities). We propose an algorithm that builds, starting from the administrator of a community, a Maximal-affinity Covering Tree (MCT). The obtained MCTs are used later by queries in order to search in each community the pertinent peers. We give a performance evaluation concerning the creation of a MCT and we compare then our routing algorithm with the one (called baseline) which consists to send queries to only neighboring communities which are able to treat them.},
}