Fast Failure Handling in Ethernet Networks

Farkas, János; Antal, Csaba; Westberg, Lars; Paradisi, A.; Tronco, Tania Regina; Oliveira, Vinícius de

doi:10.1109/icc.2006.254812

Cited by 18 publications

(7 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Various physical network scenarios with mesh topologies have been setup and tested, such as the topologies presented in Figure 2 and in [19]. The collected results prove that the proposed topology discovery mechanism is capable of accurately determining the entire physical topology of the network including both the active topology and physical links inactivated by RSTP, as opposite to the algorithms proposed in [8][9][10][11][12][13][14][15], which methods fail to detect the inactive links in Figure 2, represented by the dashed lines, thus result in the topology depicted in Figure 6.…”

Section: Implementation and Performance Resultsmentioning

confidence: 99%

“…For example, in MANs RSTP may not be suitable, especially when protective switching is applied [19] and static VLAN topologies are calculated by a traffic engineering algorithm based on the recently discovered physical topology. On the other hand, in an enterprise LAN, the network operator will most likely decide to keep RSTP running.…”

Section: Discovery Of Inactive Linksmentioning

confidence: 99%

See 1 more Smart Citation

Automatic Discovery of Physical Topology in Ethernet Networks

Farkas

Oliveira

Salvador

et al. 2008

22nd International Conference on Advanced Information Networking and Applications (Aina 2008)

Self Cite

View full text Add to dashboard Cite

Ethernet is becoming increasingly popular in metro and access networks due to the high bandwidth available at low cost. Nonetheless, native Ethernet lacks some features that are important for sophisticated network management; providing accurate knowledge on the physical topology is one of them. Therefore, automatic physical topology discovery in support of network management is essential in Ethernet networks. Former work either focused on Layer-3 topology discovery or only provided the active topology excluding the physical links inactivated by Rapid Spanning Tree Protocol [1]. This paper introduces a novel mechanism capable of automatically discovering the entire physical topology of Ethernet networks. Our algorithm collects information available even in low-cost offthe-shelf Ethernet switches and then calculates the physical topology of the entire network. This paper describes the method and its implementation in a testbed network for assessing the performance and the robustness of the mechanism.

show abstract

Section: Implementation and Performance Resultsmentioning

confidence: 99%

Section: Discovery Of Inactive Linksmentioning

confidence: 99%

Automatic Discovery of Physical Topology in Ethernet Networks

Farkas

Oliveira

Salvador

et al. 2008

22nd International Conference on Advanced Information Networking and Applications (Aina 2008)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several mechanisms have been proposed to exploit MSTP to perform a global recovery scheme [8,[31][32][33][34][35], i.e., to take advantage of the use of two disjoint spanning tree paths (primary and backup) between each pair of border bridges. Such paths are usually pre-computed offline.…”

Section: Mstp-based Recovery Schemesmentioning

confidence: 99%

Bounded latency spanning tree reconfiguration

et al. 2015

View full text Add to dashboard Cite

“…A VLAN that binds to a spanning tree instance can only use the links belonging to the tree to deliver frames. Multi-VLAN based network protection approaches have been proposed in [5,[10][11][12][13]. Backup VLANs are provisioned in advance to protect working VLANs.…”

Section: Introductionmentioning

confidence: 99%

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

Lee

Lin³

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We propose a multitree based fast failover scheme for Ethernet networks. In our system, only few spanning trees are used to carry working traffic in the normal state. As a failure happens, the nodes adjacent to the failure redirect traffic to the preplanned backup VLAN trees to realize fast failure recovery. In the proposed scheme, a new leaf constraint is enforced on the backup trees. It enables the network being able to provide 100% survivability against any single link and any single node failure. Besides fast failover, we also take load balancing into consideration. We model an Ethernet network as a twolayered graph and propose an Integer Linear Programming (ILP) formulation for the problem. We further propose a heuristic algorithm to provide solutions to large networks. The simulation results show that the proposed scheme can achieve high survivability while maintaining load balancing at the same time. In addition, we have implemented the proposed scheme in an FPGA system. The experimental results show that it takes only fewμsec to recover a network failure. This is far beyond the 50 msec requirement used in telecommunication networks for network protection.

show abstract

Fast Failure Handling in Ethernet Networks

Cited by 18 publications

References 3 publications

Automatic Discovery of Physical Topology in Ethernet Networks

Automatic Discovery of Physical Topology in Ethernet Networks

Bounded latency spanning tree reconfiguration

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

Contact Info

Product

Resources

About