A Fast Transmission of Mobile Agents Using Binomial Trees


The KIPS Transactions:PartA, Vol. 9, No. 3, pp. 341-350, Sep. 2002
10.3745/KIPSTA.2002.9.3.341,   PDF Download:

Abstract

As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM''s Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Cho and Y. H. Kim, "A Fast Transmission of Mobile Agents Using Binomial Trees," The KIPS Transactions:PartA, vol. 9, no. 3, pp. 341-350, 2002. DOI: 10.3745/KIPSTA.2002.9.3.341.

[ACM Style]
Soo Hyun Cho and Young Hak Kim. 2002. A Fast Transmission of Mobile Agents Using Binomial Trees. The KIPS Transactions:PartA, 9, 3, (2002), 341-350. DOI: 10.3745/KIPSTA.2002.9.3.341.