NAS Algorithm for Semantic Query Routing Systems in Complex Networks

摘要

The modern distributed systems are acquiring a great importance in our daily lives.Each day more transactions are conducted through devices which perform queries that are de-pendent on the reliability, availability and security of distributed applications. In addition, thosesystems show great dynamism as a result of the extremely complex and unpredictable interac-tions between the distributed components, making it practically impossible to evaluate their be-havior. In this paper, we evaluate the performance of the NAS algorithm (Neighboring-AntSearch), which is an algorithm for distributed textual query routing based on the Ant ColonySystem metaheuristic and SemAnt algorithm, improved with a local topological characteriza-tion metric and a classic local exploration method called lookahead, with the aim of improvingthe performance of the distributed search. Our results show that including local information likethe topological metric and the exploration method in the Neighboring-Ant Search algorithmimproves its performance 40%, in terms of the number of hops needed to locate a set ofresources in a scale-free network.