運用自主式行動代理者於非集中式模擬環境之研究 - 政大學術集成

ၮҔԾЬԄՉ୏ж౛ޣܭߚ໣ύԄኳᔕᕉნϐࣴز

Using Autonomous Mobile Agents in Decentralized Simulation

Environment

ᐽϺ᜼ (Tainchi Lu) ഡܴయ (MingChi Fu) ໱ࡌᄆ (Chienchang Feng)

୯ҥ჏ကεᏢၗૻπำᏢس

E-mail: tclu@mail.ncyu.edu.tw

ᄔा

ҁࣴز௦Ҕ IEEE ኱ྗ 1516 ϐଯ໘ኳᔕࢎᄬ

(High Level Architecture) ک IBM Aglets Չ୏ж౛

ޣᕉნǴ໒วΑԾЬԄՉ୏ж౛ޣמೌЪᔈҔܭߚ ໣ύԄኳᔕᕉნύǴගраՉ୏ж౛ޣࣁ୷ᘵޑၗ ਑ ϩ ว ᆅ ౛ ᐒ ڋ (mobile agent-based data

distribution management)Ǵ٬Ҕᕉ׎ᆛၡמೌࡌҥ΋ ঁᡄᒠ܄่ᄬٰ຾ՉதᎫж౛ޣ໔ޑނҹૻ৲Ҭ ඤک໺ሀǶ٠ਥᏵ࠼ЊᆄԖᑫ፪ु᎙ޑኳᔕނҹ຾ Չᜢᖄ܄ނҹКჹǴஒ࠼ЊᆄᏤЇଛ࿼ܭӝ፾ޑኳ ᔕᖄ࿉՛ܺᏔ္຾ՉୖᄽǶҁࣴزᡉҢрԾЬԄՉ ୏ж౛ޣޑၗ਑ᇆ໣Ϸૻ৲໺ሀૈΚǴԖቸ܄ޑፓ ᏾ኳᔕᕉნϐૻ৲ҬбໆǴගܹεೕኳଯ໘ࢎᄬኳ Ԅኳᔕޑس಍ਏૈǶ ᜢᗖຒǺଯ໘ࢎᄬǵԾЬԄՉ୏ж౛ޣǵၗૻᇆ໣ǵ ᗺჹᗺࢎᄬǵᕉރೱጕࢎᄬǵਓՉࡰࠄ

1.

߻ق

߈ԃٰҗܭႝတࣽמޑ຾؁Ϸᆛሞᆛၡޑว ৖ǴεೕኳޑኳԄኳᔕᆶႝတծ්ҭᒿϐᔈҔว ৖ǴԋࣁӚ୯ࡌैഢᏯǵ೽໗૽ግᆶै٣բᏯ΢ख़ ाޑᇶշπڀǶӧኻऍ୯ٛӃ຾୯ৎύǴςԖߚத ӭޑၮҔኳᔕᆶႝတծ්ԋфਢٯǴߦ٬୯ٛ٣୍ ޑख़εॠཥǶࣁΑှ،Ӛᜪࠠኳᔕس಍᏾ӝޑୢ ᚒǴऍ୯୯ٛ೽ςܭ 1995 ԃଆ௢୏Π΋жޑኳᔕ ࢎᄬᆀࣁଯ໘ኳᔕࢎᄬ (High Level Architecture)

[13]ǴයૈᙖԜӅ೯ࢎᄬஒӚᜪኳᔕᔈҔǴ຾ՉԖ ਏޑ᏾ӝᔈҔǶҁፕЎ܌ࢎᄬޑߚ໣ύԄᆛၡᕉნ ࣁ΋ঁ่ӝϩණԄԖጕᆛၡᆶё፾܄คጕೱ่ޑ ᆛၡᕉნǴӧ౦፦ೱᆛύམଛ௦Ҕ IEEE ኱ྗ 1516 ޑଯ໘ኳᔕࢎᄬٰࡌҥኳᔕᖄ࿉ᕉნǴаՉ୏ж౛ ޣ [1,2,4,7]ࣁ୷ᘵǴၮҔ IBM Aglets [5,6,10]Ǵ໒ว ΑԾЬԄՉ୏ж౛ޣמೌЪᔈҔܭߚ໣ύԄኳᔕ ᕉნύǶ ྽࠼Њᆄ຾Չೱጕډኳᔕᖄ࿉ᕉნਔǴҗܭኳ ᔕԋ঩ঁᡏԖӚԾॄೢౢғၮՉኳᔕޑނҹǴӢԜ ךॺਥᏵ࠼ЊᆄԖु᎙ᑫ፪ޑኳᔕނҹ຾Չ՛ܺ Ꮤᆄޑނҹ࣬ᜢ܄КჹǴதᎫж౛ޣ཮٩ྣ࠼Њᆄ ঁΓϯၗ਑ሡ؃аϷኳᔕᖄ࿉՛ܺᏔᆄϐނҹϩ ଛǴКჹр፾ەೱጕޑኳᔕᖄ࿉՛ܺᏔǴᙖҗวଌ ሦૐж౛ޣ (navigator agent) ຾Չ࠼Њᆄଛ࿼ǴԜ ᅿᆅ౛฼ౣаයఈૈගٮӝ፾܄ޑၗ਑ᇆ໣ܺ ୍Ǵа಄ӝ࠼Њᆄा؃ǶගٮঁΓϯޑၗૻ୍ܺ

