Please use this identifier to cite or link to this item:
|Title:||A parallel dispatch model with secure and robust routes for mobile agents|
|Citation:||Wang, Y.,Tan, K.-L.,Pang, X. (2002). A parallel dispatch model with secure and robust routes for mobile agents. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2455 LNCS : 129-138. ScholarBank@NUS Repository.|
|Abstract:||For mobile agents to be widely accepted in a distributed environment like the Internet, performance and security issues on their use have to be addressed. In this paper, we first present a parallel dispatch model with secure dispatch route structures. This model facilitates efficient dispatching of agents in a hierarchical manner, and ensures route security by exposing minimal route information to hosts. To further enhance route robustness, we also propose a mechanism with substitute routes that can bypass temporarily unreachable hosts, dispatch agents to substitute hosts before attempting the failed hosts again. Finally, a model for distributing the load of decrypting substitute routes is presented. We also present results of both analytical and empirical studies to evaluate different models. © Springer-Verlag Berlin Heidelberg 2002.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.