Skip to Main Content
ASME Press Select Proceedings

International Conference on Software Technology and Engineering, 3rd (ICSTE 2011)

By
Mohamed Othman
Mohamed Othman
Search for other works by this author on:
Raja Suzana Raja Kasim
Raja Suzana Raja Kasim
Search for other works by this author on:
ISBN:
9780791859797
No. of Pages:
760
Publisher:
ASME Press
Publication date:
2011

IEEE Spanning Tree Protocol (STP) is a layer-2 protocol which ensures a loop free topology in Ethernet networks. In STP, there isn't any traffic engineering mechanism for load balancing. This results in uneven load distribution and bottlenecks, especially close to the root. In our previous work, we proposed an algorithm named Best Spanning Tree (BST) to find the best load-balanced spanning tree in a Metro Ethernet network. Although, BST algorithm is an exhaustive search algorithm that finds the Best (Optimal) spanning tree, but it is very time consuming especially when our network size is large. In this paper, we propose a simple algorithm to find the near-optimal Spanning Tree to reduce the computational complexity of BST algorithm.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal