Analyse formelle de concept pour le routage des requêtes dans les systèmes pair-à-pair

The Peer-to-Peer systems (P2P) were led these last years as the major technology of access upon various resources on Internet. These systems build a cluster witch contains a very large number of peers. As the result the selection of peers who can answer for a given query is a very difficult problem. The efficiency of the selection algorithms can be improved by introducing of semantics into the process of queries routing. We present in this paper a novel improved version of our semantic routing algorithm LearningPeerSelection (LPS) presented in CORIA 2009, an incremental strategy of updating knowledge bases and an advanced experimental study. To test the proposed algorithm, we defined a layer of routing on the PeerSim simulator.