2013 Volume 2 Issue 10 Pages 396-401
With shortest path bridging MAC (SPBM) in an access network, the paths of high rate flows can overlap on specific links and this results in congestion. It is important to avoid congestion by selecting the optimal path for each flow. This paper proposes a path selection algorithm for access networks with SPBM. The proposed algorithm avoids selecting a congested path. When a new flow arrives at an edge SW, the SW selects the path with the highest average input rate of assigned flows. We confirmed with computer simulations that the proposed algorithm could efficiently utilize links and improve throughput fairness.