Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS

Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan Thulasiraman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Scopus citations

Abstract

Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and introduced the concept of quality of protection (QoP) as a metric of multifailure recovery capabilities for single failure recovery schemes. In this paper, we present three linear time algorithms for constructing redundant trees for single link failure recovery in 2-edge connected graphs and for single node failure recovery in 2-connected graphs. Our first algorithm amis at high QoP for single link recovery schemes in 2-edge connected graphs. The previous best algorithm has a running time of O(n 2(m + n)), where n and m are the number of nodes and links in the network. Our algorithm has a running time of O(m + n), with comparable performance. Our second algorithm aims at high QoS for single link recovery schemes in 2-edge connected graphs. Our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Our third algorithm aims at high QoS for single node recovery schemes in 2-connected graphs. Again, our algorithm improves the previous best algorithm with O(n 2(m + n)) time complexity to O(m + n) time complexity with comparable performance. Simulation results show that our new algorithms outperform previously known linear time algorithms significantly in terms of QoP or QoS, and outperform other known algorithms in terms of running time, with comparable QoP of QoS performance.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsK. Makki, E. Knightly
Pages2702-2710
Number of pages9
DOIs
StatePublished - Oct 7 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Publication series

NameProceedings - IEEE INFOCOM
Volume4
ISSN (Print)0743-166X

Other

OtherIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL
Period3/13/053/17/05

    Fingerprint

Keywords

  • Blue/red trees
  • Linear time algorithms
  • Protection and restoration
  • Quality of protection
  • Quality of service
  • Redundant trees

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Zhang, W., Xue, G., Tang, J., & Thulasiraman, K. (2005). Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. In K. Makki, & E. Knightly (Eds.), Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies (pp. 2702-2710). (Proceedings - IEEE INFOCOM; Vol. 4). https://doi.org/10.1109/INFCOM.2005.1498553