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.
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
Aimoto, T., and Miyake, S., “Overview of DiffServ Technology: Its Mechanism and Implementation”, IEICE Transaction on Information and Systems, Vol. E83-D, No.5, pp. 957–. 964,http://search.ieice.or.jp/2000/pdf/e83-d_5_957.pdf, The Institute of Electronics, Information and Communication Engineers, 2000.
Allen, J.R., Kennedy, K., Porterfield, C., and Warren, J., “Conversion of Control Dependence to Data Dependence”, 10th ACM Symposium on Principles of Programming Languages, (POPL 83), pp. 177symbol 150 ∖f “Times New Roman CE” ∖s 9-} 189, 1983.
Bernet, Y., et al, “A Framework for Differentiated Services”, draft-ietf-diffserv-framework-02.txt, Internet Draft, February 1999.
Flynn, M. J., “Very High-speed Computing Systems”, Proc. IEEE, 54:12, pp. 1901symbol 150 ∖f “Times New Roman CE” ∖s 9-} 1909, 1965.
Forgy, C. L.,“OPS5 User’s Manual”, Technical Report CMU-CS-81-135, Carnegie Mellon University, Dept. of Computer Science, 1981.
Jacobson, V., Nichols, K., and Poduri, K., “An Expedited sForwarding PHB”, RFC 2598, June 1999.
Kanada, Y., Ikezawa, M., Miyake, S., and Atarashi, Y., “SNMP-based QoS Programming Interface MIB for Routers”, draft-kanada-diffserv-qospifmib-00.txt, Internet Draft, http://www.kanadas.com/activenet/draft-kanada-diffserv-qospifmib-00.txt, October 1999.
Kanada, Y., “A Representation of Network Node QoS Control Policies Using Rule-based Building Blocks”, International Workshop on Quality of Service 2000 (IWQoS 2000), pp. 161–163, June 2000.
Kanada, Y., “Two Rule-based Building-block Architectures for Policy-based Network Control”, 2nd International Working Conference on Active Networks (IWAN 2000), Lecture Notes in Computer Science, No. 1942, pp. 195–210, Springer, October 2000.
Kuck, D. J., Kuhn, R. H., Padua, D. H., Leasure, B., and Wolfe, M., “Dependence Graphs and Compiler Optimizations”, 8th ACM Symposium on Principles of Programming Languages (POPL 81), pp. 207–218, 1981.
Nichols, K., Blake, S., Baker, F., and Black, D., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers”, RFC 2474, December 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanada, Y. (2001). Taxonomy and Description of Policy Combination Methods. In: Sloman, M., Lupu, E.C., Lobo, J. (eds) Policies for Distributed Systems and Networks. POLICY 2001. Lecture Notes in Computer Science, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44569-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-44569-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41610-4
Online ISBN: 978-3-540-44569-2
eBook Packages: Springer Book Archive