期刊文献+

基于本体的多智能体Internet动态路由研究

Multi-Agent dynamic routing in Internet based on ontology
下载PDF
导出
摘要 在Internet路由方面,传统采用的点对点或广播方式不能满足网络信息传输的效率要求,而采用组播方式缓解这个问题的相关研究大多为静态方法,不能很好地解决Internet提出的动态问题。为了实现高效率、自适应的Internet动态路由策略,在多Agent技术和本体论知识基础上,提出基于本体建立开放式多智能体Internet动态路由结构框架的思想。建立了基于多Agent的体系架构,并使用主体开发工具Protégé描述Internet主动路由的概念主体和任务主体模型,以支持Agent之间的知识共享和通信。根据该体系架构建立基于多Agent的Internet路由控制与分析系统(Multi—Agent Internet Routing System,MAIRS)。通过与相同实验环境下NS2的仿真结果进行比较,表明这个结合多Agent技术和本体方法的体系结构能够满足Internet路由的动态性和互操作性的需求。 Traditional peer-to-peer or broadcast mode cannot meet the efficiency requirements of Internet routing,and most of the approaches used in current researches on the multicast mode to alleviate this problem are static ones,which cannot solve the variableness problem proposed by Internet.In order to implement a kind of efficient and adaptive routing strategy in Internet,a new viewpoint is set forth based on multi-agent techniques and ontology methodology,in which an open multi-agent framework should be set up on the base of ontology to solve the dynamic routing problems in Internet.The multi-agent framework is set up first,and conceptual ontology and task ontology are described by using an ontology-developing tool,Protégé.This ontology model can be used to support the knowledge sharing and communication between agents.A Multi-Agent Internet Routing System (MAIRS) is built according to this framework.By comparing the results obtained by MAIRS and NS2 in the same experimental environment,it is shown that the framework combining multi-agent techniques and ontology approach is suitable to solve the variableness and interoperability requirement of routing in Internet.
作者 林琪 熊璋
出处 《计算机工程与应用》 CSCD 北大核心 2008年第32期109-112,共4页 Computer Engineering and Applications
关键词 动态路由 本体 多AGENT 仿真 dynamic routing ontology multi-agent simulation
  • 相关文献

参考文献8

  • 1Estrin D,Postel J.Routing arbiter architectural[EB/OL].[2006-04-01]. http://www.isi.edu/R 1/Publications/.
  • 2Wakikawa R,Malinen JT.Global connectivity for IPv6 mobile Ad hoc networks[S].IETF Internet Draft,2002.
  • 3Obraczka K,Tsudik G,Viswanath K.Pushing the limits of multicast in Ad hoc networks[C]//Proc of the 21st Int'l Conf on Distributed Computing Systems(ICDCS),2001:719-722.
  • 4周灵,孙亚民,卢先领.Internet高性能组播路由算法研究[J].计算机科学,2006,33(4):32-35. 被引量:1
  • 5Labrou Y,Finin T.Agent communication languages:The current landscape[J].IEEE Intelligent Systems, 1999, 14(2) :45-52.
  • 6白岩,刘大有.一种Agent通信中逻辑意外信息转换方法[J].计算机研究与发展,2007,44(3):427-433. 被引量:2
  • 7Studer R,Benjamins V R,Fensel D.Knowledge engineering,principles and methods[J].Data and Knowledge Engineering, 1998,25(122) : 161- 197.
  • 8Ehrig M,Sure Y.Ontology mapping-an integrated approach[C]//Proc of the 1st ESWS,Leeture Notes in Computer Seience.[S.l.]:Springer Verlag, 2004 ( 1 ) : 76-91.

二级参考文献33

  • 1徐格 吴建平 徐明伟.高等计算机网络[M].北京:机械工业出版社,2003..
  • 2Holbrook H,Cain B. Source-Specific Muhieast for IP. draft-ietfssm-arch-06. Mar 07, 2005
  • 3Laxman H. Sahasrabuddhe, Biswanath Mukherjee, Multicast Routing Algorithms and Protocols: A Tutorial, IEEE Network,2000(1) : 92-102
  • 4Wang Bin, Hou J C, Multicast Routing and its Extension: Problems, Algorithms, Protocols [J], IEEE Network , January 2000(1):22-36
  • 5Dijkstra E. A Note on Two Problems in Connection with Graphs[J]. Numerical Mathematic, 1959(1): 269-271
  • 6Andrew S, Tanebbaurn. Computer Networks (Third Edition).Prentice Hall International, Inc. 1996
  • 7Zhang Baoxian, Mouftah H T. A Destination-Driven Shortest Path Tree Algrithrm In:Proc. of the 2002 IEEE Intq Conf. on communication, 2002(4) ;2258-2261
  • 8Fujinoke H,Christensen K J. The New Shortest Best Path Tree(SBPT) Algorithm for Dynamic Multicast Trees. In: Proc. of the 24th IEEE Int'l Conf. on Local Computer Networks, 1999. 204-210
  • 9Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. MIT Press, 1997
  • 10Kou L, Markowsky G, Berman L, A fast algorithm for Steiner trees in graphs. Acta Informatica, 1981,15(2) : 141-145

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部