Experiment Specification File
< cache size, min file size, on-campus?, all files?, 
  proxy machine speed factor, replacement policy, hits timed separately?>

Choice of caching replacement policy algorithms are:
 (LRU, LRU-MIN, LRU-THRESHOLD, PITROW-RECKER)

If the policy has parameters these are given in parentheses 
following the policy as follows:
LRU             none
LRU-MIN       ( divisor for reduction of minimal file size per pass )
LRU-THRESHOLD ( maximum file size for caching )
PITKOW&RECKER ( window size in days, comfort level as % of cache size)


TRACE:
#EXAMPLE experiment
<  9999999999, 0, Y, Y, 1, LRU, Y >
END.
< 160, 0, Y, Y, 1, LRU, Y >
<  20, 1, Y, Y, 1, LRU, Y >
< 160, 1, Y, Y, 1, LRU, Y >
<  20, 0, N, Y, 1, LRU, Y >
< 160, 0, N, Y, 1, LRU, Y >
<  20, 1, N, Y, 1, LRU, Y >
< 160, 1, N, Y, 1, LRU, Y >
<  20, 0, Y, N, 1, LRU, Y >
< 160, 0, Y, N, 1, LRU, Y >
<  20, 1, Y, N, 1, LRU, Y >
< 160, 1, Y, N, 1, LRU, Y >
<  20, 0, N, N, 1, LRU, Y >
< 160, 0, N, N, 1, LRU, Y >
<  20, 1, N, N, 1, LRU, Y >
< 160, 1, N, N, 1, LRU, Y >
END.