A SIMPLE ALGORITHM TO FIND THE PROPER SPANNING TREE IN METRO ETHERNET NETWORKS

被引：0

作者：

Samadi, Samira ^{[1
]}

Mirjalily, Ghasem ^{[1
]}

Almodarresi, S. M. T. ^{[1
]}

机构：

[1] Yazd Univ, Fac Elect & Comp Engn, Yazd, Iran

来源：

PROCEEDINGS OF THE 2011 3RD INTERNATIONAL CONFERENCE ON SOFTWARE TECHNOLOGY AND ENGINEERING (ICSTE 2011) | 2011年

关键词：

Metro Ethernet Network; Best Spanning Tree; Load Balancing;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：185 / 189

页数：5

共 50 条

[21] A minimal spanning tree algorithm for distribution networks configuration
Montoya, Diana P.
Ramirez, Juan M.
2012 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2012,
[22] Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree
Ghods M.
Rostami Z.
Ghods, Masoud (mghods@semnan.ac.ir), 1600, University of New Mexico (36): : 37 - 49
[23] Viking: A multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks
Sharma, S
Gopalan, K
Nanda, S
Chiueh, TC
IEEE INFOCOM 2004: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2004, : 2283 - 2294
[24] Smart Spanning Tree Bridging For Metro Ethernets
Meddeb, Aref
2008 IEEE 33RD CONFERENCE ON LOCAL COMPUTER NETWORKS, VOLS 1 AND 2, 2008, : 481 - 488
[25] An Algorithm to Find the Constrained Steiner Tree in Halin Networks
Lu, Yunting
Li, Zhenjun
Li, Min
FGCN: PROCEEDINGS OF THE 2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING, VOLS 1 AND 2, 2008, : 421 - +
[26] A linear algorithm to find the Steiner tree in Halin networks
Lu, Yunting
IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2307 - 2311
[27] Metro ethernet traffic engineering based on optimal multiple spanning trees
Padmaraj, M
Nair, S
Marchetti, M
Chiruvolu, G
Ali, M
Ge, A
2005 INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS NETWORKS, 2005, : 568 - 572
[28] HOW TO FIND A MINIMUM SPANNING TREE IN PRACTICE
MORET, BME
SHAPIRO, HD
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 555 : 192 - 203
[29] A Spanning Tree Algorithm for Data Aggregation in Wireless Sensor Networks
Shao, Jie
Ye, Ning
2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 5014 - +
[30] Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
Nepomnyashchaya, AS
CYBERNETICS AND SYSTEMS ANALYSIS, 1998, 34 (01) : 77 - 85

← 1 2 3 4 5 →