The Algorithm Simulation Research for OSPF Network Routing Based on Granular Computing Method of Quotient Space

摘要：

This paper applies the method of observing, abstracting, problem-solving that the mankind uses in different levels of granularity in real world to the computer network routing. The authors discuss the improved OSPF routing algorithm using the granular computing method of quotient space. The paper describes the thought of granular layering and topological routing, defines the hierarchical dynamic routing (NCR) structure of cluster, domain, group, and establishes the model and algorithm of granular OSPF routing based on the quotient granular space. At last it puts forward the improved test results of algorithm simulation of hierarchical routing algorithm based on quotient space theory.

作者: Li Yang Zhang Ling Gao Ning Ma YuBao Xu GaoJian

作者单位: Computer Department of AnHui Agricultural University, Hefei 230036;AI Institute, AnHui University, H AI Institute, AnHui University, Hefei 230039 Computer Department of AnHui Agricultural University, Hefei 230036

会议类型: 国际会议

会议名称: 2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)

会议地点: 西安

会议语种:英文

在线出版日期: 2007-10-29（万方平台首次上网日期，不代表论文的发表时间）