i use polygraph against one squid server to extract the access.log file.
the log file entries will be used against my caching algorithm for distr.
proxy servers.
in almost all polygraph tests i receive a declining hit rate (my algorithm
is defined in such a way that it simulates the storage of 5000 objects,
disregarding the object-size, on a hashing method as used in CARP).
example :
recurrence 0.6 & zipf(0.6) = graph declines for 1 mill. requests
recurrence 0.5 & unif = graph declines for 700k requests
recurrence 0.9 & zipf(0.9) = graph declines until 400k (HR=0.5) and jumps
after 400k suddenly to HR 0.95.
i received a similar declining graph with the polymix-1 file.
it is not clear to me, why the HR is decreasing over time (i ran my simul.
with different cache-sizes) or why it suddenly increases in the last case
(is there a "session" defined, when i dont define one? my test ran for 10
hours)
when the reccurrence value is focusing on an over time increasing dataset
how can the hit rate find a stable minimum (shouldnt it always decline?).
is there a tool that allows me the extraction of the over-time hit rate (not
the final value)?
the file with 1 mill. requests contains around 400k uniq calls ... what
assumptions can i make in regard to the average number of stored objects
(disregarding the object size).
thank you
-markus
-- GMX - Die Kommunikationsplattform im Internet. http://www.gmx.net
This archive was generated by hypermail 2b29 : Mon Feb 06 2006 - 12:00:22 MST