There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling policies for constrained queueing network models that arise in the context of emerging communication networks. Here, we consider two representative models. One, a model for the collection of wireless nodes communicating through a shared medium, that represents randomly varying number of packets in the queues at the nodes of networks. Two, a buffered circuit switched network model for an optical core of future Internet, to capture the randomness in calls or flows present in the network. The maximum weight scheduling policy proposed by Tassiulas and Ephremide in 1992 leads to a myopic and stable policy for the packet-level wireless network model. But computationally it is very expensive (NP-hard) and centralized. It is not applicable to the buffered circuit switched network due to the requirement of non-premption of the calls in the service. As the main contribution of this paper, we present a stable scheduling algorithm for both of these models. The algorithm is myopic, distributed and performs few logical operations at each node per unit time.
Randomized Scheduling for Periodic Multi-Source Systems with PAoI Violation Guarantees
Institute of Communications Engineering, National Yang Ming Chiao Tung University（国立阳明交通大学通信工程研究所）；Department of Communication Engineering, National Taipei University（国立台北大学通信工程系）
Distributed Scheduling in Time Dependent Environments: Algorithms and Analysis
考虑在具有大量用户的时间依赖环境中的多址信道的问题。在这样的系统中，主要是由于实际约束（例如，解码复杂度），不是所有用户都可以被一起调度，并且通常在任何给定时间只有一个用户可以发送。假设一个分布式的机会调度算法，我们分析了系统的属性，如延迟，QoS和容量的缩放定律。具体来说，我们开始分析性能，而\emph{assuming the users are not necessarily fully backlogged}，专注于封装问题，特别是对\emph{strong dependence between the queues}。首先，我们扩展了一个已知的Ephremides和朱，碰撞的概率收敛到其平均值（随着用户数量的增长），从而为随后的系统性能指标，如吞吐量和延迟的新的结果的碰撞模型。然而，这个模型在可以分析的用户数量上是有限的。因此，我们提出了一个新的模型，这是简单得多，但可以准确地描述系统的行为时，用户数量很大。然后，我们继续分析这个系统的假设下，时间相关的信道。具体地，我们假设每个用户体验不同的信道状态序列，表示不同的信道波动（具体地，Gilbert-Elliott模型）。在此设置下的系统性能进行了分析，随着信道容量缩放定律。
Agentic DDQN-Based Scheduling for Licensed and Unlicensed Band Allocation in Sidelink Networks
Department of Electronics and Electrical Engineering（电子与电气工程系）；Institute of Communications Engineering（通讯工程研究所）；National Yang Ming Chiao Tung University（阳明交通大学）；Research Center for Information Technology Innovation（信息技术创新研究中心）；Academia Sinica（台湾“中央研究院”）；Bradley Department of Electrical and Computer Engineering（电气与计算机工程系）
