Dispatching multiple mobile agents in parallel for visiting e-shops

Yan Wang*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

25 Citations (Scopus)

Abstract

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(log2 n). Discussions of these models are taken on the basis of theoretical analysis and experiments.

Original languageEnglish
Title of host publicationProceedings - 3rd International Conference on Mobile Data Management, MDM 2002
Place of PublicationLos Alamitos, CA
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages61-68
Number of pages8
Volume2002-January
ISBN (Electronic)0769515002, 9780769515007
DOIs
Publication statusPublished - 2002
Externally publishedYes
Event3rd International Conference on Mobile Data Management, MDM 2002 - Singapore, Singapore
Duration: 8 Jan 200211 Jan 2002

Other

Other3rd International Conference on Mobile Data Management, MDM 2002
Country/TerritorySingapore
CitySingapore
Period8/01/0211/01/02

Keywords

  • Computer science
  • Concurrent computing
  • Dispatching
  • Distributed computing
  • Electronic commerce
  • Internet
  • Large-scale systems
  • Mobile agents
  • Parallel processing
  • Performance analysis

Fingerprint

Dive into the research topics of 'Dispatching multiple mobile agents in parallel for visiting e-shops'. Together they form a unique fingerprint.

Cite this