Ƕ

2.

࣬ᜢࣴز

2.1 Չ୏ж౛ޣ Չ୏ж౛ޣёа٩Ᏽٰྍႝတటֹԋޑ੝ۓ πբǴவԶೀ౛೏ϩࢴډϐำׇǴӵӕቶୱᆛၡϩ ѲΠޑ౦፦ၗ਑৤ӸڗǶ΋ѿ೏ࡰࢴπբǴՉ୏ж ౛ޣ཮ᐱҥЪԾ୏Ծวೀ౛ௗᕇޑำׇǶ྽Չ୏ж ౛ޣᆶ՛ܺᏔᖄᛠࡕǴջ໒ۈ୺ՉำׇǴ٩ྣ՛ܺ Ьᐒ๏ϒՉ୏ж౛ޣޑӼӄ܄଺ᇡ᛾௤៾ǶԶࣁΑ ाֹԋ๏ۓޑำׇǴՉ୏ж౛ޣૈ໺ଌԿќ΋ঁ՛ ܺЬᐒǴࡌҥ΋ঁཥޑж౛ޣǴЪૈӧ۶Ԝ໔Ǵ଺ ૻ৲ྎ೯Ǵޔډπբֹԋஒ่݀ӣ໺๏٬Ҕޣ܈໺ ๏ќ΋ঁ՛ܺЬᐒǶ ӵკ 1 ܌ҢǴᡣж౛ޣЬ୏ӧόӕޑηᆛၡၯ وǴૈӧ؂΋ঁ܌࿶ၸޑ࿯ᗺǴ୺ՉࡰࢴޑπբǴ Ьाёϩࣁٿᜪж౛ޣǺπբж౛ޣᆶሦૐ঩ж౛ ޣǴځύπբж౛ޣ࣬྽ܭ΋ঁᢀӀ࠼ǴѬམ४ਓ ၯЃγୖೖόޕӜλᙼǹԶሦૐ঩ж౛ޣ࣬྽ܭ΋ ঁਓၯЃγᘂᏤǴѬЇሦᢀӀ࠼ऀఖܭλᙼύǶ

