Constraint based resilience analysis

Helmut Simonis

doi:10.1007/11889205_4

Constraint based resilience analysis

Helmut Simonis

CrossCore Optimization Ltd.

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

Abstract

In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in more detail, In this problem we try to predict the loading of a network in different failure scenarios, without knowing end-tc-end flow values throughout the network; the inference is based only on observed link traffic values, The related problem of Traffic Flow Analysis aims to derive a traffic matrix from the observed link traffic data, This is a severely under-constrained problem, we can show that the obtained flow values vary widely in different, feasible solutions. Experimental results indicate that using the same data much more accurate, bounded results can be obtained for Resilience Analysis.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings
Publisher	Springer Verlag
Pages	16-28
Number of pages	13
ISBN (Print)	3540462678, 9783540462675
DOIs	https://doi.org/10.1007/11889205_4
Publication status	Published - 2006
Externally published	Yes
Event	12th International Conference on Principles and Practice of Constraint Programming, CP 2006 - Nantes, France Duration: 25 Sep 2006 → 29 Sep 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4204 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Principles and Practice of Constraint Programming, CP 2006
Country/Territory	France
City	Nantes
Period	25/09/06 → 29/09/06

Access to Document

10.1007/11889205_4

Cite this

Simonis, H. (2006). Constraint based resilience analysis. In Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings (pp. 16-28). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4204 LNCS). Springer Verlag. https://doi.org/10.1007/11889205_4

@inproceedings{34fb295437d14aec8ed0256003c870be,

title = "Constraint based resilience analysis",

abstract = "In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in more detail, In this problem we try to predict the loading of a network in different failure scenarios, without knowing end-tc-end flow values throughout the network; the inference is based only on observed link traffic values, The related problem of Traffic Flow Analysis aims to derive a traffic matrix from the observed link traffic data, This is a severely under-constrained problem, we can show that the obtained flow values vary widely in different, feasible solutions. Experimental results indicate that using the same data much more accurate, bounded results can be obtained for Resilience Analysis.",

author = "Helmut Simonis",

year = "2006",

doi = "10.1007/11889205\_4",

language = "English",

isbn = "3540462678",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "16--28",

booktitle = "Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings",

address = "Germany",

note = "12th International Conference on Principles and Practice of Constraint Programming, CP 2006 ; Conference date: 25-09-2006 Through 29-09-2006",

}

Simonis, H 2006, Constraint based resilience analysis. in Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4204 LNCS, Springer Verlag, pp. 16-28, 12th International Conference on Principles and Practice of Constraint Programming, CP 2006, Nantes, France, 25/09/06. https://doi.org/10.1007/11889205_4

Constraint based resilience analysis. / Simonis, Helmut.
Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings. Springer Verlag, 2006. p. 16-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4204 LNCS).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - Constraint based resilience analysis

AU - Simonis, Helmut

PY - 2006

Y1 - 2006

N2 - In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in more detail, In this problem we try to predict the loading of a network in different failure scenarios, without knowing end-tc-end flow values throughout the network; the inference is based only on observed link traffic values, The related problem of Traffic Flow Analysis aims to derive a traffic matrix from the observed link traffic data, This is a severely under-constrained problem, we can show that the obtained flow values vary widely in different, feasible solutions. Experimental results indicate that using the same data much more accurate, bounded results can be obtained for Resilience Analysis.

AB - In this paper we give an overview of applications of Constraint Programming for IP (Internet Protocol) data networks, and discuss the problem of Resilience Analysis in more detail, In this problem we try to predict the loading of a network in different failure scenarios, without knowing end-tc-end flow values throughout the network; the inference is based only on observed link traffic values, The related problem of Traffic Flow Analysis aims to derive a traffic matrix from the observed link traffic data, This is a severely under-constrained problem, we can show that the obtained flow values vary widely in different, feasible solutions. Experimental results indicate that using the same data much more accurate, bounded results can be obtained for Resilience Analysis.

UR - https://www.scopus.com/pages/publications/33750287601

U2 - 10.1007/11889205_4

DO - 10.1007/11889205_4

M3 - Conference proceeding

AN - SCOPUS:33750287601

SN - 3540462678

SN - 9783540462675

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 16

EP - 28

BT - Principles and Practice of Constraint Programming - CP 2006 - 12th International Conference, CP 2006, Proceedings

PB - Springer Verlag

T2 - 12th International Conference on Principles and Practice of Constraint Programming, CP 2006

Y2 - 25 September 2006 through 29 September 2006

ER -

Constraint based resilience analysis

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this