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 Citations (Scopus)

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
EditorsK. Makki, E. Knightly
Pages2702-2710
Number of pages9
Volume4
DOIs
StatePublished - 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: Mar 13 2005Mar 17 2005

Other

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

Fingerprint

Quality of service
Recovery

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

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 (Vol. 4, pp. 2702-2710) https://doi.org/10.1109/INFCOM.2005.1498553

Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. / Zhang, Weiyi; Xue, Guoliang; Tang, Jian; Thulasiraman, Krishnaiyan.

Proceedings - IEEE INFOCOM. ed. / K. Makki; E. Knightly. Vol. 4 2005. p. 2702-2710.

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

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. vol. 4, pp. 2702-2710, IEEE INFOCOM 2005, Miami, FL, United States, 3/13/05. https://doi.org/10.1109/INFCOM.2005.1498553
Zhang W, Xue G, Tang J, Thulasiraman K. Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. In Makki K, Knightly E, editors, Proceedings - IEEE INFOCOM. Vol. 4. 2005. p. 2702-2710 https://doi.org/10.1109/INFCOM.2005.1498553
Zhang, Weiyi ; Xue, Guoliang ; Tang, Jian ; Thulasiraman, Krishnaiyan. / Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS. Proceedings - IEEE INFOCOM. editor / K. Makki ; E. Knightly. Vol. 4 2005. pp. 2702-2710
@inproceedings{743c96f3bb0343d4ad3b3113fc49f0bc,
title = "Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS",
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.",
keywords = "Blue/red trees, Linear time algorithms, Protection and restoration, Quality of protection, Quality of service, Redundant trees",
author = "Weiyi Zhang and Guoliang Xue and Jian Tang and Krishnaiyan Thulasiraman",
year = "2005",
doi = "10.1109/INFCOM.2005.1498553",
language = "English (US)",
isbn = "0780389689",
volume = "4",
pages = "2702--2710",
editor = "K. Makki and E. Knightly",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

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

AU - Zhang, Weiyi

AU - Xue, Guoliang

AU - Tang, Jian

AU - Thulasiraman, Krishnaiyan

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - Blue/red trees

KW - Linear time algorithms

KW - Protection and restoration

KW - Quality of protection

KW - Quality of service

KW - Redundant trees

UR - http://www.scopus.com/inward/record.url?scp=25644442522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25644442522&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2005.1498553

DO - 10.1109/INFCOM.2005.1498553

M3 - Conference contribution

AN - SCOPUS:25644442522

SN - 0780389689

VL - 4

SP - 2702

EP - 2710

BT - Proceedings - IEEE INFOCOM

A2 - Makki, K.

A2 - Knightly, E.

ER -