• Article
  • | |
  • Metrics
  • |
  • Reference [21]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    Using a multi-agent system to control network is an important method to manipulate controllable networks. The reasonable control of network is based on the belief reachability of the multi-agent system, which means that the belief of every agent must be consistent with the real state of the network before making decisions. To research the belief reachability and convergence rate of the multi-agent system, a new model named multi-agent system belief distance updating model, which describes the updating progress of distance between agent’s belief and real network state, is proposed based on the traditional belief updating model. And the rationality of the new model is also proved. The model which transforms the belief updating progress into a linear system simplifies the analysis of belief reachability and convergence rate of the multi-agent system. Based on this model, a sufficient and necessary condition for belief reachability, and the upper limit of convergence rate of multi-agent system are proved. Besides, the belief reachability and the convergence rate of the multi-agent system in complete coupling network and scale-free network are also discussed respectively considering the characteristics of the two complicated networks. The model is adaptable to all multi-agent environments, and provides a good tool to analyze the belief reachability of the multi-agent system.

    Reference
    [1] Greenberg A, Hjalmtysson G, Maltz DA, Myers A, Rexford J, Xie G, Yan H, Zhan J, Zhang H. A clean slate 4D approach to network control and management. In: Proc. of the ACM SIGCOMM Computer Communication Review. 2005. http://166.111. 120.94/acm/Files/20100311090930625882[@58.192.124.166]@page.pdf
    [2] Clark D, Shenker S, Falk A. GENI research plan. Technical Report, GDD-06-28, GENI Planning Group, 2007. http://groups.geni. net/geni/attachment/wiki/OldGPGDesignDocuments/GDD-06-28.pdf
    [3] Lin C, Ren FY. Controllable, trustworthy and scalable new generation Internet. Journal of Software, 2004,15(12):1815-1821 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/15/1815.htm
    [4] Lin C, Lei L. Research on next generation internet architecture. Chinese Journal of Computers, 2007,30(5):693-711 (in Chinese with English abstract). http://dlib.edu.cnki.net/kns50/detail.aspx?QueryID=82&CurRec=2
    [5] Altman E, Azouzi R, Poutrallier O. Avoiding paradoxes in multi-agent competitive routing. Computer Networks, 2003,43(2): 133-146. [doi: 10.1016/S1389-1286(03)00231-7]
    [6] Emanics. Introduction to promise theory. 2006. http://project.iu.hio.no/promises.php
    [7] Burges M, Sandnes FE. A promise theory approach to collaborative power reduction in a pervasive computing environment. Lecture Notes on Computer Science, 2006,4159:615-624. [doi: 10.1007/11833529_63]
    [8] Cohen PR, Levesque HJ. Intention is choice with commitment. Artificial Intelligence, 1990,42(2-3):213-261. [doi: 10.1016/ 0004-3702(90)90055-5]
    [9] Rao AS, Georgeff MP. BDI agents: From theory to practice. In: Proc. of the 1st Int’l Conf. on Multi-Agent Systems (ICMAS’95). San Francisco, 1995. http://www.agent.ai/doc/upload/200302/rao95.pdf
    [10] Drew F, Levine D. The Theory of Learning in Games. Cambrigde: MIT Press, 1998.
    [11] Sargent TJ. The Conquest of American Inflation. Princeton: Princeton University Press, 1999.
    [12] Williams N. Escape dynamics in learning models. Working Paper, Princeton University Press, 2004.
    [13] David K. Anticipated Utility and Dynamic Choice, Frontiers of Research in Economic Theory. Cambridge: Cambridge University Press, 1977.
    [14] Chen WC. The Matrix Theory in Linear Control System. Beijing: China Water Power Press, 2000 (in Chinese).
    [15] Barabasi AL, Albert R. Emergence of scaling in random networks. Science, 1999,286(5439):509-512. [doi: 10.1126/science.286. 5439.509]
    [16] Bollobas B, Riordan OM. Mathematical results on scale-free random graphs. In: Handbook of Graphs and Network. 2003. http://hydra.icgeb.trieste.it/~pongor/biophys-homepage/Network_handbook/CH001.pdf
    [17] Wang XF, Li X, Chen GR. Complicated Network Theory and Application. Beijing: Tsinghua University Press, 2006 (in Chinese).
    附中文参考文献: [3] 林闯,任丰原.可控可信可扩展的新一代互联网.软件学报,2004,15(12):1815-1821. http://www.jos.org.cn/1000-9825/15/1815.htm
    [4] 林闯,雷蕾.下一代互联网体系结构研究.计算机学报,2007,30(5):693-711.
    [14] 陈维曾.线性控制系统中的矩阵理论.北京:中国水利水电出版社,2000.
    [17] 汪小帆,李翔,陈关荣.复杂网络理论及其应用.北京:清华大学出版社,2006.
    Related
    Cited by
Get Citation

王鹏,罗军舟,李伟,卞正皑,曲延盛.可控网络中多Agent系统信念可达性和收敛速度分析.软件学报,2010,21(4):782-792

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 08,2008
  • Revised:November 10,2008
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063