Skip to main content

Table 4 Differential between the proposed scheme and existing work

From: Duplication elimination in cache-uplink transmission over B5G small cell network

Measurements

Existing work (SBS-cache)

Proposed scheme (SBSBIL)

Performance

Medium

High

Energy Consuming

Medium

Very Less

Waiting time

Less

Very Less

MS’Online time

Less

Very Less

Matching time

More

Less

MS connection

No more reduce

Reduce

Matching parameter

Chunks Hash Key

All Attributes

Eviction contents

Low/High Popular

Low Popular

Similar contents

Maybe detection

Completely detection

End-2-End delay

Medium

Less

Upload traffic

Medium

Less

Communication cost

Medium

Less

Latency

Medium

Less

Cache management

Scheduling algorithm: Random, FIFO and Probabilistic Content

Replacement policies: LRU, LFU, MRU and LEN

Time complexity

\(O(M^n C^n)\), where M is number of contents, C the knapsack capacity, n is time slots

O(N.K) , where N is the number of cache contents and K the total number of attributes of a content