The Community for Technology Leaders
Policies for Distributed Systems and Networks, IEEE International Workshop on (2005)
Stockholm, Sweden
June 6, 2005 to June 8, 2005
ISBN: 0-7695-2265-3
pp: 99-108
Marinos Charalambides , University of Surrey
Paris Flegkas , University of Surrey
George Pavlou , University of Surrey
Arosha K. Bandara , Imperial College London
Emil C. Lupu , Imperial College London
Alessandra Russo , Imperial College London
Naranker Dulay , Imperial College London
Morris Sloman , Imperial College London
Javier Rubio-Loyola , Universitat Polit?cnica de Catalunya
Policy-based management provides the ability to (re-)configure differentiated services networks so that desired Quality of Service (QoS) goals are achieved. Relevant configuration involves implementing network provisioning decisions, performing admission control, and adapting bandwidth allocation dynamically according to emerging traffic demands. A policy-based approach facilitates flexibility and adaptability in that the policies can be changed without changing the implementation. However, as with any other complex system, conflicts and inconsistencies may arise in the policy specification. In this work, we concentrate on the policy conflicts that may occur for static resource management aspects of QoS provisioning, known as Network Dimensioning. The paper shows how conflict detection can be achieved using Event Calculus in conjunction with abductive reasoning techniques to detect the existence of potential conflicts in partial specification and generate explanations for the conditions under which the conflicts arise. We finally present some conflict detection examples from our initial implementation of a policy conflict analysis tool. Although we focus on network dimensioning, many of the types of conflicts we illustrate could arise in other applications.

P. Flegkas et al., "Policy Conflict Analysis for Quality of Service Management," Policies for Distributed Systems and Networks, IEEE International Workshop on(POLICY), Stockholm, Sweden, 2005, pp. 99-108.
96 ms
(Ver 3.3 (11022016))