Dispatching multiple mobile agents in parallel for visiting e-shops

The mobile agent approach is suitable for deploying large-scale parallel processing over distributed hosts. However, if the number of mobile agents is very large and the dispatch is processed in a serial way, it can become a bottleneck that impacts the efficiency as a whole. In this paper, we first briefly present a mobile agent based framework for Internet marketplaces enabling parallel processing. Then we present and discuss several hierarchical dispatch models where the dispatch of multiple mobile agents can be processed in parallel over different hosts. In the best case, the time complexity for dispatching n mobile agents is O(log₂ⁿ). Discussions of these models are taken on the basis of theoretical analysis and experiments.