Photonic Network Communications

, Volume 29, Issue 1, pp 118–131 | Cite as

Co-spanning tree restoration mechanism for metro Ethernet switched networks



Ethernet, a popular technology in IT industry, with high transmission rate, simple maintenance, and compatibility with different types of links was invented for local and small-scale computer networks. However, current spanning tree-based Ethernet protocols do not meet the requirements for metro Ethernet networks in terms of network resilience. One of the most important weaknesses is slow re-convergence time in the event of a link failure when a new spanning tree must be reconstructed to ensure the survivability of networks. In this paper, we propose a co-spanning tree restoration (CSTR) mechanism for metro Ethernet switched networks to handle the link failures. Upon failure of a link on the network, a distributed failure restoration protocol will be activated to reconstruct the damaged spanning tree using a \(co\text {-}tree\) link. We explain the details of the protocol, including advertisement tables and fundamental reconfiguration processes. In addition, we propose a simple and effective solution for a double link failure and develop an optional feature to control unnecessary topology changes. The simulated results of CSTR on different network topologies show its features of efficiency and quick recovery.


Spanning tree Metro Ethernet networks Tie-set graph theory RSTP CSTR 



The authors would like to thank Dr. Alfonso Ariza Quintana at the University of Malaga in Spain, because of his valuable assistance and help during the implementation of this research and his vast knowledge in OMNeT++ which is shared with other researchers in the world. This work was supported by the Ministry of Higher Education of Malaysia under the Fundamental Research Grant FRGS/02/01/12/1143/FR for financial support.


  1. 1.
    Kern, A., Moldocan, I., Cinkler, T.: Bandwidth guarantees for resilient ethernet networks through RSTP port cost optimization. In: Proceedings of AccessNets’07 (2007)Google Scholar
  2. 2.
    Perlman, R.: An algorithm for distributed computation of a spanning tree in a extended LAN. In: Proceedings of the Ninth Symposium on Data Communications, SIGCOMM (1985)Google Scholar
  3. 3.
    IEEE 802.1d: Standard for Local and Metropolitan Area Networks—Media Access Control (MAC) BridgesGoogle Scholar
  4. 4.
    Qiu, J.: Survivability Schemes for Metro Ethernet Networks. Ph.D thesis. National University of Singapore (2010)Google Scholar
  5. 5.
    IEEE 802.1w: Standard for Local and Metropolitan Area Networks—Rapid Reconfiguration of Spanning TreeGoogle Scholar
  6. 6.
    Swamy, M., Thulasiraman, K.: Graphs, Networks, and Algorithms. Wiley, New York (2011)Google Scholar
  7. 7.
    Shinomiya, N., Toshio, K., Watanabe, H.: A theory of tie-set graph and its application to information network management. Int. J. Circuit Theory Appl. 29, 367–379 (2001)Google Scholar
  8. 8.
    IEEE 802.1s: Standard for Local and Metropolitan Area Networks—Multiple Spanning TreesGoogle Scholar
  9. 9.
    Nair, P., Nair, S., Marchetti, M., Chiruvolu, G., Ali, M.: Bandwidth sensitive fast failure recovery scheme for Metro Ethernet. Comput. Netw. 52(8), 1603–1616 (2008)CrossRefMATHGoogle Scholar
  10. 10.
    Qiu, J., Mohan, G., Chua, K.C., Liu, Y.: Local restoration with multiple spanning trees in Metro Ethernet networks. IEEE/ACM Trans. Netw. 19(2), 602–614 (2010)CrossRefGoogle Scholar
  11. 11.
    IEEE 802.1q: Standard for Local and Metropolitan Area Networks—Media Access Control (MAC) Bridges and Virtual Bridged Local Area Networks (2011)Google Scholar
  12. 12.
    Huynh, M., Mohapatra, P., Goose, S.: Spanning tree elevation protocol: enhancing metro Ethernet performance and QoS. Comput. Commun. 32(4), 750–765 (2009)CrossRefGoogle Scholar
  13. 13.
    Sharma, S., Gopalan, K., Nanda, S., Chiueh, T.: Viking : a multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks. In: Proceeding of IEEE INFOCOM’04 (2004)Google Scholar
  14. 14.
    Qiu, J., Liu, Y., Mohan, G., Chua, C.: Fast spanning tree reconnection mechanism for resilient metro ethernet networks. Comput. Netw. 55(12), 2717–2729 (2011)CrossRefGoogle Scholar
  15. 15.
    Shan, D.M., Chua, K.C., Mohan, G., Qiu, J.: Partial spatial protection for provisioning differentiated reliability in FSTR-based Metro Ethernet networks. Comput. Netw. 57(1), 46–60 (2013)CrossRefGoogle Scholar
  16. 16.
    Nakayama, K., Shinomiya, N., Watanabe, H.: An autonomous distributed control method on tie-set graph theory. IEEE Trans. Circuits Syst. 59(11), 2727–2737 (2012)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Garcia, R., Duato, J., Silla, F.: LSOM: a link state protocol over MAC addresses for metro backbones using optical ethernet switches. In: IEEE Network Computing and Applications (2003)Google Scholar
  18. 18.
    Perlman, R.: Rbridges: transparent routing. In: Proceedings IEEE INFOCOM (2004)Google Scholar
  19. 19.
    OMNeT++, discrete event simulator,
  20. 20.
    Varga, A.: OMNeT++ User Manual Version 4.2.2 (2011)Google Scholar
  21. 21.
    Ariza-Quintana, A., Casilari, E., Trivino-Cabrera, A.: Implementation of MANET routing protocols on MNEeT++. In: Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems (2008)Google Scholar
  22. 22.
    OMNeT++, Inetmanet-Integration,
  23. 23.
    Gavalas, D., Tsekouras, G.E., Anagnostopoulos, C.: A mobile agent platform for distributed network and systems management. J. Syst. Softw. 82(2), 355–371 (2009)CrossRefGoogle Scholar
  24. 24.
    Elmeleegy, K., Cox, A.L., Eugene Ng, T.S.: Understanding and mitigating the effects of count to infinity in ethernet networks. IEEE/ACM Trans. Netw. 17(1), 186–199 (2009)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Department of Communication Technology and Network, Faculty of Computer Science and Information TechnologyUniversiti Putra Malaysia (UPM)SerdangMalaysia

Personalised recommendations