TY - GEN
T1 - NAS algorithm for semantic query routing systems in complex networks
AU - Cruz-Reyes, Laura
AU - Gómez Santillán, Claudia Guadalupe
AU - Aguirre Lam, Marco Antonio
AU - Schaeffer, Satu Elisa
AU - López, Tania Turrubiates
AU - Izaguirre, Rogelio Ortega
AU - Fraire-Huacuja, Héctor J.
PY - 2009
Y1 - 2009
N2 - 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 dependent on the reliability, availability and security of distributed applications. In addition, those systems show great dynamism as a result of the extremely complex and unpredictable interactions between the distributed components, making it practically impossible to evaluate their behavior. In this paper, we evaluate the performance of the NAS algorithm (Neighboring-Ant Search), which is an algorithm for distributed textual query routing based on the Ant Colony System metaheuristic and SemAnt algorithm, improved with a local topological characterization metric and a classic local exploration method called lookahead, with the aim of improving the performance of the distributed search. Our results show that including local information like the topological metric and the exploration method in the Neighboring-Ant Search algorithm improves its performance 40%, in terms of the number of hops needed to locate a set of resources in a scale-free network.
AB - 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 dependent on the reliability, availability and security of distributed applications. In addition, those systems show great dynamism as a result of the extremely complex and unpredictable interactions between the distributed components, making it practically impossible to evaluate their behavior. In this paper, we evaluate the performance of the NAS algorithm (Neighboring-Ant Search), which is an algorithm for distributed textual query routing based on the Ant Colony System metaheuristic and SemAnt algorithm, improved with a local topological characterization metric and a classic local exploration method called lookahead, with the aim of improving the performance of the distributed search. Our results show that including local information like the topological metric and the exploration method in the Neighboring-Ant Search algorithm improves its performance 40%, in terms of the number of hops needed to locate a set of resources in a scale-free network.
KW - Ant colony system
KW - Internet
KW - Peer-to-peer network
KW - Query routing system
KW - Scale-free
KW - Topology
UR - http://www.scopus.com/inward/record.url?scp=58149193551&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-85863-8_34
DO - 10.1007/978-3-540-85863-8_34
M3 - Contribución a la conferencia
AN - SCOPUS:58149193551
SN - 9783540858621
T3 - Advances in Soft Computing
SP - 284
EP - 292
BT - International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)
A2 - Corchado, Juan
A2 - Rodriguez, Sara
A2 - Llinas, James
A2 - Molina, Jose
ER -