Coded Caching Scheme for Multiaccess Cache-Assisted Partially Connected Linear Network via Multi-Antenna Placement...

Area of Science:

• Computer Science
• Information Theory
• Telecommunications

Background:

• Traditional partially connected linear networks face limitations in user access to cache nodes.
• Existing schemes often assume limited user access, impacting data retrieval efficiency.
• Practical scenarios involve users accessing multiple cache nodes, necessitating advanced network models.

Purpose of the Study:

• To propose a novel (K,L,r,MT,MC,N) multiaccess cache-assisted partially connected linear network model.
• To develop a general construction framework for this new network architecture using placement delivery arrays (PDAs).
• To analyze the performance of the proposed scheme, focusing on normalized delivery time (NDT) and subpacketization levels.

Main Methods:

• Development of a general construction framework based on placement delivery arrays (PDAs).
• Analysis of the network performance using the Maddah-Ali and Niesen (MN) scheme.
• Mathematical modeling and simulation to evaluate normalized delivery time (NDT) and subpacketization levels.

Main Results:

• The proposed scheme achieves a normalized delivery time (NDT) close to existing schemes for large values of 'r' (neighboring cache nodes accessible by users).
• As the cache size ratio increases, the performance gap between the proposed and traditional schemes diminishes.
• The new scheme requires a smaller subpacketization level compared to traditional approaches.

Conclusions:

• The proposed multiaccess cache-assisted network model offers significant performance improvements in data delivery.
• The PDA-based construction framework provides an efficient method for designing such networks.
• The findings suggest a more scalable and efficient approach for future content delivery networks.