arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01675cs.ITmath.IT
收藏

服务质量与服务长度相关的系统容量

Capacity of Systems with Queue-Length Dependent Service Quality

Avhishek Chatterjee, Daewon Seo, Lav R. Varshney

摘要:

我们研究了服务器的可靠的信息处理的信息理论极限与服务长度相关的服务质量。我们定义这样一个系统的容量为单位时间内可靠处理的比特数,并表征它的排队系统参数。我们还描述了到达和服务过程的分布,最大化和最小化这样的系统在离散时间设置的能力。对于每个时隙最多一个到达的到达过程,我们观察到无记忆分布的最小值。我们还研究了每个时隙多个到达的情况下,并观察到突发性到达系统上的不利影响。这个问题的理论动机是努力将可靠性的概念,在集群系统,并适用于众包,多媒体通信和流计算的上下文中。

英文摘要:

We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and characterize it in terms of queuing system parameters. We also characterize the distributions of the arrival and service processes that maximize and minimize the capacity of such systems in a discrete-time setting. For arrival processes with at most one arrival per time slot, we observed a minimum around the memoryless distribution. We also studied the case of multiple arrivals per time slot, and observed that burstiness in arrival has adverse effects on the system. The problem is theoretically motivated by an effort to incorporate the notion of reliability in queueing systems, and is applicable in the contexts of crowdsourcing, multimedia communication, and stream computing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