由於科技的進步，資料量的激增使得現代系統所擁有的資料幾乎都分散在不同且不可靠的網路上，在本文中我們提出一個適合資料挖礦或資訊擷取的行動代理人平台。他是一個多重代理人的平台，其中包括旅行者代理人，結果代理人以及計算代理人，我們希望此平台能夠有效的應用網路資源完成使用者指定的任務。
在此平台中最主要可以分成三個部分，第一個是路徑的規劃，我們提出一個演算法可以有效的決定代理人的路徑，我們把他叫做排程演算法，在此演算法中，我們是根據網路的自主系統把即將要拜訪的點作分群，同時我們也考慮這些點的負載，因為負載也會影響代理人停留在此點的時間。第二部分是動態機制。此機制主要是負責監控網路目前的情況，適時地改變代理人的路徑使其能成功的完成使命。第三部分是離線機制，當使用者想要暫時離開系統，此時這個機制就會幫助使用者管理已經被派出去的代理人，當使用者再度上線，就可立刻取回他要的資料。此平台的目的是希望能提供一個較佳的行動代理人環境，同時也考慮使用的方便性以及實用性，希望使用者能更容易地操作此平台。

Modern information systems have data distributed over heterogeneous and unreliable network. In this paper, we present the Travel Agent Platform, which is a mobile agent platform suitable for data mining or information retrieval. It is a multi-agent platform in which there are travel agents, result agents, and computing agents. We hope this platform can effectively use network resources to complete the task.
There are three main sections in the platform. The first one is path plan. We propose an efficient algorithm to decide the agent’s path and how many agents should be dispatched; it is given a name to “Scheduling Algorithm.” In the scheduling algorithm, we cluster the hosts that mobile agents want to visit base on Autonomous System We also consider the host loads which affect the agent stay time. We hope using the least resource and less time to accomplish the task. The second one is “Dynamic Mechanism.” The system would get information about the current network traffic and change the agent path properly and timely. The last one is “Offline Mechanism”. It is a policy helps users manage those dispatched agents. Offline mechanism lets users can be offline and online latter to get result back.
The purpose of this system is providing a better environment for mobile agents. At the same time, it is also more user friendly than traditional applications about information retrieval.

Contents
• Abstract……………………………………………………………………….i
• Contents……………………………………………………………………....ii
• List of Figures and Tables…………………………………………………..iii
• Chapter 1. Introduction…………………………………………………...2
• 1.1 Motivations……………………………………………………………. 2
• 1.2 Related work……………………………………………………………4
• 1.3 Outline…………………………………………………………………..5
• Chapter 2. The Basic Concept of Mobile Agents for Information Retrieval………………………………………………………..7
• 2.1 Introduction to mobile agents Motivations……………………………..7
• 2.1.1 Mobile agents…………………………………………………..7
• 2.1.2 Languages……………………………………………………....8
• 2.1.3 Platforms……………………………………………………….9
• 2.1.4 The Features of Mobile Agents……………………………….10
• 2.1.5 Benefits……………………………………………………….11
• 2.2 Current mobile agent systems…………………………………………15
• Chapter 3. Overview of “Travel-Agent” Platform……………………...15
• 3.1 Introduction to “Travel-Agent” platform……………………………...15
• 3.2 The components of “Travel-Agent” platform…………………………18
• 3.3 Offline mechanism…………………………………………………….20
• 3.4 Dynamic mechanism…………………………………………………..25
• 3.5 Lifecycle of “Travel- Agent”………………………………………….29
• Chapter 4. Algorithms………………………………………………………34
• 4.1 Introduction of Mobile Agent Planning Problem……………………...34
• 4.2 The concept of Autonomous System (AS)……………………………35
• 4.3 The Algorithm of “Travel-Agent”…………………………………….38
• Chapter 5. Performance………………………………………………….43
• 5.1 Simulation environment……………………………………………….43
• 5.2 Simulation results……………………………………………………...44
• Chapter 6. Conclusions and Future Work………………………………49
• 6.1 Conclusions……………………………………………………………49
• 6.2 Future Work……………………………………………………………50
• Reference…………………………………………………………………….51
List of Figures and Tables

