Experiment Specification File
< cache size (in Mbytes) first level cache,
  cache size (in Mbytes) second level cache,
  min file size (in bytes),
  on-campus files stored in cache (Y or N)?,
  all files stored in a cache (Y or N)?, 
  proxy machine speed factor,
  replacement policy first level caches,
  replacement policy second level cache or NONE if no second level cache,
  hits timed separately (Y or N)? >

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

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)
SORT          ( sort key 1, sort key 2 or "N"one)
Values for sort key are as follows
S = document size
E = time document entered cache
A = last document in cache was accessed in seconds
R = number of time document has been accessed in cache
D = time document in cache was last accessed in integer days
L = log base2 of S in integer
N = None for no second sort key

TRACE:
< 15, 0, 0, Y, Y, 1, SORT(A,N), NONE, Y >
< 15, 0, 0, Y, Y, 1, SORT(L,A), NONE, Y >
#< 15, 0, 0, Y, Y, 1, SORT(D,A), NONE, Y >
< 15, 0, 0, Y, Y, 1, SORT(R,A), NONE, Y >
#< 15, 0, 0, Y, Y, 1, SORT(E,A), NONE, Y >
< 15, 0, 0, Y, Y, 1, SORT(S,A), NONE, Y >
#< 15, 0, 0, Y, Y, 1, LRU, NONE, Y >
END.