迷雾中的探索:有限知识下的缓冲与调度
Queueing in the Mist: Buffering and Scheduling with Limited Knowledge
摘要:
调度和管理具有有限缓冲区的队列是计算机网络中最基本的问题之一。传统上,通常假设每个数据包的所有属性在到达时立即已知。然而,随着交通变得越来越多样化和复杂,这种假设在许多情况下是无效的。特别地,在各种场景中,关于分组特性的信息仅在分组已经经历了一些初始处理之后才变得可用。在这项工作中,我们研究了有限的知识管理队列的问题。我们首先展示了在这种情况下任何算法的竞争比的下限。接下来,我们使用从这些边界获得的洞察力,以确定几个算法的概念,适合的问题,并使用这些准则来设计一个具体的算法框架。我们分析了我们所提出的算法的性能,并进一步展示了它如何在各种设置中实现,这些设置由未知信息的类型和性质而异。我们进一步验证我们的结果和算法的方法,模拟研究,提供了进一步的见解,我们的算法设计原则,在有限的知识面前。
英文摘要:
Scheduling and managing queues with bounded buffers are among the most fundamental problems in computer networking. Traditionally, it is often assumed that all the properties of each packet are known immediately upon arrival. However, as traffic becomes increasingly heterogeneous and complex, such assumptions are in many cases invalid. In particular, in various scenarios information about packet characteristics becomes available only after the packet has undergone some initial processing. In this work, we study the problem of managing queues with limited knowledge. We start by showing lower bounds on the competitive ratio of any algorithm in such settings. Next, we use the insight obtained from these bounds to identify several algorithmic concepts appropriate for the problem, and use these guidelines to design a concrete algorithmic framework. We analyze the performance of our proposed algorithm, and further show how it can be implemented in various settings, which differ by the type and nature of the unknown information. We further validate our results and algorithmic approach by a simulation study that provides further insights as to our algorithmic design principles in face of limited knowledge.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。