კ 1 ሦૐ঩ж౛ޣᆶπբж౛ޣҢཀკ 2.2 ᗺჹᗺس಍ ᗺჹᗺϩණԄࢎᄬ [3,8,9,11,12]Ǵёᙖҗޔௗ ӸڗӚঁႝတ࿯ᗺ܌ϩ٦ޑၗྍǴԶόሡा೸ၸύ ѧԄ՛ܺᏔǶԶύѧԄ՛ܺᏔૈӧࢌ٤ਔ໔೏٬Ҕ ٰ଺੝ۓޑπբǴٯӵቚу΋ঁཥ࿯ᗺԿᆛၡ΢Ǵ ᕇளӄୱޑᜢᗖॶаϷس಍໔ޑӕ؁฻Ƕ ӧ પ ᆐ ޑ ߚ ໣ ύ Ԅ ࢎ ᄬ ύ (purely decentralized architecture) Ǵᆛၡ΢܌Ԗޑ࿯ᗺࣣዴ Ϫޑ୺Չ࣬ӕޑπբǴԖ๱ӵӕ՛ܺᏔᆄᆶ࠼Њᆄ ޑ୏բՉࣁǴ٠Ъය໔ޑࢲ୏ؒԖύѧޑڐፓޣ຾ ՉڐፓǶӵკ 2 ܌ҢǶ ჴЈጕ߄Ңᆛၡ࿯ᗺޑೱ่௃׎Ǵҗ΋ঁፎ؃ ཛྷ൨ޑ࿯ᗺวଌा؃ډѬᎃ߈ޑ࿯ᗺǴ٩ԜൻᕉǶ ྽ௗԏډख़ፄૻ৲ਔǴ཮ᙖҗӣᙟ΋ঁᒱᇤૻ৲ٰ ᗉխૻ৲଑୮෧եᆛၡ໺ᒡໆǶ྽ว౜టפ൨ޑᔞ ਢ߾ӣ໺ԋфૻ৲Ƕ კ 2 ߚ໣ύԄཛྷ൨ᐒڋԄཀკ 2.3 ଯ໘ࢎᄬ ଯ໘ࢎᄬ (HLA)ࣁፄᚇس಍ࡌ࿼ᆶኳᔕගٮ ޑ΋ᅿמೌǴѬҗኳᔕᖄ࿉ǵኳᔕԋ঩ǵނҹኳࠠ ኬ ݈ ǵ ௗ α ೕ ጄ ǵ ୺ Չ ਔ ୷ ᘵ RTI (run time

infrastructure) ฻ಔԋǶHLA ޑᡉ๱੝ᗺࣁЍ࡭Ӛ ᜪޑس಍ኳᔕǴЍජނҹࣁЬޑኳᔕᔈҔ໒วኳ ԄǴගٮ೯Ҕޑૻ৲Ҭඤ೯ߞڐ᝼аϷ೯Ҕޑǵ໒ ܫޑǵёਥᏵόӕᔈҔሦୱڋۓޑૻ৲ᇟѡᇟཀϕ ୏ڐ᝼ǵஒኳᔕфૈᆶ೯ҔޑЍኖس಍ϩᚆޑ่ᄬ ฻ǶӢԜǴHLA ӧှ،ϩණԄǵڐӕӝբޑኳᔕس ಍ᆶނҹޑёᏹբϷёख़Ҕ܄Бय़ڗளΑख़εޑ ຾৖Ƕ

3.

س಍ࢎᄬ

3.1 షӝࠠس಍ࢎᄬ ӧԜࣴزύޑߚ໣ύԄኳᔕس಍ࢎᄬϣǴךॺ ٩ฅа IEEE ኱ྗ 1516 ଯ໘ኳᔕࢎᄬࣁس಍ѳѠǴ җኧѠᖄ࿉՛ܺᏔ (federate server, FS) ಔӝԋϩ ණԄᆛၡ՛ܺᏔᘀ໣Ǵॄೢኳᔕᕉნϣޑૻ৲Ҭඤ аϷೀ౛Ӛঁ࠼ЊᆄೱጕԿᖄ࿉՛ܺᏔਔ܌ሡा ޑೱᆛ୏բǶኳᔕᕉნύ܌Ԗޑނҹ೿Ѹ໪٣Ӄۓ က೛࿼ֹԋǴӢԜӧёႣයΠǴӚঁނҹૻ৲໺ଌ ёаᙖҗՉ୏ж౛ޣஒၗ਑ឫӣǴٰගٮঁΓϯޑ Չ୏୍ܺǶ ӵკ 3 ܌ҢǴӧԜߚ໣ύԄࢎᄬύǴᖄ࿉՛ܺ ᏔᆄࣁߎᑼҬඤኳᔕၮբѳѠǴ٠ܭځύ೛࿼தᎫ ж౛ޣٰᅱ௓ᇆ໣ૻ৲Ǵ࠼ЊᆄᙖҗԖጕ܈คጕᆛ ၡ໺ᒡᕉნᆶ՛ܺЬᐒೱጕǴ٠ڗளኳᔕ຾Չਔϐ Ҭඤૻ৲Ƕ ӧس಍ࢎᄬύǴаკ 3 ࣁٯǴᙖҗࡰࢴதᎫж౛ ޣ (stationary agent, S. Agent) ॄೢᆅ౛ᆛၡ୔ࢤ ္ޑᖄ࿉՛ܺᏔǴж౛ޣᆶж౛ޣϕ࣬ϐ໔Ǵ٩Ᏽ ᗺჹᗺߚ໣ύԄࢎᄬٰࡌҥೱጕ٠ගٮ୍ܺ๏࠼ ЊᆄǶ࠼Њᆄޑೱጕёᒧ᏷٬ҔԖጕᆛၡ܈ޣคጕ ᆛၡᕉნǶ

