2005 · 15 citations · 5 references
ComputingComputer EngineeringComputer ScienceComputer NetworksEnterprise SystemsInterconnection NetworksCommunication Network ProtectionCommunication NetworksInternet Protocol SuiteNetwork Fault ToleranceNetwork ProtocolsNetwork TopologyConvergence TimeEthernetNetwork SlicingNetwork Traffic EngineeringSpanning Tree ConstructionSpanning Tree ProtocolVlan DesignVlan Tagging
IEEE 802.1s multiple spanning tree protocol (MSTP) is part of a family of standards for local and metropolitan area networks based on Ethernet protocol. MSTP allows a set of regions to be defined whose logical union spans the entire network, which in turn defines the association between VLANs and Spanning Tree Instances. In this paper we propose an algorithmic approach for constructing multiple spanning tree regions in the enterprise network domain which will provide better convergence time, reusability of VLAN tags, protection from failures, and optimal broadcast domain size.
5
Robert W. Floyd · Communications of the ACM · 1962 · 4K citations · Full text
A fast algorithm for Steiner trees
Lawrence T. Kou, George Markowsky, L. Berman · Acta Informatica · 1981 · 1.2K citations
Issues and approaches on extending Ethernet beyond LANs
G. Chiruvolu, An Ge, D. Elie-Dit-Cosaque et al. · IEEE Communications Magazine · 2004 · 61 citations
Metro ethernet traffic engineering based on optimal multiple spanning trees~
M. Padmaraj, S. Nair, Marco Marchetti et al. · 2005 · 20 citations