A queue records insertion order so a bounded cache can evict the oldest entry first. Updating an existing key removes and re-adds it, resetting its position. section 7.4.2
Bounded cache
A cache with capacity three receives keys 1, 2, and 3. Updating key 1 moves it behind key 3; inserting key 4 then evicts key 2, the oldest remaining entry.























