Propose of the dynamic routing methods using available bandwidth and degree for congestion avoidance

Abstract

Open Shortest Path First (OSPF) is a popular routing protocol for the Internet services. OSPF causes network congestion if specific path becomes bottle neck links. However, OSPF can't avoid this congestion dynamically. In this paper, we propose the routing method using available bandwidth and degree. It is confirmed that the proposed method shows lower packet loss rate, shorter transmission time and higher throughput than those of OSPF.