An Improved OSPF Routing Algorithm Based on Quotient and Granularity Space Theory

다국어 초록 (Multilingual Abstract)

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.

목차 (Table of Contents)

• Abstract
• 1. Introduction
• 2. Mathematical Description of Two Balanced Factors
• 2.1. Routing Algorithm Based on QoS
• 2.2. Network Optimization in the QoS-based Routing Algorithm
• 2.3. Analysis of the Complexity and Feasibility of Proposed Algorithm
• 3. Granularity Space-based Routing Algorithm in Hierarchical Network
• 3.1. Representation of Xi Space Matrix
• 3.2. An Improved OSPF Routing Algorithm
• 3.3. Demonstrative Examples
• 4. Simulations and Discussions
• 5. Summary
• References