Steve:
Let
us assume that there are n attributes and m policies.
Chris's approach will require you to register n + m OIDs and an
application will have to know about no more than n + m
OIDs.
The
other approach will require you to register n * m OIDs and an
application may have to know about up to n * m
OIDs
Thus,
the second approach makes the OIDS proliferation faster. How fast,
depends on n and m.
Santosh,
One starts with the assumption that there are N attributes to begin with,
and Chris is suggesting creating a facility to represent M policies. So,
the new registration burden under Chris's scheme is M policy OIDs, and under
my suggestion, it is up to N*M. So the added registration burden is (N-1)*M IF
every attribute is issued under every policy, which may or may not be the
case.
While in the worst case an app might have to be configured with N*M OIDs,
I suspect that in practice any app will deal with a subset of attributes and
policies and thus the config burden is likely to be considerably less than the
max.
Your actual configuration burden may vary :-)
Steve