Added simulation stop condition for maximum access count for the object with the highest lambda

Signed-off-by: Tuan-Dat Tran <tuan-dat.tran@tudattr.dev>

note.md

@@ -20,3 +20,60 @@ lambda(i) is zipf distribution describing the rate the client requests the objec
 Inter arrival time of each object => exponential
 
 Hit rate and the average age of the object based on TTL
+
+## Notes 11/13/2024
+
+### Limitations of time
+
+Run the simulation not time based but based on when the least ranked object is requested
+at least times for example.
+Least ranked object -> least zipf value
+
+2-3h
+
+### mu
+
+Simulate lambda and mu to see what increases the cost function
+
+### Bandwidth
+
+Finite bandwidth between cache and server
+miss requests and cache updates should not go over the bandwidth
+
+### Two versions
+
+1.
+
+- Do Refresh
+- Do Request
+
+2.
+
+- Just Request
+- No Refresh
+
+3.
+
+- LRU
+- Infinite TTL
+- No Refresh
+
+4.
+
+- Random eviction
+- Regular TTL
+- With Refresh
+
+5.
+
+- Random eviction
+- Regular TTL
+- Without Refresh
+
+
+
+### Runtime
+
+CPU times: user 3min 46s, sys: 43 s, total: 4min 29s
+Wall time: 4min 29s
+for ACCESS_COUNT_LIMIT = 10_000   # Total time to run the simulation