• 検索結果がありません。

Japan Advanced Institute of Science and Technology

N/A
N/A
Protected

Academic year: 2021

シェア "Japan Advanced Institute of Science and Technology"

Copied!
4
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/

Title

信頼性の高い移動エージェントシステムの構成方法

Author(s)

新堀, 健治

Citation

Issue Date

1999‑03

Type

Thesis or Dissertation

Text version

author

URL

http://hdl.handle.net/10119/1235

Rights

Description

Supervisor:渡部 卓雄, 情報科学研究科, 修士

(2)

Kenji Shinb ori

Scho ol of Information Science,

Japan Advanced Institute of Science and Technology

February 15, 1999

Keywords: Mobile Agent,faultrecovery,non-Byzantine fault,Event,CheckPoint.

1 Purpose and background

The purp ose of this study is to construct a framework for highly reliable mobile agents.

In this paper, we use the term reliability to denote the characteristics of mobile agents

that they can cope with physical faults in the computer environments. When we use

mobile agenttechnologies inreal-world applications, wemust considerboth security and

dependability of agents. In this paper, we handle the dependability. The mobile agents

migrate to the hosts, which are connected to the network, and do work in the various

computerenvironments. Asforsuchthemobileagentsmustcopewiththecommunication

faultsand thehosts down. However,the mobileagents,whomade by theexisting mobile

agent systems, have not considered the design about the computer environment faults.

When the faults occur in the computer environments, the mobile agents can't complete

theirownpurp ose. Forexample,1)Whenthehostdownbythebatterycutting,themobile

agents b ecome extinct. 2) When the mobile agents can't get the computer resources

that should be necessary, the mobile agents can't continue to processes. As seen from

these examples, dep endability is necessary and important. When the faults occur in the

computer environments,we mustproposea framework for highly reliablemobile agents,

which can detect the faults and cope with it, to solve such those problems. In this

research,the resource starvation problem of the mobile agents is handled as afault, too.

The security ofagents should not be ignored, but it isomitted inthis research.

2 Coop

Wedesigned aframework forhighly reliablemobile agents calledCoop. Coopis aframe-

work that the mobileagents can detect the non-Byzantine physicalfaultsand cope with

Copyright c

1999byKenjiShinb ori

(3)

pened. 2) When the mobile agents couldn't use the computer resources (CPU, memory

andsoon) whichb eing expectedintheplaceof themigration. 3)When thehosts discon-

nect from the network. 4) When the mobileagents can't get the result inthe time. The

mobile agentsbased on Coopcope with those faults inthe following. In the case of one,

we are thinkingabout twokindsof the expectably host down orthe non-expectably host

down. When the mobile agents couldexpect it,itis insuchcases asthe battery cutting,

UPS (uninterruptivep owersupply) doing,detachable shutdownand so on. Atthis time,

the mobileagentsmigratetothehosts orp ermanentinthe secondarystorage. When the

mobileagentscouldn't expect it,it isinsuchcases asthe host down bythe blackoutand

so on. At this time, the mobile agents cope with the fault by the checkp ointing. The

mobile agentsdo the checkp ointing to create arepresentation of the agent's state in the

secondarystorageatanintervaloftheconstanttime. Afterthefaultrecoveryofthehost,

the mobile agents can resume from the checkp oint (the recorded execution states). In

the case oftwo, the mobileagents migrateto the anotherhost or waits for the release of

the computer resources and so on. In the case of three, we are thinking about two kinds

of the communication faults; it is before the migration or migrating. The former of the

fault recovery is that the mobile agents change the host of the migration or wait until

the communication fault isrecovered. The latter of the fault recoveryis that the mobile

agentsmake the replicainthe place of sender and migratetothe host rep eatedly. In the

case of four, the mobile agents can't resume permanently; the reason of the host down

isn't recovered, the execution states are broken and so on. At rst, the mobile agents

make replica in the place of the host of the agent's owner, after that the mobile agents

migrateto anotherhost again.

The architecture of Coop is composed by two of a) the recovery mechanism and b)

the controlmodule. Eachmobileagenthasthe faultrecoverymechanismandmigrates to

each host. The faultrecovery mechanismis divided intothe fault recovery methods and

the eventmodule. The faultrecoverymethodscopewith the faultthat these are dened

in the agents. The event mo dule watches the environment of the mobile agent. When

an event (fault) occurs, the event mo dule calls a fault recovery method corresponding

to the fault. We design the fault recovery mechanism as the architecture that exibility

customization is possible. Actually, the fault recovery mechanism, which is only added

to the existential mobile agent systems, can't cope with all the faults. For example,

the mobile agents can't activate themselves from the permanentagents that recorded in

the secondary storages. Therefore, it is necessary for mobile agents to activate from the

permanent agents. The control module, which handles more than one mobile agent, is

the stationary agentand exists toward one node.

3 implement

In this research, we designed Coop, which is a Java class library, and implemented it.

The exercises, which we actually made, are the system information's acquire agent and

the circulating notice agent. The system information's acquire agent acquires eachhosts

(4)

realizes the circulating notice of the actual world. In addition, we designed a simple

distributed algorithm, which can cope with the crash fault, only for the cyclic mobile

agents. We implement this distributed algorithm for the components. The programmer

can cho ose whether this distributed algorithm is used freely. This algorithm is being

used with the circulating notice agent. The exp eriment platform of Coop uses Satou's

AgentSpace, which is the mobile agent system of the Java based. Coop is implemented

by usingJava,but weuesedthe nativemethod atthe pointofthe eventdetection, sothe

executive environment is only Windows 95,98,NT4.0. Actually, Coop itself is platform

independence. We used Javaon Win32 forthe exp erimentsinthis research.

4 Summary

We designed Coop| a framework for highly reliable mobile agents |and implemented

it as a Java class library. Advantages of Coop are the following. 1) The architecture of

Coopdoesn'tdep endontheplatformofthemobileagentsystems. 2)Itisthearchitecture

that the customization of the fault recovery methods and the event mo dules is easy. 3)

Because the recovery mechanism is independent, it can be handled as a module. Ab out

the problem ofthe mobileagentsbasedonCoop, theload of eventwatchingishigh; each

mobile agent has an event module and watches the events. However, the mobile agents

withthe eventmodulecancustomizesuitablefortheirown purpose. About thisproblem,

Weconsider that itis trade-o of the exibility of Co op.

参照

関連したドキュメント

Next we shall prove Lemma 3.. Then G=F' follows from Proposition 1. This completes the proof of Lemma 3. Let us consider the exact sequence.. r\

It is suggested by our method that most of the quadratic algebras for all St¨ ackel equivalence classes of 3D second order quantum superintegrable systems on conformally flat

Keywords: continuous time random walk, Brownian motion, collision time, skew Young tableaux, tandem queue.. AMS 2000 Subject Classification: Primary:

Keywords and phrases: super-Brownian motion, interacting branching particle system, collision local time, competing species, measure-valued diffusion.. AMS Subject

In [13], some topological properties of solutions set for (FOSPD) problem in the convex case are established, and in [15], the compactness of the solutions set is obtained in

Zhang; Blow-up of solutions to the periodic modified Camassa-Holm equation with varying linear dispersion, Discrete Contin. Wang; Blow-up of solutions to the periodic

After proving the existence of non-negative solutions for the system with Dirichlet and Neumann boundary conditions, we demonstrate the possible extinction in finite time and the

While conducting an experiment regarding fetal move- ments as a result of Pulsed Wave Doppler (PWD) ultrasound, [8] we encountered the severe artifacts in the acquired image2.