Emulating round-robin for serving dynamic flows over wireless fading channels
Emulating round-robin for serving dynamic flows over wireless fading channels
复制标题
模拟循环以通过无线衰落信道提供动态流
DOI：
10.1145/3397166.3409131
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Srikant, R.
中科院分区：
文献类型：
--
作者：
Li, Bin;Eryilmaz, Atilla;Srikant, R.
在物联网（IoT）和网络物理系统（CPS）的激励下，我们考虑了动态无线衰落网络，其中每个传入流具有随机的服务需求，并在其服务请求完成后离开系统。在这样的网络中，网络算法设计的主要目标之一是实现短期公平性，即表征每个流的服务频率，此外还有更传统的目标，如吞吐量最优性和对流大小分布的延迟不敏感。在有线网络中，所有这些期望的特性都可以通过循环调度算法来实现。在无线网络的环境中，在过去几年中，通过使用一个称为TSLS （time - since - last - service）的计数器，循环调度的自然扩展得到了发展，该计数器跟踪自每个流的最后一次服务时间以来经过的时间。然而，这种类似轮询的算法的性能主要是在持续流的背景下研究的，这些流不断地向网络注入数据包，并且永远不会离开网络。动态流到达和离开的分析具有挑战性，因为每个单独的流都经历独立的无线衰落，因此流不能以严格的循环方式提供服务。在本文中，我们通过探索基于tsls算法的复杂动力学来克服这一困难，并表明流以非常高的概率提供了类似轮询的服务。因此，我们证明了我们的算法可以实现吞吐量最优性。此外，通过仿真，我们证明了所提出的基于tsls的算法在无线衰落信道上存在动态流时也具有延迟不敏感和出色的短期公平性性能。
Motivated by the Internet of Things (IoT) and Cyber-Physical Systems (CPS), we consider dynamic wireless fading networks, where each incoming flow has a random service demand and leaves the system once its service request is completed. In such networks, one of the primary goals of network algorithm design is to achieve short-term fairness that characterizes how often each flow is served, in addition to the more traditional goals such as throughput-optimality and delay-insensitivity to the flow size distribution. In wireline networks, all of these desired properties can be achieved by the round-robin scheduling algorithm. In the context of wireless networks, a natural extension of round-robin scheduling has been developed in the last few years through the use of a counter called the Time-Since-Last-Service (TSLS) that keeps track of the time that passed since the last service time of each flow. However, the performance of this round-robin-like algorithm has been primarily studied in the context of persistent flows that continuously inject packets into the network and do not ever leave the network. The analysis of dynamic flow arrivals and departures is challenging since each individual flow experiences independent wireless fading and thus, flows cannot be served in a strict round-robin manner. In this paper, we overcome this difficulty by exploring the intricate dynamics of TSLS-based algorithm and show that flows are provided round-robin-like service with a very high probability. Consequently, we then show that our algorithm can achieve throughput-optimality. Moreover, through simulations, we demonstrate that the proposed TSLS-based algorithm also exhibits desired properties such as delay-insensitivity and excellent short-term fairness performance in the presence of dynamic flows over wireless fading channels.
无线数据网络中的流级性能和用户移动性
DOI：
--
发表时间：
2008
期刊：
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
影响因子：
--
作者：
S. Borst
通讯作者：
S. Borst
影响因子：
1.2
作者：
N. Walton
通讯作者：
N. Walton
用于优化大流量情况下的服务规律性和平均延迟的无线调度设计
DOI：
10.1109/tnet.2015.2432119
发表时间：
2016
期刊：
IEEE/ACM Transactions on Networking
影响因子：
--
作者：
Bin Li;Ruogu Li;A. Eryilmaz
通讯作者：
A. Eryilmaz