Rate-based path selection for shortest path bridging in access networks
Yu Nakayama · 2014
With shortest path bridging MAC (SPBM) in an access network, shortest path transmission can be realized without a blocking port in any network topology. The approach is expected to use network resources efficiently and to simplify the operating procedure. Access networks can be flexibly constructed on demand with SPBM. However, if there is a deviation in the flow traffic rate, the paths of high rate flows can overlap on specific links and congestion occurs. It is important to avoid congestion by selecting the optimal path for each flow. This paper proposes a rate-based path selection algorithm for access networks with SPBM. The proposed algorithm assumes that a path with a low average rate will be congested because the rates of TCP flows decrease on a congested path. When a new flow arrives at an edge switch, it selects the path with the highest average rate on which it can be expected to realize a high rate. I confirmed with computer simulations that the proposed algorithm could efficiently utilize links and improve throughput fairness.