Load balancing in metro ethernet networks by selecting the best spanning tree

zbMATH Open1236.68015MaRDI QIDQ5388992FDOQ5388992

Authors Ghasem MIRJALILY, Mohammad Hadi Karimi Tafti, Shahram Rajaee 

Publication date 24 April 2012

zbMATH Keywords

load balancingspanning tree protocolethernetbest spanning treemetro ethernet network

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Recommendations

• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol
• Bandwidth sensitive fast failure recovery scheme for Metro Ethernet
• Stable routing under the Spanning Tree Protocol
• Suboptimal-optimal routing for LAN internetworking using transparent bridges

Cited in

(2)

• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• Bandwidth sensitive fast failure recovery scheme for Metro Ethernet

This page was built for publication: Load balancing in metro ethernet networks by selecting the best spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388992)