კ 3 ߚ໣ύԄషӝࠠኳᔕس಍ࢎᄬ 3.2 Չ୏ж౛ޣ ךॺஒж౛ޣ٩Ᏽфૈ܄ޑόӕуа୔ϩǴҔ аගٮ࠼ЊᆄঁΓϯޑၗૻᇆ໣୍ܺǴځύ࠼Њᆄ ёࣁՉ୏೛ഢ܈ࢂڰۓး࿼ǶନΑж౛ޣ໣ණԣϐ ѦǴځѬޑж౛ޣ٩ൻႣӃۓကޑπբॄၩ๏ϒό ӕޑૈΚǶ
Agent Pool ж౛ޣ໣ණԣǴх֖ж౛ޣ܌ሡޑ୷ҁфૈڄ ኧǴ٠Ϣ೚ᆅ౛ޣࡌҥ (create) ཥޑж౛ޣǹ٬Ҕ dialogࡰзᒧۓж౛ޣǹ٬Ҕ dispose ٰύЗ୺Չύ ޑж౛ޣǹ܈٬Ҕ clone ࡌҥ΋ঁ୺Չύޑж౛ޣ ୋҁࡰࢴ๏س಍Ƕ
Stationary Agent தᎫж౛ޣǴфૈ߈՟ࣁ΋ঁ proxyǴӧኳᔕ ୖᄽϐ߻ǴႣӃதᎫܭӚ federation serverǴ಍ӝӚ ᜪނҹޑวթૻ৲ٮሦૐж౛ޣ଺ၗૻᇆ໣Ƕ٠ೀ ౛ᎂழୢᚒǴ྽ж౛ޣᎂழډќ΋ঁ࿯ᗺϐ߻Ǵத Ꭻж౛ޣᙖҗ dispatch ࡰзࡰࢴటᎂ౽ϐж౛ޣǹ ϸϐǴ٬Ҕ retract ٰᄖᎍჹж౛ޣޑࡰࢴǶ
Navigating Agent ሦૐж౛ޣǴ଺ၗૻᇆ໣аೀ౛࠼ЊᆄҬбϐ πբǶ཮Ծ୏ೱௗԿኳᔕᖄ࿉ύനௗ߈ޑதᎫж౛ ޣǴ଺ૻ৲КჹǴ٠ஒ่݀ӣ໺๏࠼ЊᆄǶ྽ᎂழ చҹԋҥǴ߾٩ᏵதᎫж౛ޣගٮޑਓՉࡰࠄǴ຾ Չᎂ౽Ƕ
State Capture ж౛ޣރᄊᘏڗǴҔٰᅱ௓ሦૐж౛ޣޑރᄊ ٠૶ᒵϐǴа،ۓሦૐж౛ޣϐғڮຼයǶඤѡ၉ ᇥǴж౛ޣޑᕉნᡂኧࣣ૶ᒵܭԜǶ 3.3 ኳᔕၮբᆅ౛ ӧ᏾ঁኳᔕس಍ύǴதᎫж౛ޣࣁॄೢᆅ౛ᅱ ௓ᖄ࿉՛ܺᏔᆄၗ਑໺ሀаϷ࠼Њᆄջਔೱጕރ ᄊޑख़ाفՅǴӵკ 4 ܌ҢǶځၮբၸำᙁॊӵΠǺ Step 1: ӧኳᔕس಍ᕉნ߃ۈϯ߻Ǵ᏾ঁኳᔕᕉ ნύޑᖄ࿉՛ܺᏔӛځதᎫж౛ޣ຾Չຏнฦᒵ ޑ୏բ (х֖ᖄ࿉՛ܺᏔޑ IP Տ֟ǵೱௗ୵฻)Ǵ ԜࡕதᎫж౛ޣஒᕇளᖄ࿉՛ܺᏔගٮޑނҹኳ ࠠǶ Step 2: தᎫж౛ޣۓයԏ໣ځॄೢޑᖄ࿉՛ ܺᏔϐၗ਑ϩѲ௃׎Ǵ٠ᆶߕ߈ޑж౛ޣ଺ૻ৲Ҭ ඤǴஒ܌ள૶ᒵܭᎃௗၡҗ߄ (neighbor routing table)Ǵаբࣁϩଛᖄ࿉՛ܺᏔ๏࠼ЊᆄਔޑୖԵ٩ ᏵǶ Step 3: ྽࠼ЊᆄటуΕኳᔕᕉნୖᆶᄽግ ਔǴё٩Ᏽ܌ӧӦຯᚆӢη (location-based distance factor) Ӄࡷᒧനௗ߈ޑதᎫж౛ޣ຾ՉೱጕǴаڗ ள࠼Њᆄ᛽ձዸǴӆҗதᎫж౛ޣԵໆ࠼Њᆄሡ ؃Ǵᆶᎃ߈ၡҗ߄КჹǴനࡕࡰࢴ࠼ЊᆄԿӝ፾ޑ ᖄ࿉՛ܺᏔǶ Step 4: தᎫж౛ޣ຾ՉނҹКჹࡕǴ೸ၸՉ୏ ж౛ޣஒᇆ໣่݀ӣ໺๏࠼ЊᆄǶ٩Ᏽ࠼Њᆄޑु ᎙౗Ǵٰ،ۓૻ৲ሽॶ܄Ƕ

