行動代理人(Mobile Agent, MA)之派送，一般多半建立在OSI七層網路架構中的應用層(Application layer)的網路上，因此應用層上MA之傳送都必須依賴底層來完成。這使得MA之派送受到網路擁塞或斷線極大的影響，這在以應用層來進行資料傳送上是無法避免的。而關於這篇論文，我們嘗試使用MA的自主性、自我複製等特性來減少MA之派送因網路問題造成的影響。

MA的派送，多半是以一個MA派送路徑來完成全部MA的派送任務。而此篇論文的方法，主要是使用兩個互補的MA派送路徑來執行任務，這樣不僅在網路發生問題時，可以藉由多個MA使用不同路徑，走訪同一組網路節點，來減少網路問題所帶來的影響，又能因為多個MA同時走訪同一組網路節點，來縮短任務的完成時間。未來如果有必要，我們更可以擴充此方法同時執行多個MA派送路徑，以面對更嚴苛的網路環境或再進一步加速MA之派送。

The dispatch of mobile agent (MA), is often built in application layer of the OSI 7-layer model. So, the transfer of MA in the application layer must rely on the lower layers to complete. This makes the MA dispatching affects severely by network congestion and link failure, and these effects are unavoidable in transmitting data in the application layer. About this paper, we attempt to make use of the properties of MA, such as autonomous and self-replicate, etc., to reduce the effects cause by the network problems.

The dispatch of MA often uses a single MA dispatching path to complete the overall MA dispatching mission. But in the method of this paper, two complementary MA dispatching paths are primarily used to execute the mission. Thus, when the network occurs problems, we not only can use many MAs to traverse the same set of destinations to reduce the effects incur by the network problems but also can shorten the mission complete time because numerous MAs traverse the same set of networking nodes. In future, if necessary, we can even extend this method to execute more MA dispatching paths concurrently either when we confront a more unstable network or speed up the dispatching of MA.

[1] Antony Rowstron and Peter Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems.", IFIP/ACM International Conference on Distributed Systems Platforms. Lecture Notes in Computer Science, Volume 2218, Jan 2001, Page 329.(2001)

[2] Stefan Saroiu, P. Krishna Gummadi, Steven D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems", In MMCN, Jan (2002).

[3] K. Moizumi, "Mobile Agent Planning Problems", PhD. Thesis, Dartmouth College (1998).

[4] Jin-Wook Baek, Jae-Heung Yeo, Heon Y. Yeom, " Agent Chaining: An Approach to Dynamic Mobile Agent Planning", International Conference on Distributed Computing Systems(ICDCS) (July, 2002).

[5] Mengkun Yang, Zongming Fei, "A Proactive Approach to Reconstructing Overlay Multicast Trees", Proceedings of INFOCOM 2004, Hong Kong (March, 2004).

[6] S.G. Finn, M. Mdard, R.A. Barry, "A Novel Approach to Automatic Protection Switching Using Trees", IEEE (1997).

[7] Bo Yang, Dayou Liu, Kun Yang, Sheng-Sheng Wang. "Strategically migrating agents in itinerary graph", IEEE International Conference on Machine Learning and Cybernetics (2003).

[8] Moizumi, K; Cybenko, G, "The Traveling Agent Problem", Mathematics Of Control Signals and Systems (1998).

[9] B. Brewington, R. Gray, K. Moizumi, D. Kotz, G. Cybenko, and D. Rus. "Mobile Agents in Distributed Information Retrieval." In M. Klusch, editor, Intelligent Information Agents, chapter 12. Springer-Verlag (1999).

[10] Baek, J., Kim, G., Yeo, J., and Yeom, H., "Cost-Effective Mobile Agent Planning for Distributed Information Retrieval", The 21 st Int'l Conf. On Distributed Computing Systems (ICDCS-21), Phoenix (2001).

[11] Jin-Wook Baek, Gyu-Tae Kim, Heon-Young Yeom, "Cost Effective Planning of Timed Mobile Agents", International Conference on information Technology : Coding and Computing(ITCC), Las Vegas, Nevada, USA (2002).

[12] John G. Waclawsky, Ph.D., Tung Ouyang, Ph.D., "Practical TCP Traffic Flow Performance Analysis, Part 2", Boston (2000).

[13] 陳怡國，”跨異質性物件傳輸機制行動代理人平台之研究”, 台灣科技大學電子工程所碩士論文，2004

[14] Cui Weidong, Stoica I, Katz R H. "Backup path allocation based on a correlated link failure probability model in overlay networks". IEEE International Conference on Network Protocols, Paris, France (2002).

[15] T. Braun, V. Arya, T. Turletti., "A Backup Tree Algorithm for Multicast Overlay Networks", Poster at IFIP Networking, Waterloo Ontario, Canada, May 2005.

[16] M. Medard, SG Finn, RA Barry and RG Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs", IEEE/ACM Transactions on Networking. (Oct, 1999)

[17] X. Zhang, Q. Zhang, and W. ZHu, "Measurement-based Construction of Locality-Aware Overlay Networks", IEEE ICC (2004).

[18] O.Heckmann, M.Piringer, J.Schmitt, and R.Steinmetz. "On realistic network topologies for simulation". In Proceedings of ACM SIGCOMM MoMeTools, Karlsruhe, (2003).

[19] MA的簡介,
http://www.ascc.sinica.edu.tw/nl/91/1823/03.txt
http://www.ascc.sinica.edu.tw/nl/91/1824/02.txt

[20] Pstry, http://research.microsoft.com/~antr/Pastry/

[21] Scribe, http://research.microsoft.com/~antr/SCRIBE/default.htm

[22] Gnutella, http://rfc-gnutella.sourceforge.net/

[23] Bit Torrent Protocol Specification,
http://wiki.theory.org/BitTorrentSpecification

[24] J-Sim, http://www.j-sim.org

[25] Brite, http://www.cs.bu.edu/brite/

[26] Hamiltonian cycle, http://www.metafilter.com/mefi/22185

[27] ANDREW S. TANENBAUM, "Computer Networks fourth edition", Prentice Hall PTR, Upper Saddle River, New Jersey, pp.532-553 (2003).