Policy division and fusion: examples and a method-or, multiple classifiers considered harmful
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 545-560
- https://doi.org/10.1109/inm.2001.918065
Abstract
Because higher- and lower-level policies do not neces- sarily correspond one-to-one, a higher-level network policy may have to be translated into two or more lower- level policies, and two or more cooperating higher-level policies may have to be translated into one lower-level policy. The former transformation is called a policy di- vision, and the latter transformation is called a policy fusion. These transformations can be performed me- chanically under certain restricted conditions, as de- scribed in this paper. In general, however, such transformations are very complicated, and the restric- tions cannot be eliminated completely. This is mainly due to the existence of multiple packet classifiers in a set of policies. This paper thus concludes that multiple classi- fiers should not be introduced, if possible. Policy division and fusion can be avoided in certain cases, but are probably unavoidable in other cases. Given this, these problems should be solved by introducing virtual flow labels to remove harmful classifiers and conducting fur- ther studies on policy division and fusion.Keywords
This publication has 3 references indexed in Scilit:
- A representation of network node QoS control policies using rule-based building blocksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Two Rule-Based Building-Block Architectures for Policy-Based Network ControlPublished by Springer Nature ,2000
- Program Transformation SystemsACM Computing Surveys, 1983