Step 5: தᎫж౛ޣ཮ਥᏵ Neighbor routing table ύޑၗ਑ϩѲୖԵॶٰࣁ࠼Њᆄࡷᒧр΋Ѡ

ന፾྽ޑᖄ࿉՛ܺᏔٮ࠼Њᆄ຾ՉೱጕǴ٠߃ۈϯ ሦૐж౛ޣ (Navigating Agent) ೀ౛ႣӃϩଛӳޑ ၗ਑ϩଌᆶอኩᘐጕ (handoff)Ƕ

3.4 ࡌҥᕉރೱጕࢎᄬ ӧኳᔕᕉნ္௦ҔᗺჹᗺೱᆛǴҬඤ۶Ԝ՛ܺ ᏔύԖޑނҹၗ਑ǴᅟࡕਥᏵ࠼Њᆄೱጕा؃Ǵϩ ଛ፾ەޑᖄ࿉՛ܺᏔගٮೱጕǶԶӧߚ໣ύޑس಍ ύǴךॺ٬Ҕᕉ׎ᗺჹᗺמೌٰۓՏӚঁж౛ޣᆶ ځύޑᖄ࿉՛ܺᏔǶ ᕉ׎ᗺჹᗺמೌࣁ᛽ձޜ໔ (identifier space) ᆶՉ୏࿯ᗺ (mobile node) ගٮ΋ঁൂ΋ޑࢀ৔Ǵ ҭջࢂՉ୏࿯ᗺࣁ΋ঁԖ IP Տ֟Ϸ୵ဦޑЬᐒǴ؂ ঁ࿯ᗺୖྣ΋ঁ᛽ձ಄ (identifier)Ƕჹᔈ᛽ձ಄ aǴ ԶԖ๱К᛽ձ಄ a εǴԶΞλܭځѬ᛽ձ಄ޣǴԜ ࿯ᗺᆀϐࣁ᛽ձ಄ a ޑࡕᝩޣ (successor)Ƕ྽᏾ঁ ᛽ձ಄ᆶӚ࿯ᗺޑࡕᝩޣࡌҥӳࡕǴՉ୏ж౛ޣջ ёவύբૻ৲ྎ೯Ƕ ځύǴ܌Ԗޑ࿯ᗺჹᔈډ m ঁՏϡ (m-bit) ޑ ᕉ׎᛽ձޜ໔Ǵ؂ঁ࿯ᗺ࡭ԖӚԾޑၡҗ߄ᆀϐࣁ ᎃௗၡҗ߄Ǵᎃௗၡҗ߄૶ᒵᕉ׎ࢎᄬύځѬ࿯ᗺ ޑૻ৲Ǵх֖Ԗ࿯ᗺ᛽ձ಄аϷ஑ឦޑᆛၡՏ֟Ƕ ӧᎃௗၡҗ߄ύǴ಄ӝεܭ r+ k2 −1ीᆉԄǴ߾ ࿯ᗺ r ޑಃ k ঁ຾Εᗺ (entry) ޑനλ࿯ᗺࣁ࿯ᗺ sǶ࿯ᗺ s Ψ೏ᆀࣁ࿯ᗺ r ޑಃ k ঁࡕᝩޣǶඤѡ၉ ᇥǴᎃௗၡҗ߄૶ᒵ๱җ m ঁ᛽ձ಄୔໔܌ࡷᒧр ޑ m ঁ຾ΕᗺǴ࿯ᗺ r ޑಃ k ঁ୔໔০ပܭǺ 1 2k mod 2 ,m 2 mod 2k m r r ⎡⎛ ⎞ ⎛ ⎞⎤ ⎢⎜ ⎟ ⎜ ⎟⎥ ⎢⎜ ⎟ ⎜ ⎟⎥ ⎢⎝ ⎠ ⎝ ⎠⎥ ⎣ ⎦ − + + კ 5 ܌ҢǴ྽ m=3 ЪӸӧΟঁ࿯ᗺϩձࣁ࿯ᗺ 1,3 а Ϸ 7 Ƕ ٗ ሶ ࿯ ᗺ 1 ᆙ ௗ ๱ ޑ ࡕ ᝩ ޣ ࣁ

( )

1+20 mod23=2 ܈ޣࢂ

( )

