Load Balanced Spanning Tree in Metro Ethernet Networks
Journal Title: Journal of Information Systems and Telecommunication - Year 2014, Vol 2, Issue 2
Abstract
Spanning Tree Protocol (STP) is a link management standard that provides loop free paths in Ethernet networks. Deploying STP in metro area networks is inadequate because it does not meet the requirements of these networks. STP blocks redundant links, causing the risk of congestion close to the root. As a result, STP provides poor support for load balancing in metro Ethernet networks. A solution for this problem is using multi-criteria spanning tree by considering criterions related to load balancing over links and switches. In our previous work, an algorithm named Best Spanning Tree (BST) is proposed to find the best spanning tree in a metro Ethernet network. BST is based on the computation of total cost for each possible spanning tree; therefore, it is very time consuming especially when the network is large. In this paper, two heuristic algorithms named Load Balanced Spanning Tree (LBST) and Modified LBST (MLBST) will be proposed to find the near-optimal balanced spanning tree in metro Ethernet networks. The computational complexity of the proposed algorithms is much less than BST algorithm. Furthermore, simulation results show that the spanning tree obtained by proposed algorithms is the same or similar to the spanning tree obtained by BST algorithm.
Authors and Affiliations
Ghasem Mirjalily, Samira Samadi
Keywords
Related Articles
- EP ID EP185961
- DOI 10.7508/jist.2014.02.007
- Views 128
- Downloads 0
Multimodal Biometric Recognition Using Particle Swarm Optimization-Based Selected Features
Feature selection is one of the best optimization problems in human recognition, which reduces the number of features, removes noise and redundant data in images, and results in high rate of recognition. This step affect...
Facial Expression Recognition Using Texture Description of Displacement Image
In recent years, facial expression recognition, as an interesting problem in computer vision has been performed by means of static and dynamic methods. Dynamic information plays an important role in recognizing facial ex...
A New Recursive Algorithm for Universal Coding of Integers
In this paper, we aim to encode the set of all positive integers so that the codewords not only be uniquely decodable but also be an instantaneous set of binary sequences. Elias introduces three recursive algorithms for...
Simultaneous Methods of Image Registration and Super-Resolution Using Analytical Combinational Jacobian Matrix
In this paper we propose two new simultaneous image registration (IR) and super-resolution (SR) methods using a novel approach to calculate the Jacobian matrix. SR is the process of fusing several low resolution (LR) ima...
High I/Q Imbalance Receiver Compensation and Decision Directed Frequency Selective Channel Estimation in an OFDM Receiver Employing Neural Network
The disparity introduced between In-phase and Quadrature components in a digital communication system receiver known as I/Q imbalance is a prime objective within the employment of direct conversion architectures. It redu...