Let us assume that the broadcast sender is a radio station transmitting information about the radio conditions (block A ),the weather report (block B),the latest events in town and the menu to access these and other topics in addition to music.The sender can now assume ,knowing something about the importance of the data blocks,the block D is the most important to enable access to the other information.The second important block is A ,then B and finally C.A possible broadcast disk for this scenario could now look as follows.
DADBDADBADADDDDBDC............
It is now the receiver's task to cache the data blocks to minimize access delay as soon as a user needs a specific type of information.Again ,the receiver can only optimize caching if it knows something about the content of the data blocks.The receiver can store typical access patterns of a user to be able to guess which blocks the user will access with a high probability.Caching generally follows a cost-based strategy: what are costs for user? if if the data block has been requested but is currently not available in the cache.
Subscribe to:
Posts (Atom)
