Innovative Mobile E-Healthcare Systems: A New Rule-Based Cache Replacement Strategy Using Least Profit Values

Algorithm 1

The Profit SACCS algorithm.

Case  1. If is in the cache and valid,

    then calculate the R-LPV value

    return to the application

Case  2. If is in the cache and uncertain,

    then calculate the new R-LPV value

    send uncertain message to the server

Case  3. If is not cached or ID-only

    send cache missing message to the server.

    wait for message to appear at downlink channel

    if is confirmation, then set the state of as valid

        return to the application

    if is the data item , then

        while there not enough space for

        find minimum value = Minimum R-LPV value for data object belonging to the cache

        evict such that R-LPV value of

        keep value of the evicted data object

        end while

    bring into cache

    calculate its R-LPV value

    return to the application