By Topic

Research on Load Balancing Algorithm Based on MSTP in Dynamic Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wang Hui ; Xi''an Technol. Univ., Xi''an, China ; Wang Zhongsheng

Currently implemented Spanning Tree Protocol (STP) cannot meet the requirement of load balancing due to its poor bandwidth utilization and lack of multiple path capability. In this paper we propose a load balancing algorithm based on multiple instances spanning tree protocol (MSTP) in dynamic network after a link load function was defined. In MSTP, VLAN is divided into many group, each group would share a process of spanning tree protocol algorithm to communicate with each other by using different spanning tree topology in different VLAN. In order to realize the load balancing and redundancy backup in dynamic network, we should control the monitored relationship between the VLAN and the MSTP. With this algorithm, traffic between two communication nodes can be spread among multiple paths. The traffic split each path can be dynamic adjusted. In addition, the multiple instances spanning tree with the minimum link load can be chosen for monitoring by using this algorithm to achieve load balancing. And finally, the simulations show that the load balancing algorithm is efficient in dynamic network.

Published in:

Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on

Date of Conference:

23-25 Aug. 2012