MPLS: technology and applications
MPLS: technology and applications
Trajectory sampling for direct traffic observation
IEEE/ACM Transactions on Networking (TON)
Charging from sampled network usage
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Optimal Placement of Base Stations in Wireless Indoor Telecommunication
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Resource Allocation and Constraint Satisfaction Techniques
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Robust and Parallel Solving of a Network Design Problem
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Connections Reservation with Rerouting for ATM Networks: A Hybrid Approach with Constraints
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On Constraint Problems with Incomplete or Erroneous Data
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Fast accurate computation of large-scale IP traffic matrices from link loads
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 2005 ACM symposium on Applied computing
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition
Proceedings of the 2005 ACM symposium on Applied computing
Passive network tomography using EM algorithms
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Primary/secondary path generation problem: reformulation, solutions and comparisons
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Certainty closure: Reliable constraint reasoning with incomplete or erroneous data
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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-to-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.