2014 Volume 3 Issue 1 Pages 33-38
With Shortest Path Bridging MAC (SPBM), access networks can be flexibly constructed on demand. The shortest path transmission is realized without any blocking port in any network topology. However, the paths of many 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 SPBM. The proposed algorithm adjusts the path selection probabilities of equal cost trees (ECTs) based on the amount of traffic expected on each link. It efficiently utilizes links and improves throughput fairness.