« Two Rule-based Building-block Architectures for Policy-based Network Control | Main | Policy Division and Fusion: Examples and a Method - or, Multiple Classifiers Considered Harmful »

Taxonomy and Description of Policy Combination Methods

Kanada, Y., Workshop on Policies for Distributed Systems and Networks (Policy 2001), Lecture Notes in Computer Science, No. 1995, Springer, pp. 171-184, January 2001.

[ 日本語のページ ]
[ Paper PDF file ] [ OHP PDF file ]

Abstract: To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specific purpose is called policy combination. Methods of passing information between combined policies can be classified into real tags and virtual tags, or labels and attributes. Policy combinations can be classified into concatenation, parallel application, selection, and repetition. Explicitly specifying policy combinations makes policy systems semantically clearer and better suited to general use, extends the range of functionality, and improves the possibility of optimization. If policy combinations can be specified in a policy system, two types of policy organizations can be distinguished: homogeneous and heterogeneous. Heterogeneous organization is more service-oriented and seems to meet service-management requirements, but homogeneous organization is more device-oriented and may provide better performance.

Introduction to this research theme: Policy-based Networking

Keywords: Component-based policy, Policy components, Policy combination, Policy-based management

Post a comment


This page contains a single entry from the blog posted on January 29, 2001 12:00 AM.

Many more can be found on the main index page or by looking through the archives.

(C) Copyright 2007 by Yasusi Kanada
Powered by
Movable Type 3.36