Mixing Protocol based on the Cooperation and the Parallelism for the Distributed Environment

Cooperation and parallelism are means for increasing efficiency of search. However, these aspects become a downside, when do not use good strategy for cooperation and parallelism so that to remedy this. We propose to take these aspects into account by studying, choice of the strategy of cooperation and parallelism. Firstly, in this paper, we present a new algorithm specifically designed for solving distributed constraint satisfaction problems (DisCSPs), and based on these concepts. Then, we prove the soundness and completeness of this method, give some experimental results, and evaluate our method against existing methods. Secondly, we argue the possibility of extension of this mechanism to another model.