Title :
A congestion-aware rerouting scheme in RPR networks
Author :
Hsu, Ching-Fang ; Zeng, Huan-Ru ; Ke, Jyun-Yu
Abstract :
In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.
Keywords :
metropolitan area networks; telecommunication network routing; telecommunication traffic; CAR scheme; RPR fairness mechanism; RPR network; congested link converge; congestion-aware rerouting scheme; resilient packet ring network; traffic flow; Bandwidth; Bridges; Buffer overflow; IEEE standards; Simulation; Throughput; Topology; Fairness Algorithm; Rerouting; Resilient Packet Ring;
Conference_Titel :
Local & Metropolitan Area Networks (LANMAN), 2011 18th IEEE Workshop on
Conference_Location :
Chapel Hill, NC
Print_ISBN :
978-1-4577-1264-7
DOI :
10.1109/LANMAN.2011.6076937