1+21mod23=3 ฻ٿঁ࿯ ᗺǶ კ 5 தᎫж౛ޣࡌҥೱጕࢬำ

4.

ჴᡍ่݀

4.1 ࠹֋ᆅ౛ᆶၗ਑ϩวᆅ౛ჴᡍ ӧҁჴᡍύǴኳᔕᖄ࿉՛ܺᏔ௦Ҕ P4 2.4

GHzǵ512 MB RAM аϷ Microsoft Windows 2000

ࢎ೛ϐᕉნǴۭቫଯ໘ኳᔕࢎᄬࣁऍ୯୯ٛ೽

DMSOހҁޑ HLA RTI-NG 1.3 v4Ǵኳᔕᖄ࿉՛ܺ

Ꮤ܌ౢғΒΜঁኳᔕԋ঩ঁᡏϩձวթΜᅿόӕ ޑނҹᅿᜪǴҗኳᔕԋ঩ঁᡏᒿᐒु᎙ځѬኳᔕԋ ঩ঁᡏϐၮՉނҹǶ ଷ೛ӧଯ໘ኳᔕࢎᄬ΢຾Չޑኳᔕᄽ૽ύǴኳ ᔕᖄ࿉՛ܺᏔϐ໔܌ౢғޑኳᔕԋ঩ঁᡏᆶځኳ ᔕނҹӵ߄ 1 ܌ҢǴӧҢΟѠኳᔕᖄ࿉՛ܺᏔϐ ໔Ǵኳᔕԋ঩ঁᡏ཮ܭ୺Չਔ୷ᘵ຾ՉวѲϐ୏ բǴԶु᎙௃׎߾٩Ᏽނҹϕ୏ᜢ߯೛ۓࣁु᎙ᆶ ցǴᙖԜ߄౜р࠹֋ᆅ౛ᐒڋჹၗ਑ޑೀ౛௃׎Ǵ ځ໔ૻ৲ޑ໺ଌਔ໔ৡ౦Ǵ࿶җჴᡍёளډӵკ 6 ϐ่݀Ƕ җჴᡍኧᏵёаᢀჸрǴ྽ճҔ࠹֋ᆅ౛ᐒڋ ௓ڋኳᔕԋ঩ঁᡏ܌ሡ໺ଌᆶௗԏޑၗ਑ਔǴ٩Ᏽ ኳᔕԋ঩ঁᡏु᎙೛ۓϐόӕǴ෧ϿΑԜኳᔕԋ঩ ঁᡏ܌ሡೀ౛ޑၗ਑໺ᒡໆǹฅԶǴӧၗ਑ϩวᆅ ౛ᐒڋ΢җܭ໻٬Ҕᙁൂޑၗ਑ၸᘠ฼ౣ܌ගٮ ޑௗԏБၗ਑ᆅ౛ǴჹܭวଌБ٠҂Ԗ຾΋؁ޑ೛ ۓǴӢԜኳᔕԋ঩໔ޑၗ਑ᆅ౛௃׎࣬߈ܭ࠹֋ᆅ ౛ᐒڋ܌ೀ౛ၗ਑ϩวޑૈΚǶ ߄ 1 ᇻය༊౗ᜢ߯ϕ୏ӈ߄ Days Long-term interest rate equation

30 30− ×12₁ =

(

ITaiwan−IUSA

)

×₃₆₀30 S S 60

(

)

₃₆₀ 60 2 12 60 × − = × − USA Taiwan I I S S 90 90− ×12₃ =

(

ITaiwan−IUSA

)

×₃₆₀90 S S ᆕӝа΢ٿᅿ่݀ёว౜Ǵၗ਑໺ᒡໆၨϿޑ ኳᔕԋ঩ঁᡏૈ୼ගԐֹԋኳᔕᄽ૽Ǵٿᅿၗ਑ᆅ ౛ࣣёᆒᙁૻ৲ၗ਑ໆǴа࿯࣪୺Չਔ໔Ƕ

