Research Article
Caching Efficiency Enhancement at Wireless Edges with Concerns on User’s Quality of Experience
Algorithm 1
Caching replacement algorithm.
Initialization: | Caching contents and corresponding weight | factor ; | Weight threshold ; Number of caching contents ; | Weight comparison factor ; | New caching content’s size ; | Neighbor router available cache size ; | Main routine: | Calculate comparison factor , and ; | Reorder the comparison factor of new caching contents as | | and the caching content’s size set as | if , then | The new content data will not be cached by the local caching node; | if , then | The new content data will not be cached by the local caching node; | else | if , then | Replace the content correlated with by the new content; | else | ; | ; | for to 1 run | if , then | ; | if , then | Replace queue of by the new | content data; | ; | Break; | end if | else | break; | end if | end for | if Fg==1, then | The new content will not be cached by the caching node; | end if | end | end |
|