Incremental availability evaluation model for p-cycle protected connections

János Szigeti, T. Cinkler

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

3 Citations (Scopus)

Abstract

QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path. Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage. In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states. The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations. Theoretically, the complexity of the algorithm is still O(2n), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.

Original languageEnglish
Title of host publication2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007
DOIs
Publication statusPublished - 2007
Event2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007 - La Rochelle, France
Duration: Oct 7 2007Oct 10 2007

Other

Other2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007
CountryFrance
CityLa Rochelle
Period10/7/0710/10/07

Fingerprint

Availability
evaluation
heuristics
Heuristic algorithms
Network components
Quality of service

Keywords

  • Availability
  • Conditional probability
  • P-cycle

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Szigeti, J., & Cinkler, T. (2007). Incremental availability evaluation model for p-cycle protected connections. In 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007 [4762278] https://doi.org/10.1109/DRCN.2007.4762278

Incremental availability evaluation model for p-cycle protected connections. / Szigeti, János; Cinkler, T.

2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007. 2007. 4762278.

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

Szigeti, J & Cinkler, T 2007, Incremental availability evaluation model for p-cycle protected connections. in 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007., 4762278, 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007, La Rochelle, France, 10/7/07. https://doi.org/10.1109/DRCN.2007.4762278
Szigeti J, Cinkler T. Incremental availability evaluation model for p-cycle protected connections. In 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007. 2007. 4762278 https://doi.org/10.1109/DRCN.2007.4762278
Szigeti, János ; Cinkler, T. / Incremental availability evaluation model for p-cycle protected connections. 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007. 2007.
@inproceedings{7dc4cfb98e214674be16dd150d000ab3,
title = "Incremental availability evaluation model for p-cycle protected connections",
abstract = "QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path. Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage. In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states. The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations. Theoretically, the complexity of the algorithm is still O(2n), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.",
keywords = "Availability, Conditional probability, P-cycle",
author = "J{\'a}nos Szigeti and T. Cinkler",
year = "2007",
doi = "10.1109/DRCN.2007.4762278",
language = "English",
isbn = "1424438241",
booktitle = "2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007",

}

TY - GEN

T1 - Incremental availability evaluation model for p-cycle protected connections

AU - Szigeti, János

AU - Cinkler, T.

PY - 2007

Y1 - 2007

N2 - QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path. Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage. In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states. The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations. Theoretically, the complexity of the algorithm is still O(2n), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.

AB - QoS routes need availability assurance. Regardless of the applied protection scheme, there are several heuristic algorithms that can approximate the availability of connections based on the availability parameters of network components along the connection path. Accurate approximation can be achieved with simple and fast calculation only for the most basic protection schemes, the more complex the protection scheme is the more complex and long running calculation is required to get the result. Though, the inaccuracy of the heuristic algorithms is negligible in the most cases of practical usage. In this paper we present an availability calculation method for p-cycles that exploits the special properties of the p-cycle protection scheme and provides accurate results without enumerating all the possible network or protection configuration states. The method evaluates the availability of the connection along the working path link-by-link incrementally, pre-calculating also those conditional availabilities of the connection-part that may be used in latter calculations. Theoretically, the complexity of the algorithm is still O(2n), however, in fact n does not get high, moreover, it can be kept moderate low if the size of the cycles is constrained.

KW - Availability

KW - Conditional probability

KW - P-cycle

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

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

U2 - 10.1109/DRCN.2007.4762278

DO - 10.1109/DRCN.2007.4762278

M3 - Conference contribution

SN - 1424438241

SN - 9781424438242

BT - 2007 6th International Workshop on Design and Reliable Communication Networks, DRCN 2007

ER -