.png){kind=icon}
返回
On Multiple-Access in Queue-Length Sensitive Systems
.png){kind=icon}
OA
AI
DOI：10.1109/OJCOMS.2020.3016661.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider transmission of packets over queue-length sensitive unreliable links, where packets are randomly corrupted through a noisy channel whose transition probabilities are modulated by the queue-length. The goal is to characterize the capacity of this channel. We particularly consider multiple-access systems, where transmitters dispatch encoded symbols over a system that is a superposition of continuous-time GI(k)/GI/1 queues. A server receives and processes symbols in order of arrivals with queue-length dependent noise. We first determine the capacity of single-user queue-length dependent channels. Further, we characterize the best and worst dispatch processes for GI/M/1 queues and the best and worst service processes for M/GI/1 queues. Then, the multiple-access channel capacity is obtained using point processes. When the number of transmitters is large and each arrival process is sparse, the superposition of arrivals approaches a Poisson point process. In characterizing the Poisson approximation, we show that the capacity of the multiple-access system converges to that of a single-user M/GI/1 queue-length dependent system, and an upper bound on the convergence rate is obtained. This implies that the best and worst server behaviors of single-user M/GI/1 queues are preserved in the sparse multiple-access case.
Keyword:
Quality of service
multiple-access channel
Poisson point process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.3
论文数:
1.7K
被引数:
991
机构
引用论文
Granulomatous anterior uveitis associated with 0.2% topical brimonidine与0.2%局部溴莫尼定相关的肉芽肿性前葡萄膜炎.png)
EyeOAAI
EyeIF0
OAAI分享收藏The compartmentalization of the monkey and rat cerebellar cortex: zebrin I and cytochrome oxidase
PREAI
分享收藏Optimal tuning and placement of Power System Stabilizer using Particle Swarm Optimization algorithm
PREAI
分享收藏
查看更多内容