Abstract
Most work on constraint satisfaction problems (CSP) starts with a standard problem definition and focuses on algorithms for finding solutions. However, formulating a CSP so that it can be solved by such methods is often a difficult problem in itself. In this paper, we consider the problem of routing in networks, an important problem in communication networks. It is as an example of a problem where a CSP formulation would lead to unmanageable solution complexity. We show how an abstraction technique results in tractable formulations and makes the machinery of CSP applicable to this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, Z., Crowcroft, J.: Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications 14(7), 1228–1234 (1996)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Messmer, B.T.: A framework for the development of telecommunications network planning, design and optimization applications. Technical Report FE520.02078.00 F, Swisscom, Bern, Switzerland (1997)
Mann, J.W., Smith, G.D.: A Comparison of Heuristics for Telecommunications Traffic Routing. In: Modern Heuristic Search Methods, pp. 235–254. John Wiley & Sons Ltd., Chichester (1996)
Choueiry, B.Y., Faltings, B.: A Decomposition Heuristic for Resource Allocation. In: Proc. of the 11 th ECAI, pp. 585–589. Amsterdam, The Netherlands (1994)
Weigel, R., Faltings, B.V.: Structuring Techniques for Constraint Satisfaction Problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 418–423. Morgan Kaufmann Publishers, San Francisco (1997)
Freuder, E.C., Sabin, D.: Interchangeability Supports Abstraction and Reformulation for Multi-Dimensional Constraint Satisfaction. In: Proc. of AAAI 1997, pp. 191–196. Providence, Rhode Island (1997)
Symposium on Abstraction, Reformulation and Approximation (SARA 1998). Supported in Part by AAAI, Asilomar Conference Center, Pacific Grove, California (May 1998)
Frei, C., Faltings, B.: A Dynamic Hierarchy of Intelligent Agents for Network Management. In: 2nd Int. W. on Intelligent Agents for Telecommunications Applications, IATA 1998, Paris, France. LNCS (LNAI), pp. 1–16. Springer, Heidelberg (1998)
Frei, C., Faltings, B.: Bandwidth allocation heuristics in communication networks. In: 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, ALGOTEL 1999, pp. 53–58. Roscoff, France (1999)
Haralick, R.M., Elliott, G.L.: Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, 263–313 (1980)
Gaschnig, J.: Experimental case studies of Backtrack vs. Waltz-type new algorithms. In: Proceedings 2-nd Biennial Conf. Canadian Society for Computational Study of Intelligence, Toronto, Ontario (July 1978)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proc. of the 12th IJCAI, Sidney, Australia, pp. 331–337 (1991)
Blum, A., Furst, M.: Fast Planning Through Planning Graph Analysis. Artificial Intelligence 90, 281–300 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frei, C., Faltings, B. (1999). Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques. In: Jaffar, J. (eds) Principles and Practice of Constraint Programming – CP’99. CP 1999. Lecture Notes in Computer Science, vol 1713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48085-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-48085-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66626-4
Online ISBN: 978-3-540-48085-3
eBook Packages: Springer Book Archive