Abstract:
In Open Shortest Path First (OSPF) routing protocol, all the packets are transmitted over the shortest path. And these path is determined by the weight associated with each link in the network. According to OSPF the link with minimum weight will transmit most of the packet. For this, at a moment the link exceeds its maximum capacity, thus congestion occurs. This problem can be avoided by applying an optimal set of link weight. To solve this OSPF weight setting problem several iterative methods have been used.In this paper, we have evaluated an algorithm proposed by Kamrul and Oki [1] to solve this problem. And we found that the computational result leads us to minimize the maximum network congestion.
Description:
This thesis submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering of East West University, Dhaka, Bangladesh.
