Taxonomy and Description of Policy Combination Methods

  • Yasusi Kanada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1995)


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.


Parallel Application Policy Rule Network Device Edge Router Expedite Forward 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aim 00]
    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,, The Institute of Electronics, Information and Communication Engineers, 2000.Google Scholar
  2. [All 83]
    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.Google Scholar
  3. [Ber 99]
    Bernet, Y., et al, “A Framework for Differentiated Services”, draft-ietf-diffserv-framework-02.txt, Internet Draft, February 1999.Google Scholar
  4. [Fly 66]
    Flynn, M. J., “Very High-speed Computing Systems”, Proc. IEEE, 54:12, pp. 1901symbol 150 ∖f “Times New Roman CE” ∖s 9-} 1909, 1965.Google Scholar
  5. [For 81]
    Forgy, C. L.,“OPS5 User’s Manual”, Technical Report CMU-CS-81-135, Carnegie Mellon University, Dept. of Computer Science, 1981.Google Scholar
  6. [Jac 99]
    Jacobson, V., Nichols, K., and Poduri, K., “An Expedited sForwarding PHB”, RFC 2598, June 1999.Google Scholar
  7. [Kan 99]
    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,, October 1999.
  8. [Kan 00a]
    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.Google Scholar
  9. [Kan 00b]
    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.Google Scholar
  10. [Kuc 81]
    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.Google Scholar
  11. [Nic 98]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Yasusi Kanada
    • 1
  1. 1.Research & Development Group, Hitachi, Ltd.IP Network Research CenterYokohamaJapan

Personalised recommendations