Distributed resilient architecture for Ethernet networks

Proceedings - 2005 DRCN: 5th International Workshop on Design of Reliable Communication Networks - "Reliable Networks for Reliable Services"

Volumn 2005, Issue , 2005, Pages 515-522

  Farkas, János ^a   Antal, Csaba ^a   Tóth, Gábor ^a   Westberg, Lars ^b  

^a ERICSSON RESEARCH   (Hungary)

^b ERICSSON RESEARCH   (Sweden)

Author keywords

Ethernet; Fast convergence; Resilience; Spanning tree

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES;

ETHERNET; FAST CONVERGENCE; RESILIENCE; SPANNING TREES;

COMPUTER ARCHITECTURE;

EID: 33745263793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DRCN.2005.1563919     Document Type: Conference Paper

References (13)

1. IEEE 802.1q, Standard for local and metropolitan area networks - Virtual bridged local area networks.
2. ITU contrib. WD 14 Q12/15, "Service provider Ethernet switching," May 2003.
3. IEEE 802.1d, Standard for local and metropolitan area networks - Media access control (MAC) bridges.
4. IEEE 802.1w, Standard for local and metropolitan area networks - Rapid reconfiguration of spanning tree.
5. E. Shah, "Ethernet automatic protection switching," RFC 3619, October 2003.
6. S. Sharama, K. Gopalan, S. Nanda, and T. Chiueh, "Viking: A multispanning-tree Ethernet architecture for metropolitan area and cluster metworks," INFOCOM 2004, March 2004.
7. IEEE 802.1s, Standard for local and metropolitan area networks - Multiple spanning trees.
8. H.N. Gabow, "A matroid approach to finding edge connectivity and packing arborescences," J. Computer & System Sciences, 1995.
9. J. Roskind and R.E. Tarjan, "A note on finding minimum cost edge disjoint spanning trees," Mathematics of Operations Research, vol. 10, no. 4, pp. 701-708, November 1985.
10. R.F.F. Werneck, J.C. Setubal and A.F. Conceicao, "Finding minimum congestion spanning trees," ACM Journal of Experimental Algorithms, 2000.
11. A. Young et al., "Overlay mesh construction using interleaved spanning trees," INFOCOM 2004, March 2004.
12. D. Katz and D. Ward, "Bidirectional forwarding detection," IETF draft, July 2004.
13. D. Katz and D. Ward, "BFD for multihop paths," IETF draft, July 2004.