0 200 400 600 800 1000 1200 1400 1600 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Sim u la tio n tim e (s ) Federates normal კ 6 ࠹֋ᆅ౛ᆶၗ਑ϩวᆅ౛ჴᡍኧᏵკ 4.2 ᕉ׎่ᄬࡌ࿼ჴᡍ ӧҁჴᡍύǴճҔኳᔕᖄ࿉՛ܺᏔࡌᇙӳޑଯ ໘ࢎᄬࣁس಍ۭቫǴฅࡕᙖҗࡕᝩޣ࿯ᗺޑࢗפౢ ғᎃௗၡҗ߄ٰࡌҥ΋ঁᡄᒠ܄ᕉ׎่ᄬǴаֹԋ ߚ໣ύԄࢎᄬΠӚኳᔕᖄ࿉՛ܺᏔϐதᎫж౛ޣ ߃ۈϯޑૻ৲ྎ೯Ƕ ӧჴᡍύǴଷ೛᛽ձޜ໔ m=7 നεӅගٮ 128 ঁՉ୏࿯ᗺǴ྽࠼Њᆄ٬Ҕೱጕޑᆛၡᕉნࣁ 100MbpsޑଯೲΌϼᆛၡਔǴךॺᢀჸԜਔճҔத Ꭻж౛ޣࡌҥᕉ׎่ᄬޑਏ౗ଯե௃׎Ƕӵკ 7 ܌ ҢǴӧԖጕᆛၡᕉნΠࡌҥᕉ׎่ᄬǴёᗉխӢ೛ ࿼ύѧ՛ܺᏔ೷ԋޑॄၩϩᏼό΋ޑၸख़௃׎Ǵճ Ҕߚ໣ύԄࢎᄬٰ೛࿼ޑதᎫж౛ޣǴځ܌޸຤ӧ ᡄᒠᕉރ่ᄬޑࡌҥਔ໔Ǵ཮٩Ᏽж౛ޣޑԋߏԶ ೴؁ቚуځ୺Չਔ໔Ǵՠࢂॸᒘ๱Ԗጕᆛၡᕉნڀ Ԗޑଯೲᛙۓ໺ᒡޑ੝܄Ǵவკύёа࣮рځᡄᒠ ่ᄬࡌҥޑਔ໔΢ϲޑ٠όܴᡉǶ ྽࠼ЊᆄճҔคጕᆛၡ (IEEE 802.11g) ຾Չ ೱጕਔǴךॺᢀჸԜਔதᎫж౛ޣࡌҥᡄᒠᕉ׎่ ᄬϐਏ౗ଯե௃׎Ƕӵკ 8 ܌ҢǴךॺуаჹྣ٬ ҔԖጕᆛၡޑਏ౗ଯեёаว౜Ǵଞჹаคጕᆛၡ ຾ՉೱጕޑதᎫж౛ޣٰᇥǴᒿ๱Չ୏࿯ᗺኧໆޑ ೴ᅌቚуǴჹܭ୺Չਔ໔ԖၨεޑቹៜǴځচӢࣁ คጕᆛၡᕉნᓎቨၨԖጕᆛၡࣁեǴӢԜӧฯᡏज़ ڋޑӃϺৡ౦΢ǴჹܭՉ୏࿯ᗺޑቚߏٰᇥǴதᎫ ж౛ޣᕉ׎่ᄬޑࡌ࿼ਔ໔཮ڙᆛၡࠔ፦Ӣનϐ ቹៜǶ 0 50 100 150 200 250 0 10 20 30 40 50 60 70 80 90 100 Sim u la tio n tim e (m s )

Number of mobile agents

Fast Ethernet Wireless Lan კ 7 ᕉ׎่ᄬࡌᇙჴᡍኧᏵკ 0 20 40 60 80 100 120 140 160 180 200 0 10 20 30 40 50 60 70 80 90 Sim u la tio n tim e (m s ) Number of nodes

Sequebtial Info. retrieve Ring Info. retrieve

კ 8 ၗૻᇆ໣ჴᡍኧᏵკ 4.3 ၗૻᇆ໣ჴᡍ ӧҁჴᡍύǴଷ೛ኳᔕᕉნϣ຾Չޑނҹϕ୏ ύǴ٩ྣ࠼Њᆄሡ؃ٰ଺ޑၗૻᇆ໣ǴךॺϩձК ၨ٬ҔൻׇБԄаϷ٬Ҕނҹ઩Ї߄ࡕǴሦૐж౛ ޣୖྣਓၯࡰࠄϐૻ৲ᇆ໣୏բֹԋਔ໔ޑৡ౦Ƕ ӵკ 8 ܌ҢǶ྽٬Ҕൻׇཛྷ൨ਔǴёаᢀჸрǴ ࿯ᗺኧၨϿޑਔংǴж౛ޣၗૻཛྷ൨ޑӣൔਔ໔ᇻ Кךॺගрޑᕉ่ࠠᄬၗૻཛྷ൨ਔ໔ϿǴӢԜёа Ԗਏ౗ޑၲԋ࠼Њᆄा؃Ȅՠࢂᒿ๱࿯ᗺኧޑቚ уǴΨගଯΑൻׇཛྷ൨܌޸຤ޑਔ໔ǴԜਔךॺග рޑᕉ่ࠠᄬၗૻཛྷ൨٠ό཮Ӣ࿯ᗺፄᚇޑቚу Զε൯Ӧ޸຤׳ӭޑཛྷ൨ਔ໔ǴϸԶӢࣁႣӃޑᕉ ࠠ߃ۈϯࡕ܌ࡌҥϐނҹ઩Ї߄Ǵ٩Ᏽ࠼Њᆄޑሡ ؃Զૈᆒྗޑղᘐ҅ዴޑ࿯ᗺՏ࿼Ǵ٠ࢴᇾж౛ޣ ஒၗૻឫӣǶӢԜԜᅿߚ໣ύԄᡄᒠᕉ่ࠠᄬǴ፾

