Constraint based resilience analysis

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

Volumn 4204 LNCS, Issue , 2006, Pages 16-28

  Simonis, Helmut ^a  

^a CrossCore Optimization Ltd   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; NETWORK PROTOCOLS; PROBLEM SOLVING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

CONSTRAINT PROGRAMMING; LINK TRAFFIC DATA; RESILIENCE ANALYSIS; TRAFFIC FLOW ANALYSIS;

CONSTRAINT THEORY;

EID: 33750287601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_4     Document Type: Conference Paper

References (54)

1. F. Ajili, R. Rodosek, and A. Eremin. 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 '05), Santa Fe, New Mexico, March 2005.
2. F. Ajili, R. Rodosek, and A. Eremin. A scalable tabu search algorithm for optimising IGP routing. In 2nd International Network Optimization Conference (INOC '05), pages 348-354, March 2005.
3. J. Cao, D. Davis, S. Vander Weil, and B. Yu. Time-varying network tomography. Journal of the American Statistical Association, 2000.
4. R. Castro, M. Coates, G. Liang, R. Nowak, and B. Yu. Network tomography: Recent developments, 2003.
5. A. Chabrier. 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 03, Montreal, Canada, May 2003.
6. C. Chiopris and M. Fabris. Optimal management of a large computer network with CHIP. In 2nd Conf Practical Applications of Prolog, London, UK, April 1994.
7. Y. Chu and Q. Xia. Bandwidth-on-demand problem and temporal decomposition. In 2nd International Network Optimization Conference (INOC '05), pages 542-550, Lisbon, Portugal, March 2005.
8. M. Coates, A. Hero, R. Nowak, and B. Yu. Internet tomography. IEEE Signal Processing Magazine, May 2002.
9. W. Cronholm and F. Ajili. Strong cost-based filtering for Lagrange decomposition applied to network design. In M. Wallace, editor, 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), pages 726-730, Toronto, Canada, 2004. Springer-Verlag.
10. W. Cronholm and F. Ajili. Hybrid branch-and-price for multicast network design. In 2nd International Network Optimization Conference (INOC '05), pages 796-802, Lisbon, Portugal, March 2005.
11. W. Cronholm, W. Ouaja, and F. Ajili. Strengthening optimality reasoning for a network routing application. In 4th International Workshop on Cooperative Solvers in Constraint Programming (CoSolv '04), Toronto, Canada, September 2004.
12. W. Cronholm, W. Ouaja, and F. Ajili. Strong reduced cost fixing in network routing. In 2nd International Network Optimization Conference (INOC '05), pages 688-694, Lisbon, Portugal, March 2005.
13. B. Davie and Y. Rekhter. MPLS: Technology and Applications. Morgan Kauffmann Publishers, 2000.
14. N. Duffield, C. Lund, and M. Thorup. Charging from sampled network usage. In SIGCOMM Internet Measurement workshop, November 2001.
15. N. G. Duffield and M. Grossglauser. Trajectory sampling for direct traffic observation. IEEE/ACM Transactions on Networking, pages 226-237, June 2001.
16. A. Eremin, F. Ajili, and R. Rodosek. A set-based approach to the optimal IGP weight setting problem. In 2nd International Network Optimization Conference (INOC '05), pages 386-392, Lisbon, Portugal, March 2005.
17. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In SIGCOMM2002, September 2002.
18. C. Frei and B. Faltings. Resource allocation in networks using abstraction and constraint satisfaction techniques. In Principles and Practice of Constraint Programing - CP 1999, Alexandria, Virginia, October 1999.
19. T. Fruehwirth and P. Brisset. Optimal placement of base stations in wireless indoor telecommunication. In Principles and Practice of Constraint Programing CP 1998, Pisa, Italy, October 1998.
20. O. Goldschmidt. ISP backbone traffic inference methods to support traffic engineering. In Internet Statistics and Metrics Analysis (ISMA) Workshop, San Diego, CA, December 2000.
21. M. Grossglauser and J. Rexford. Passive traffic measurement for IP operations. Technical report, ATT, 2001.
22. O. Kamarainen and H. El Sakkout. Local probing applied to network routing. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 04, Nice, France, April 2004.
23. M. Lauvergne, P. David, and P. Bauzimault. Connections reservation with rerouting for ATM networks: A hybrid approach with constraints. In P. Van Hentenryck, editor, Principles and Practice of Constraint Programing - CP 2002, Cornell University, Ithaca, N.Y., September 2002.
24. C. Le Pape, L. Perron, J. Regin, and P. Shaw. Robust and parallel solving of a network design problem. In P. Van Hentenryck, editor, Principles and Practice of Constraint Programing - CP 2002, Cornell University, Ithaca, N.Y., September 2002.
25. J. Lever. A local search/constraint propagation hybrid for a network routing problem. In The 17th International FLAIRS Conference (FLAIRS-2004), Miami Beach, Florida, May 2004.
26. J. Lever. A local search/constraint propagation hybrid for a network routing problem. International Journal on Artificial Intelligence Tools, 14(1-2):43-60, 2005.
27. V. Liatsos, S. Novelle, and H. El Sakkout. A probe backtrack search algorithm for network routing. In Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv'03, Kinsale, Ireland, September 2003.
28. S. Loudni, P. David, and P. Boizumault. 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 03, Montreal, Canada, May 2003.
29. R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. Inferring link weights using end-to-end measurements. In IMW2002, 2002.
30. A. Medina, C. Fraleigh, N. Taft, S. Bhattacharyya, and C. Diot. 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.
31. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrices estimation: Existing techniques and new directions. In ACM SIGCOMM2002, Pittsburgh, PA, August 2002.
32. L. Michel and P. Van Hentenryck. A simple tabu search for warehouse location. European Journal on Operations Research, pages 576-591, 2004.
33. W. Ouaja and B. Richards. A hybrid solver for optimal routing of bandwidthguaranteed traffic. In INOC2003, pages 441-447, 2003.
34. W. Ouaja and B. Richards. A hybrid multicommodity routing algorithm for traffic engineering. Networks, 43(3):125-140, 2004.
35. W. Ouaja and E. B. Richards. Hybrid Lagrangian relaxation for bandwidthconstrained routing: Knapsack decomposition. In 20th Annual ACM Symposium on Applied Computing (ACM SAC '05), pages 383-387, Santa Fe, New Mexico, March 2005.
36. R. Rodosek and B. Richards. RiskWise constraint model. Internal Note, 2000.
37. L. Ros, T. Creemers, E. Tourouta, and J. Riera. 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.
38. Y. Shang, M. Fromherz, Y. Zhang, and L. S. Crawford. Constraint-based routing for ad-hoc networks. In IEEE Int. Conf. on Information Technology: Research and Education (ITRE 2003), pages 306-310, Newark, NJ, USA, August 2003.
39. H. Simonis. Resilience analysis in MPLS networks. Technical report, Pare Technologies Ltd, 2003.
40. H. Simonis. Constraint applications in networks. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 25. Elsevier, 2006.
41. B. M. Smith. Symmetry and search in a network design problem. In Roman Bartàk and Michela Milano, editors, CPAIOR, volume 3524 of Lecture Notes in Computer Science, pages 336-350. Springer, 2005.
42. C. Srinivasan, A. Viswanathan, and T. D. Nadeau. Multiprotocol label switching (MPLS) label switching router (LSR) management information base. Technical report, IETF, October 2003. draft-ietf-mpls-lsr-mib-13.txt.
43. J. Symes. Bandwidth-on-demand services using MPLS-TE. In MPLS World Congress 2004, Paris, France, February 2004.
44. Y. Tsang, M. Coates, and R. Nowak. Passive network tomography using EM algorithms. In IEEE Conf Acoust. Speech and Signal Proc, May 2001.
45. P. Van Hentenryck and J.P. Carillon. Generality versus specificity: An experience with AI and OR techniques. In AAAI, pages 660-664, 1988.
46. R. Vanderbei and J. lannone. An EM approach to OD matrix estimation. Technical Report SOR 94-04, Princeton University, 1994.
47. Y. Vardi. Network tomography: Estimating source-destination traffic intensities from link data. Journal of the American Statistical Association, pages 365-377, 1996.
48. Q. Xia. Traffic diversion problem: Reformulation and new solutions. In 2nd International Network Optimization Conference (INOC '05), pages 235-241, Lisbon, Portugal, March 2005.
49. Q. Xia, A. Eremin, and M. Wallace. Problem decomposition for traffic diversions. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2004, pages 348-363, Nice, France, April 2004.
50. Q. Xia and H. Simonis. Primary/secondary path generation problem: Reformulation, solutions and comparisons. In 4th International Conference on Networking, Reunion Island, France, 2005. Springer Verlag.
51. N. Yorke-Smith. Reliable Constraint Reasoning with Uncertain Data. PhD thesis, IC-Parc, Imperial College London, University of London, June 2004.
52. N. Yorke-Smith and C. Gervet. On constraint problems with incomplete or erroneuos data. In P. Van Hentenryck, editor, Principles and Practice of Constraint Programing - CP 2002, Cornell University, Ithaca, N.Y., September 2002.
53. N. Yorke-Smith and C. Gervet. Tight and tractable reformulations for uncertain CSPs. In CP '04 Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Toronto, Canada, September 2004.
54. Y. Zhang, M. Roughan, N.G. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In ACM Sigmetrics, 2003.