Title :
An efficient fast algorithm to select the best spanning tree in metro ethernet networks
Author :
Torki, Foroogh ; Mirjalily, Ghasem ; Saadat, Reza
Author_Institution :
Fac. of Electr. & Comput. Eng., Yazd Univ., Yazd, Iran
Abstract :
Ethernet networks rely on Spanning Tree Protocol (STP) that guarantees a loop-free tree topology in the network. STP does this task by pruning the redundant links. This protocol doesn´t have any traffic engineering mechanism for load balancing since the tree construction in this protocol is only based on the shortest path criterion. In this paper, we propose an efficient fast algorithm to find the best spanning tree by modeling and solving objective functions based on load balancing criterions. By using this objective we can balance the traffic load on links and switches. Finally through some simulations on a typical network, we show the effectiveness of our approach.
Keywords :
local area networks; metropolitan area networks; protocols; resource allocation; telecommunication network topology; telecommunication traffic; trees (mathematics); STP; load balancing; loop-free tree topology; metro ethernet network; shortest path criterion; spanning tree protocol; traffic engineering mechanism; Ethernet networks; Load management; Load modeling; Optimization; Protocols; Quality of service; Software algorithms; best spanning tree; load balancing; metro Ethernet network; optimization;
Conference_Titel :
Electrical Engineering (ICEE), 2011 19th Iranian Conference on
Conference_Location :
Tehran
Print_ISBN :
978-1-4577-0730-8
Electronic_ISBN :
978-964-463-428-4