ӝӧεࠠޑኳᔕᕉნύǴᒿ๱࿯ᗺኧޑቚуǴځၗ ૻᇆ໣ޑਏ੻ϸԶᓬؼܭ໺಍ൻׇཛྷ൨ޑБݤǶ

5.

่ፕ

ҁፕЎගрߚ໣ύԄᆛၡᕉნǴӧ IEEE 1516 ଯ໘ኳᔕࢎᄬ (HLA) Π่ӝԖጕᆶคጕᆛၡǴᡣ ٬Ҕޣૈ୼ᒿਔᒿӦ೸ၸӚᅿ೯ૻး࿼຾Չೱ ᆛǴനࡕǴ࿶җس಍ኳᔕჴᡍ่݀ளޕǴаՉ୏ж ౛ޣࣁ୷ᘵޑၗ਑ϩวᆅ౛ᐒڋǴ೸ၸԾЬԄՉ୏ ж౛ޣёၲډ࠼ЊᆄЬ୏Ԅၗૻᘏڗ୍ܺǶ٠ஒଯ ໘ኳᔕࢎᄬۯ՜Կషӝࠠ౦፦Չ୏ᆛၡǴࡌ࿼ԾЬ ԄՉ୏ж౛ޣǴٰගٮ٬Ҕޣၨӭϡᆶቶݱޑܺ ୍Ǵ٬ள᏾ঁس಍׳ڀԖᘉк܄ᆶჴҔ܄Ƕ

ୖԵЎ᝘

[1]A. Bieszczad, B. Pagurek, and T. White, “Mobile agents for network management,” IEEE Communication Survey, vol. 1, no. 1, 1998.

[2]A. Puliafito and O. ToMarchio, “Advanced network management functionalities through the use of mobile software agents,” in Proc. of Workshop on Intelligent Agents for Telecommunication Applications, vol. 1699, Springer, Aug. 1999, pp. 33–45.

[3]B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” in Proc. of the 22nd International Conf. on Distributed Computing Systems (ICDCS’02), IEEE CS Press, 2002, pp 5–15.

[4]C. Bohoris, G. Pavlou, and H. Cruickshank, “Using mobile agents for network performance management,” in Proc. of IEEE/IFIP Network Operations Management Symposium, April 2000, pp. 637–652.

[5]Danny B. Lange and Mitsuru Oshima, “Mobile Agents with Java: The Aglet API,” World Wide Web, Vol. 1, Issue 3, pp. 111-121, 1998.

[6]Danny B. Lange and Mitsuru Oshima.

Programming and Deploying Java Mobile Agents with Aglets. Addison Wesley, Reading,

Massachusetts, 1998.

[7]D. Gavalas, D. Greenwood, M. Ghanbari, and M. O’Mahony, “An infrastructure for distributed and dynamic network management based on mobile agent technology,” in Proc. of Conf. on Communications, 1999, pp. 1362–1366.

[8]D. R. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, in Proc. of the 29th Annual ACM Symposium Theory of Computing, pp. 654–663, 1997

[9]D.S. Milojicic et al., Peer-to-Peer computing, tech.

report HPL 2002-57, Hewlett-Packard

Laboratories, Palo Alto, Calif., 2002.

[10] IBM Japan Research Group “Aglets Workbench,” Available through http://aglets.trl.ibm.co.jp.

[11] Q. Lv et al., “Search and Replication in Unstructured Peer-to-Peer Networks,” in Proc. of the 16th International Conf. Supercomputing (ICS’02), ACM Press, 2002, pp. 84–95.

[12] T. Suel et al., “ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval,” in Proc. of International Workshop Web and Databases (WebDB’03), ACM Press, 2003, pp. 67–73.

[13] U.S. Department of Defense Modeling and Simulation Office (DMSO), High Level

Architecture Rules. Version 1.3. Available through