1. A method of inserting cache blocks into a cache queue, comprising: detecting, by a processor, a first cache miss for the cache queue; identifying, by the processor, a storage block receiving an access in response to the cache miss; calculating, by the processor, a first estimated cache miss cost for a first storage container comprising the storage block; calculating, by the processor, an insertion probability for the first storage container based on a mathematical formula of the first estimated cache miss cost; randomly selecting an insertion probability number from a uniform distribution, wherein the insertion probability exceeds the insertion probability number; and inserting, in response to the insertion probability exceeding the insertion probability number, a new cache block corresponding to the storage block into the cache queue.