Link Congestion Control Mechanism Based on Multi-Topology

There are two causes of network congestion: one is the lack of network resources, and the other is the irrational allocation of network resources. While traditional congestion control methods such as rate control, window mechanism, queue control, etc. can be applied to solve the congestion problem, but for the later congestion case, the fundamental solution is to make more effectively use of the network resources by adjusting the traffic routing choice when congestion occurs. Therefore, in the OSPF(Open Shortest Path First ) network , when congestion occurs in a certain link, lots of unused bandwidth may exist in the links which are not on the SPT. By adjusting the routes, traffic can bypass the current congest link and be forwarded to the destination consecutively, and the network congestion can be lightened eventually. In this paper we proposed a new link congestion control mechanism based on Multi-Topology: when congestion occurs in a certain link, according to the sub topology, the router can switch to the backup link computed in advance, so that traffic can avoid the current congestion to be forward to the destination. The simulation result shows that, our mechanism can make use of the remaining link bandwidth effectively to lighten network congestion.

[1]  Charles A. Eldridge,et al.  Rate controls in standard transport layer protocols , 1992, CCRV.

[2]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[3]  Ossama Younis,et al.  Constraint-based routing in the internet: Basic principles and recent research , 2003, IEEE Communications Surveys & Tutorials.

[4]  Eduardo Grampín,et al.  Design and implementation of a scalable constraint-based routing module for QoS path computation , 2007, LANC.

[5]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[6]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[9]  Larry L. Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994 .