Reference
[1] A. Michalas, T. Kotsilieris, S. Kalogeropoulos, G. Karetsos, M. Sidi, V. Loumos, "Enhance the Performance of Mobile Agent based Network Management Application," Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on, 2001, Page(s): 432 -437
[2] G. P. Picco, A. Fuggetta and G. Vigna, “understanding code mobility”, IEEE Transaction on Software Engineering, January 1998.
[3] D.Rus, R.Grqy, and D. Kotz, "Autonomous and adaptive agents that gather information", AAAI ’96 International Workshop on Intelligent Adaptive Agents, August 1996.
[4] Q. Hairong, S.S. Iyengar, K. Chakrabarty, "Distributed Multi-Resolution Data Integration Using Mobile Agents," Aerospace Conference, 2001, IEEE Proceedings. , Volume: 3 , 2001, Page(s): 1133 -1141 vol.3
[5] S. Ling, S. W. Loke, "Verification of Itineraries for Mobile Agent Enabled Interorganizational Workflow," Database and Expert Systems Applications, 2001. Proceedings. 12th International Workshop on , 2001, Page(s): 582 -586
[6] P. Bellavista, A. Corradi, D. Cotroneo, S. Russo, "Integrating Mobile Agent Infrastructures with CORBA-based Distributed Multimedia Applications," Parallel and Distributed Processing, 2001. Proceedings. Ninth Euromicro Workshop on, 2001, Page(s): 121 -128
[7] W. Theilmann, K. Rothermel, "Optimizing the Dissemination of Mobile Agents for Distributed Information Filtering," IEEE Concurrency, Volume: 8 Issue: 2 , April-June 2000, Page(s): 53 -61
[8] T. Spalink, J.H. Hartman, G.A. Gibson, "A Mobile Agent''s Effects on File Service, " IEEE Concurrency, Volume: 8 Issue: 2 , April-June 2000, Page(s): 62 -69
[9] J.W. Baek, J.H. Yeo; G.T. Kim; H.Y. Yeom, "Cost Effective Mobile Agent Planning for Distributed Information Retrieval," Distributed Computing Systems, 2001. 21st International Conference on. , 2001, Page(s): 65 -72
[10] V. Paxson, "End-to-end routing behavior in the internet," in Proc. ACM SIGCOMM, Aug. 1996,pp.25-38
[11] MirrorNet (1999) Multiple Traceroute Gateway. [Online]. Available:http://www.tracert.com
[12] W. Theilmann, K. Rothermel, "Dynamic Distance Maps of the Internet," INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, Volume: 1, 2000, Page(s): 275 -284 vol.1
[13] M. Rabinovich, I. Rabinovich, R. Rajaraman, A. Aggarwal, "A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service," Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on, 1999 , Page(s): 101 -113
[14] "Programming and Deploying Java Mobile Agents with Aglets, "
[15] A. Caglayan, C. Harrison, "Agent sourcebook, "
[16] P. Marques, P. Simoes, L. Silva, F. Boavida, J. Silva, "Providing Applications with Mobile Agent Technology," Open Architectures and Network Programming Proceedings, 2001 IEEE , 2001, Page(s): 129 -136
[17] L. Gannoun, J. Francioli, S. Chachkov, F. Schutz, J.G. Hulaas, J. Harms, " Domain Name eXchange: a Mobile-Agent-Based Shared Registry System," IEEE Internet Computing , Volume: 4 Issue: 2 , March-April 2000, Page(s): 59 -64
[18] L. Gannoun, J. Hulaas, J. Francioli, S. Chachkov, F. Schutz, J. Harms, "Mobile Agent-Based Shared Registry System for Electronic Commerce of Internet Domain Names, " Mobile Multimedia Communications, 1999. (MoMuC ''99) 1999 IEEE International Workshop on , 1999, Page(s): 169 -178
[19] R.H. Glitho, E. Olougouna, S. Pierre, "Mobile Agents and Their Use for Information Retrieval: a Brief Overview and an Elaborate Case Study, " IEEE Network , Volume: 16 Issue: 1 , Jan.-Feb. 2002, Page(s): 34 -41
[20] G.. Cabri, L. Leonardi, F. Zambonelli, "MARS: a Programmable Coordination Architecture for Mobile Agents," IEEE Internet Computing , Volume: 4 Issue: 4 , July-Aug. 2000, Page(s): 26 -35
[21] K. Moszumi, "Mobile Agent Planning Problem," PhD. thesis, Dartmouth College, 1998.
[22] M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness, " Freeman, 1979.
[23] E. Horow, S. Sahni, "Fundamentals of Computer Algorithms," Computer Science Press, 1989.
[24] A. Feldmann, J. Rexford, "IP Network Configuration for Intradomain Traffic Engineering, " IEEE Network , Volume: 15 Issue: 5 , Sept.-Oct. 2001, Page(s): 46 -57
[25] " Data & Computer Communications ,"
[26] http://statistics.kpnqwest.net/performance/lookingglass.html
[27] http://www.arin.net/whois/index.html
[28] The Case for Resilient Overlay Networks
David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, Robert Morris.
Proc. of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001
[29] C. Labovitz, A., Ahuja, A. Bose, F. Jahanian, ”Delayed Internet routing convergence,” Networking, IEEE/ACM Transactions on , Volume: 9 Issue: 3 , June 2001,Page(s): 293 -306
[30] S. Savage, A. Collins, E. Hoffman, J. Snell, T. Anderson,
“The End-to-End Effects of Internet Path Selection (1999) ,” In Proc. ACM SIGCOMM