期刊名称：International Journal of Signal Processing, Image Processing and Pattern Recognition
印刷版ISSN：2005-4254
出版年度：2016
卷号：9
期号：6
页码：311-322
DOI：10.14257/ijsip.2016.9.6.27
出版社：SERSC
摘要：As the rapid increasing of Internet users from all over the world, it is necessary to enhance the reliability and compatibility of network when large number of data transferred frequently. One of the most important services is routing method since enormous data are transferred and exchanged within the network. This paper introduces an improved OSPF routing algorithm which uses the quotient and granularity space theory. Based on the simulation and experiments, several key findings are observed. Firstly, using the improved algorithm, the convergence time is much less than the no hierarchical network and the performance is better in terms of OSPF response. Secondly, it is found that the bandwidth utilization reaches 30Kbit/s, comparing with the network without hierarchy, the improvement is 40% that the bandwidth utilization increased from 18Kbit/s to 30 Kbit/s. The hierarchical network outperforms the one without layers.
