Efficient Routing in SDN using Minimum Bottleneck Spanning Tree

Software-defined networking (SDN) decouples control and data planes of network devices to manage network services and determine forwarding paths in a centralized manner. In order to reduce the occurrence of path rerouting, we proposed a routing scheme to generate both default and alternative paths based on the minimum bottleneck spanning tree (MBST). With the proposed routing algorithm, routing paths was evenly distributed to different links, and redundant path rerouting was avoided. The experimental results demonstrated that the proposed scheme reduced the number of path-rerouting occurrences. The proposed scheme balanced link loads effectively.