Simulation Results

This chapter presents the results from the simulations. The results are presented for all 5 simulated schemes in a separate table for each environment. Note that the simulations demonstrate increased quality as the timespan of the scheme, the size of the scheme and the certificate validation rate increases. This is because a higher number of revocation requests is more likely to follow a certain patter.

Environment

The thesis presented three environments:

EnvironmentSizeValiditation rateValidity PeriodRevocation Rate
11005/day2 weeks10%/year
21000025/daydaily10%/year
31000000100/dayhourly10%/year

These schemes are not simulated directly, as some of the high values are very performance demanding in the simulations. The simulations become particularly slow and memory demanding for a high timespan, size and/or validation rate. Also, in order to properly simulate a scheme, the timespan can not be less than the validity period.

Because of these restrictions, a set of new environments are defined. Some of these are similar or equivalent to the above environments, wheras others are designed for the purpose of this simulation.

EnvironmentSizeValiditation rateValidity PeriodRevocation Rate
A1005/day2 weeks10%/year
B1000100/day60 min10%/year
C1000025/day30 min10%/year

For the simulations below, there are 4 Distribution Points when Distribution Points are used, and 12 delta CRL periods when delta CRLs are used.

Simulation Results

Environment A

Max Request Rate Max Delta Req. Rate Max Network Load Max Processing Load Max Delay
CRL0.03rq/s0rq/s71.73b/s0.03un/s1.22ms
CRL DP0.07rq/s0rq/s107.47b/s0.07un/s1.16ms
Delta CRL0.05rq/s0.05rq/s140.64b/s0.05un/s1.22ms
Delta CRL DP0.05rq/s0.07rq/s118.48b/s0.07un/s1.16ms
OCSP0.07rq/s0rq/s66.67b/s2.87un/s43.1ms

Environment B

Max Request Rate Max Delta Req. Rate Max Network Load Max Processing Load Max Delay
CRL1.12rq/s0rq/s9,639.07b/s1.12un/s1.86ms
CRL DP1.23rq/s0rq/s3,986.13b/s1.23un/s1.32ms
Delta CRL1.27rq/s1.3rq/s10,933.87b/s1.87un/s1.86ms
Delta CRL DP1.35rq/s1.42rq/s5,232.06b/s2.28un/s1.32ms
OCSP1.47rq/s0rq/s1,466.67b/s63.07un/s43.1ms

Environment C

Max Request Rate Max Delta Req. Rate Max Network Load Max Processing Load Max Delay
CRL3.25rq/s0rq/s238,654b/s3.25un/s8.34ms
CRL DP3.12rq/s0rq/s60,563.07b/s3.12un/s2.94ms
Delta CRL3.42rq/s3.42rq/s256,487.39b/s6.83un/s8.34ms
Delta CRL DP3.77rq/s3.77rq/s78,781.23b/s7.53un/s2.94ms
OCSP3.43rq/s0rq/s3,433.33b/s147.63un/s43.1ms

Analysis of the simulation runs

Simulation runs have demonstrated that the schemes do not demonstrate any particular pattern for a small number of requests (e.g. with timespan=60s, size=100 and validationRate=25). However, as the number of requests increases, all the schemes starts to exhibit the qualitative behavior described in Cooper's papers as outlined in the thesis.

From the simulation runs listed above, the following can be observed:

Analysis of Request Rate graphs

For parameters that involve a sufficient number of certificate validations (as in Environment B and C), the request rate graphs confirms Coope's models qualitatively:

Conclusion

These simulations have demonstrated that Cooper's models qualitatively describes the revocation schemes studied in this simulation. Also, these simulations show that using Delta CRLs combined with Distribution Points is a good way of reducing the network load and delay while gaining the good timeliness of delta CRLs. It has been shown that OCSP is very attractive when it comes to maximum network load, whereas its high processing load involves a significant delay. The processing load for Environment C is only about 7 times smaller than the processing capacity of a host. In a scheme with more requests or if the processing time for each OCSP response is larger than 43 ms (which represents the signing time for RSA), the requests will have to be queued, further increasing the delay.

A problem with the simulations was the limitations that occured due to simulation time and memory usage. While very useful when designing the simulation, an object-oriented simulation (in Java) may not be the most efficient approach. The simulations could probably have been much more efficient if implemented in a procedural language (e.g. C) or in a mathematical modelling package (e.g. Matlab).

Further Work

A natural extension of this project is to expand the simulation program to include more scheme. In particular, it would be interesting to add Over-Issuing to the program. Also, it would be interesting to study CRTs in a simulation. The program was designed to be expandable, so the expansions should not be to difficult.

The focus of this project was to develop the simulation software and to perform some experimentation. With more time, more simulations could have been performed and analyzed statistically. Also, the results could be used to verify Cooper's models quantitatively.


andrearn@pvv.ntnu.no
Last modified: Wed Apr 26 11:46:31 CEST 2000