{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:31:25Z","timestamp":1759091485587},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_4","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:07:42Z","timestamp":1159430862000},"page":"16-28","source":"Crossref","is-referenced-by-count":10,"title":["Constraint Based Resilience Analysis"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Simonis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ajili, F., Rodosek, R., Eremin, A.: A branch-price-and-propagate approach for optimising IGP weight setting subject to unique shortest paths. In: Proceedings of the 20th Annual ACM Symposium on Applied Computing (ACM SAC 2005), Santa Fe, New Mexico (March 2005)","DOI":"10.1145\/1066677.1066763"},{"key":"4_CR2","unstructured":"Ajili, F., Rodosek, R., Eremin, A.: A scalable tabu search algorithm for optimising IGP routing. In: 2nd International Network Optimization Conference (INOC 2005), pp. 348\u2013354 (March 2005)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cao, J., Davis, D., Vander Weil, S., Yu, B.: Time-varying network tomography. Journal of the American Statistical Association (2000)","DOI":"10.1080\/01621459.2000.10474303"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Castro, R., Coates, M., Liang, G., Nowak, R., Yu, B.: Network tomography: Recent developments (2003)","DOI":"10.1214\/088342304000000422"},{"key":"4_CR5","unstructured":"Chabrier, A.: Heuristic branch-and-price-and-cut to solve a network design problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (May 2003)"},{"key":"4_CR6","unstructured":"Chiopris, C., Fabris, M.: Optimal management of a large computer network with CHIP. In: 2nd Conf. Practical Applications of Prolog, London, UK (April 1994)"},{"key":"4_CR7","unstructured":"Chu, Y., Xia, Q.: Bandwidth-on-demand problem and temporal decomposition. In: 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, March 2005, pp. 542\u2013550 (2005)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Coates, M., Hero, A., Nowak, R., Yu, B.: Internet tomography. IEEE Signal Processing Magazine (May 2002)","DOI":"10.1109\/79.998081"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-540-30201-8_55","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"W. Cronholm","year":"2004","unstructured":"Cronholm, W., Ajili, F.: Strong cost-based filtering for Lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 726\u2013730. Springer, Heidelberg (2004)"},{"key":"4_CR10","unstructured":"Cronholm, W., Ajili, F.: Hybrid branch-and-price for multicast network design. In: 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, March 2005, pp. 796\u2013802 (2005)"},{"key":"4_CR11","unstructured":"Cronholm, W., Ouaja, W., Ajili, F.: Strengthening optimality reasoning for a network routing application. In: 4th International Workshop on Cooperative Solvers in Constraint Programming (CoSolv 2004), Toronto, Canada (September 2004)"},{"key":"4_CR12","unstructured":"Cronholm, W., Ouaja, W., Ajili, F.: Strong reduced cost fixing in network routing. In: 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, March 2005, pp. 688\u2013694 (2005)"},{"key":"4_CR13","volume-title":"MPLS: Technology and Applications","author":"B. Davie","year":"2000","unstructured":"Davie, B., Rekhter, Y.: MPLS: Technology and Applications. Morgan Kauffmann Publishers, San Francisco (2000)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Duffield, N., Lund, C., Thorup, M.: Charging from sampled network usage. In: SIGCOMM Internet Measurement workshop (November 2001)","DOI":"10.1145\/505202.505232"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Duffield, N.G., Grossglauser, M.: Trajectory sampling for direct traffic observation. IEEE\/ACM Transactions on Networking, 226\u2013237 (June 2001)","DOI":"10.1109\/90.929851"},{"key":"4_CR16","unstructured":"Eremin, A., Ajili, F., Rodosek, R.: A set-based approach to the optimal IGP weight setting problem. In: 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, March 2005, pp. 386\u2013392 (2005)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. In: SIGCOMM 2002 (September 2002)","DOI":"10.1145\/633025.633056"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"C. Frei","year":"1999","unstructured":"Frei, C., Faltings, B.: Resource allocation in networks using abstraction and constraint satisfaction techniques. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713. Springer, Heidelberg (1999)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 1998","author":"T. Fruehwirth","year":"1998","unstructured":"Fruehwirth, T., Brisset, P.: Optimal placement of base stations in wireless indoor telecommunication. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520. Springer, Heidelberg (1998)"},{"key":"4_CR20","unstructured":"Goldschmidt, O.: ISP backbone traffic inference methods to support traffic engineering. In: Internet Statistics and Metrics Analysis (ISMA) Workshop, San Diego, CA (December 2000)"},{"key":"4_CR21","unstructured":"Grossglauser, M., Rexford, J.: Passive traffic measurement for IP operations. Technical report, ATT (2001)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Kamarainen, O., El Sakkout, H.: Local probing applied to network routing. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France (April 2004)","DOI":"10.1007\/978-3-540-24664-0_12"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/3-540-46135-3_43","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"M. Lauvergne","year":"2002","unstructured":"Lauvergne, M., David, P., Boizumault, P.: Connections reservation with rerouting for ATM networks: A hybrid approach with constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 649. Springer, Heidelberg (2002)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/3-540-46135-3_42","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"C. Pape Le","year":"2002","unstructured":"Le Pape, C., Perron, L., R\u00e9gin, J.-C., Shaw, P.: Robust and parallel solving of a network design problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 633. Springer, Heidelberg (2002)"},{"key":"4_CR25","unstructured":"Lever, J.: A local search\/constraint propagation hybrid for a network routing problem. In: The 17th International FLAIRS Conference (FLAIRS 2004), Miami Beach, Florida (May 2004)"},{"issue":"1-2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0218213005001989","volume":"14","author":"J. Lever","year":"2005","unstructured":"Lever, J.: A local search\/constraint propagation hybrid for a network routing problem. International Journal on Artificial Intelligence Tools\u00a014(1-2), 43\u201360 (2005)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"4_CR27","unstructured":"Liatsos, V., Novello, S., El Sakkout, H.: A probe backtrack search algorithm for network routing. In: Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv 2003, Kinsale, Ireland (September 2003)"},{"key":"4_CR28","unstructured":"Loudni, S., David, P., Boizumault, P.: On-line resource allocation for ATM networks with rerouting. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (May 2003)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Mahajan, R., Spring, N., Wetherall, D., Anderson, T.: Inferring link weights using end-to-end measurements. In: IMW 2002 (2002)","DOI":"10.1145\/637201.637237"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Medina, A., Fraleigh, C., Taft, N., Bhattacharyya, S., Diot, C.: A taxonomy of IP traffic matrices. In: Workshop on Scalability and Traffic Control in IP Networks at the SPIE ITCOM+OPTICOMM 2002 Conference, Boston, MA (June 2002)","DOI":"10.1117\/12.475271"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrices estimation: Existing techniques and new directions. In: ACM SIGCOMM 2002, Pittsburgh, PA (August 2002)","DOI":"10.1145\/633038.633041"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: A simple tabu search for warehouse location. European Journal on Operations Research, 576\u2013591 (2004)","DOI":"10.1016\/S0377-2217(03)00247-9"},{"key":"4_CR33","unstructured":"Ouaja, W., Richards, B.: A hybrid solver for optimal routing of bandwidth-guaranteed traffic. In: INOC 2003, pp. 441\u2013447 (2003)"},{"issue":"3","key":"4_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.10110","volume":"43","author":"W. Ouaja","year":"2004","unstructured":"Ouaja, W., Richards, B.: A hybrid multicommodity routing algorithm for traffic engineering. Networks\u00a043(3), 125\u2013140 (2004)","journal-title":"Networks"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Ouaja, W., Richards, E.B.: Hybrid Lagrangian relaxation for bandwidth-constrained routing: Knapsack decomposition. In: 20th Annual ACM Symposium on Applied Computing (ACM SAC 2005), Santa Fe, New Mexico, March 2005, pp. 383\u2013387 (2005)","DOI":"10.1145\/1066677.1066766"},{"key":"4_CR36","unstructured":"Rodosek, R., Richards, B.: RiskWise constraint model. Internal Note (2000)"},{"key":"4_CR37","unstructured":"Ros, L., Creemers, T., Tourouta, E., Riera, J.: A global constraint model for integrated routeing and scheduling on a transmission network. In: 7th International Conference on Information Networks, Systems and Technologies, Minsk (October 2001)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Shang, Y., Fromherz, M., Zhang, Y., Crawford, L.S.: Constraint-based routing for ad-hoc networks. In: IEEE Int. Conf. on Information Technology: Research and Education (ITRE 2003), Newark, NJ, USA, August 2003, pp. 306\u2013310 (2003)","DOI":"10.1109\/ITRE.2003.1270627"},{"key":"4_CR39","unstructured":"Simonis, H.: Resilience analysis in MPLS networks. Technical report, Parc Technologies Ltd. (2003)"},{"key":"4_CR40","volume-title":"Handbook of Constraint Programming","author":"H. Simonis","year":"2006","unstructured":"Simonis, H.: Constraint applications in networks. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch.\u00a025. Elsevier, Amsterdam (2006)"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11493853_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B.M. Smith","year":"2005","unstructured":"Smith, B.M.: Symmetry and search in a network design problem. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 336\u2013350. Springer, Heidelberg (2005)"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Srinivasan, C., Viswanathan, A., Nadeau, T.D.: Multiprotocol label switching (MPLS) label switching router (LSR) management information base. Technical report, IETF (October 2003), draft-ietf-mpls-lsr-mib-13.txt","DOI":"10.17487\/rfc3813"},{"key":"4_CR43","unstructured":"Symes, J.: Bandwidth-on-demand services using MPLS-TE. In: MPLS World Congress 2004, Paris, France (February 2004)"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"Tsang, Y., Coates, M., Nowak, R.: Passive network tomography using EM algorithms. In: IEEE Conf. Acoust. Speech and Signal Proc. (May 2001)","DOI":"10.1109\/ICASSP.2001.941208"},{"key":"4_CR45","unstructured":"Van Hentenryck, P., Carillon, J.P.: Generality versus specificity: An experience with AI and OR techniques. In: AAAI, pp. 660\u2013664 (1988)"},{"key":"4_CR46","series-title":"Technical Report SOR 94\u201304","volume-title":"An EM approach to OD matrix estimation","author":"R. Vanderbei","year":"1994","unstructured":"Vanderbei, R., Iannone, J.: An EM approach to OD matrix estimation. Technical Report SOR 94\u201304. Princeton University, Princeton (1994)"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"Vardi, Y.: Network tomography: Estimating source-destination traffic intensities from link data. Journal of the American Statistical Association, 365\u2013377 (1996)","DOI":"10.1080\/01621459.1996.10476697"},{"key":"4_CR48","unstructured":"Xia, Q.: Traffic diversion problem: Reformulation and new solutions. In: 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, March 2005, pp. 235\u2013241 (2005)"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Xia, Q., Eremin, A., Wallace, M.: Problem decomposition for traffic diversions. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, Nice, France, April 2004, pp. 348\u2013363 (2004)","DOI":"10.1007\/978-3-540-24664-0_24"},{"key":"4_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-31956-6_72","volume-title":"Networking - ICN 2005","author":"Q. Xia","year":"2005","unstructured":"Xia, Q., Simonis, H.: Primary\/Secondary path generation problem: Reformulation, solutions and comparisons. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol.\u00a03420, pp. 611\u2013619. Springer, Heidelberg (2005)"},{"key":"4_CR51","unstructured":"Yorke-Smith, N.: Reliable Constraint Reasoning with Uncertain Data. Ph.D thesis, IC-Parc, Imperial College London, University of London (June 2004)"},{"key":"4_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/3-540-46135-3_54","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N. Yorke-Smith","year":"2002","unstructured":"Yorke-Smith, N., Gervet, C.: On constraint problems with incompleteor erroneous data. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 732. Springer, Heidelberg (2002)"},{"key":"4_CR53","unstructured":"Yorke-Smith, N., Gervet, C.: Tight and tractable reformulations for uncertain CSPs. In: CP 2004 Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Toronto, Canada (September 2004)"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Roughan, M., Duffield, N.G., Greenberg, A.: Fast accurate computation of large-scale IP traffic matrices from link loads. In: ACM Sigmetrics (2003)","DOI":"10.1145\/781027.781053"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:51:28Z","timestamp":1605624688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/11889205_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}