{"references": ["Wenyu Qu; Kitsuregawa, M.; Keqiu Li; Hong Shen, \"An Execution\nPrototype of Mobile Agent-Based Peer-to-Peer Systems\" presented at\nComputer and Computational Sciences, 2006. IMSCCS , 20-24 April\n2006 Page(s): 330 - 338", "Liu, J.N.K.; Li, B.N.L.; Dillon, T.S.,\" An improved naive Bayesian\nclassifier technique coupled with a novel input solution method\"\npresented at Applications and Reviews, IEEE Transactions on\nVolume 31, Issue 2, May 2001 Page(s):249 - 256", "Jos\u00e9 M. Bernardo, Adrian F. M. Smith \"Bayesian Theory\" presented by\n(Wiley Series in Probability and Statistics) copyright 2000, chapter 5\npage(s) 241-263.", "Sven Ove Hansson,\" Decision Theory A Brief Introduction\" presented at\nDepartment of Philosophy and the History of Technology Royal Institute\nof Technology (KTH) Stockholm, 23 August 2005", "Padraic G. Neville \" Decision Trees for Predictive Modeling\" presented\nby SAS Institute Inc. 4 August 1999,\nhttp://bus.utk.edu/stat/datamining/Decision%20Trees%20for%20Predict\nive%20Modeling%20(Neville).pdf", "G J Chaitin,\" Algorithmic Information Theory\" presented at IBM, P O\nBox 218 Yorktown Heights, NY 10598, Third Printing, April 2, 2003", "Ichiro Satoh \"Network Processing of Mobile Agents, by Mobile Agents,\nfor Mobile Agents\" presented at Mobile agents for telecommunication\napplications. International workshop No3, Montreal PQ, Canada, 14\naugust 2001.", "Torsten Illmann, Tilman Krueger, Frank Kargl, Michael Weber \"\nTransparent Migration of Mobile Agents Using the Java Platform\nDebugger Architecture, Mobile Agents\" presented at 5th International\nConference, MA 2001 Atlanta, GA, USA, December 2-4, 2001.\nProceedings", "Xiliang Zhong, Cheng-Zhong Xu, and Haiying Shen,\" A Reliable and\nSecure Connection Migration Mechanism for Mobile Agents\" presented\nat the 24th International Conference on Distributed Computing Systems\nWorkshopsW7: EC (ICDCSW'04) - Volume 7 Pages: 548 - 553 , 2004,\nISBN:0-7695-2087-1 .\n[10] ttp://www.ece.eng.wayne.edu/~czxu/software/tutorial/napletExamples/n\napletSocket.html\n[11] Yingyue Xu, Hairong Qi \" Dynamic mobile agent migration in Wireless\nSensor Networks\" presented at International Journal of Ad Hoc and\nUbiquitous Computing 2007 - Vol. 2, No.1/2 pp. 73 - 82\n[12] Tino Schlegel, Peter Braun, Ryszard Kowalczyk,(2006) Towards\nAutonomous Mobile Agents with Emergent Migration Behaviour,\nAAMAS-06 May 8-12 2006, Hakodate, Hokkaido, Japan.\n[13] Ann M. Bell, William A. Sethares\" The El Farol Problem and the\nInternet: Congestion and Coordination Failure\"\nhttp://fmwww.bc.edu/cef99/papers/Bell.Sethares.pdf\n[14] http://www.omnetpp.org/\n[15] Yong Lu; Guangzhou Zhao; Fanjun Su \"Adaptive ant-based dynamic\nrouting algorithm\" presented at Intelligent Control and Automation,\n2004. WCICA 2004. Volume 3, 15-19 June 2004 Page(s): 2694 - 2697.\n[16] Uwe R\u252c\u00bfottgermann \"Decentralized Throughput Optimization in\nIndustrial\" presented at Institute of Information and technology,\nMunchen University, Germany.\nhttp://deposit.ddb.de/cgibin/dokserv?idn=978930878&dok_var=d1&dok\n_ext=pdf&filename=978930878.pdf\n[17] Gehlen, G. Pham, L. \"Mobile Web services for peer-to-peer\napplications\" presented at Consumer Communications and Networking\nConference, 2005. CCNC. 2005 Second IEEE Publication Date: 3-6 Jan.\n2005 On page(s): 427- 433\n[18] Jiangang Ma, Jinli Cao, Yanchun Zhang ,\" A Probabilistic Semantic\nApproach for Discovering Web Services\" Presented at the international\nworld wide web conference, Banff, Alberta, Canada. May 8-12,\n2007.ACM 978-1-59593-654-7/07/0005.\n[19] Jurriaan van Diggelen, RobbertJan,Beun, Frank Dignum, Rogier M. van\nEijk, JohnJules Meyer \" ANEMONE: An Effective Minimal Ontology\nNegotiation Environment\" presented at International Conference on\nAutonomous Agents Proceedings of the fifth international joint\nconference on Autonomous agents and multiagent systems, Hakodate,\nJapan May 15-16- 2006,Pages: 899 - 906 ,2006"]}

Mobile agents are a powerful approach to develop distributed systems since they migrate to hosts on which they have the resources to execute individual tasks. In a dynamic environment like a peer-to-peer network, Agents have to be generated frequently and dispatched to the network. Thus they will certainly consume a certain amount of bandwidth of each link in the network if there are too many agents migration through one or several links at the same time, they will introduce too much transferring overhead to the links eventually, these links will be busy and indirectly block the network traffic, therefore, there is a need of developing routing algorithms that consider about traffic load. In this paper we seek to create cooperation between a probabilistic manner according to the quality measure of the network traffic situation and the agent's migration decision making to the next hop based on decision tree learning algorithms.