Throughput Optimization in Cache-aided Networks: An Opportunistic Probing and Scheduling Approach
This paper addresses the challenges of throughput optimization in wireless cache-aided cooperative networks. We propose an opportunistic cooperative probing and scheduling strategy for efficient content delivery. The strategy involves the base station probing the relaying channels and cache states of multiple cooperative nodes, thereby enabling opportunistic user scheduling for content delivery. Leveraging the theory of Sequentially Planned Decision (SPD) optimization, we dynamically formulate decisions on cooperative probing and stopping time. Our proposed Reward Expected Thresholds (RET)-based strategy optimizes opportunistic probing and scheduling. This approach significantly enhances system throughput by exploiting gains from local caching, cooperative transmission and time diversity. Simulations confirm the effectiveness and practicality of the proposed Media Access Control (MAC) strategy.
Code (0)
등록된 구현이 없습니다.
Tasks
DiversitySchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Harvest: Opportunistic Peer-to-Peer GPU Caching for LLM Inference
Large Language Model (LLM) inference is increasingly constrained by GPU memory capacity rather than compute throughput, driven by growing model sizes and the linear growth of the key-value (KV) cache during autoregressiv…
Opportunistic Subarray Grouping for RIS-Aided Massive Random Access in Cellular Connectivity
In Reconfigurable Intelligent Surfaces (RIS), reflective elements (REs) are typically configured as a single array, but as RE numbers increase, this approach incurs high overhead for optimal configuration. Subarray group…
SchedulingPreparation Meets Opportunity: Enhancing Data Preprocessing for ML Training With Seneca
Input data preprocessing is a common bottleneck when concurrently training multimedia machine learning (ML) models in modern systems. To alleviate these bottlenecks and reduce the training time for concurrent jobs, we pr…
Decision Fusion in Space-Time Spreading aided Distributed MIMO WSNs
In this letter, we propose space-time spreading (STS) of local sensor decisions before reporting them over a wireless multiple access channel (MAC), in order to achieve flexible balance between diversity and multiplexing…
DiversitySTSKV Cache Optimization Strategies for Scalable and Efficient LLM Inference
The key-value (KV) cache is a foundational optimization in Transformer-based large language models (LLMs), eliminating redundant recomputation of past token representations during autoregressive generation. However, its …