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)?,
  bitmap of files stored in the cache (1 for store or 0 no store X 10), 
  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)? >

bitmap file types:
  text: txt, faq
  structure formated text: html, (none)
  layout formated text: sgml, ps, wri, tex, eps, dvi, pdf, doc
  sound: au, snd, mod, mid, way
  inlined images: gif, xbm
  standalone images: tif, tiff, jpg, jpeg, iff
  ISMAP: ?
  form response script input: ?
  video: mpeg, mov, mpg, avi, qt
  all others:  
  
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 time document in cache was accessed in seconds
R = number of times document has been accessed in cache
D = time document in cache was last accessed in integer days
L = log base2 of S in integer
U = random sample on U(0,1)
N = None for no second sort key

TRACE:
#EXAMPLE experiment
#<  9.99, 0, Y, Y, 1, PITKOW(3, 95), Y >
#< 9.99, 20, 0, Y, Y, 1, LRU, LRU, Y >
< 5.0, 20, 0, Y, 0000011111, 1, SORT( R, E), LRU, Y >
END.
<  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.