Congestion avoidance in interconnected metropolitan area networks

This paper presents a congestion avoidance algorithm for interconnected metropolitan area networks in the context of the FASTPAC network in Australia. A concept called congestion hazard is proposed. Congestion prediction is based on periodically computing a Congestion Hazard Event Matrix in each router. The interaction between congestion control and routing algorithm has been taken into account in the algorithm. Congestion avoidance is achieved through the strategy of re-routing, temporary cessation of sending, and dropping packets at the routers. Simulation shows its feasibility and effectiveness