时变网络线性记忆随机调度的稳定域和延迟性能

Delay-Optimal Computation Task Scheduling for Mobile-Edge Computing Systems

Mobile-edge computing (MEC) emerges as a promising paradigm to improve the quality of computation experience for mobile devices. Nevertheless, the design of computation task scheduling policies for MEC systems inevitably encounters a challenging two-timescale stochastic optimization problem. Specifically, in the larger timescale, whether to execute a task locally at the mobile device or to offload a task to the MEC server for cloud computing should be decided, while in the smaller timescale, the transmission policy for the task input data should adapt to the channel side information. In this p…

基于反馈的块网络码在具有丢失和时延网络上的高效调度策略

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay

研究了分组网络中具有时延和丢包的分块码（CC）基于反馈的高效调度策略设计问题。对于具有反馈的网络，已经存在两种调度策略，称为随机推送（RP）和本地稀有优先（LRF）。我们提出了一种新的调度策略，称为最小距离优先（minimum-distance-first，缩写为ESTA），基于预期数量的创新成功的数据包传输之前，在网络的每个节点的“下一个”传输时间，给定的反馈信息，从下游节点（S）收到的数据包。与现有的策略不同，该策略在要传输的块的选择过程中结合了链路的丢失和延迟模型。我们的模拟表明，与现有的具有反馈的线路网络的调度策略相比，该算法显著降低了所有块（或等效地，所有消息包）可解码所需的预期时间。对于更实际的更小的块和更大的网络，这些改进特别深刻（对于测试案例高达约46%）。所提出的调度策略的性能的改善是以更多的计算为代价的，并且反馈量略有增加。我们还提出了一个低复杂度的版本，具有相当小的性能损失，被称为最小电流度量优先（MCMF）。MCMF策略基于在“当前”传输时间之前的创新分组传输的预期数量，而不是在TCP中使用的下一个传输时间。我们的模拟（在线网络）表明，MCMF总是优于RP和LRF政策，优势变得更加明显，较小的块和较大的网络。

On Delay-Optimal Scheduling in Queueing Systems with Replications

In modern computer systems, jobs are divided into short tasks and executed in parallel. Empirical observations in practical systems suggest that the task service times are highly random and the job service time is bottlenecked by the slowest straggling task. One common solution for straggler mitigation is to replicate a task on multiple servers and wait for one replica of the task to finish early. The delay performance of replications depends heavily on the scheduling decisions of when to replicate, which servers to replicate on, and which job to serve first. So far, little is understood on ho…

低复杂度多信道无线网络中实现最优吞吐量和近优渐近时延性能的实用贪婪调度策略

Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy

在本文中，我们专注于多信道无线网络中的调度问题，例如，第四代（4G）基于OFDM的蜂窝网络中的单个小区的下行链路。我们的目标是设计实用的调度策略，可以实现可证明的吞吐量和延迟方面的良好性能，在一个低的复杂度。虽然一类$O(n^{2.5} \log n)$ -复杂度混合调度策略最近被开发，以保证速率函数延迟最优性（在多信道多用户渐近制度）和吞吐量最优性（在一般的非渐近设置），他们的实际复杂度通常是高的。为了解决这个问题，我们开发了一个简单的贪婪策略，称为基于延迟的服务器端贪婪（D-SSG）与\lower复杂度$2n^2+2n$，并严格证明D-SSG不仅实现吞吐量最优，但也保证了接近最优的渐近延迟性能。具体来说，我们表明，D-SSG达到的速率函数为任何延迟违规阈值$b$，是不小于最大可实现的速率函数由任何调度策略的阈值$b-1$。因此，我们能够实现复杂性的降低（从混合策略的$O(n^{2.5} \log n)$到$2n^2 + 2n$），同时延迟性能的下降最小。更重要的是，在实践中，D-SSG通常具有比混合策略低得多的复杂性，混合策略通常具有隐藏在$O(\cdot)$符号中的大常数因子。最后，我们进行数值模拟，以验证我们的理论结果在各种情况下。仿真结果表明，D-SSG不仅保证了一个接近最优的速率函数，但在经验上是几乎无法区分的延迟最优的政策。

Low Delay Random Linear Coding and Scheduling Over Multiple Interfaces

Multipath transport protocols like MPTCP transfer data across multiple routes in parallel and deliver it in order at the receiver. When the delay on one or more of the paths is variable, as is commonly the case, out of order arrivals are frequent and head of line blocking leads to high latency. This is exacerbated when packet loss, which is also common with wireless links, is tackled using ARQ. This paper introduces Stochastic Earliest Delivery Path First (S-EDPF), a resilient low delay packet scheduler for multipath transport protocols. S-EDPF takes explicit account of the stochastic nature o…

Robust Rate Adaptation and Proportional Fair Scheduling with Imperfect CSI

In wireless fading channels, multi-user scheduling has the potential to boost the spectral efficiency by exploiting diversity gains. In this regard, proportional fair (PF) scheduling provides a solution for increasing the users' quality of experience by finding a balance between system throughput maximization and user fairness. For this purpose, precise instantaneous channel state information (CSI) needs to be available at the transmitter side to perform rate adaptation and scheduling. However, in practical setups, CSI is impaired by, e.g., channel estimation errors, quantization and feedback …

Low Delay Scheduling of Objects Over Multiple Wireless Paths

In this paper we consider the task of scheduling packet transmissions amongst multiple paths with uncertain, time-varying delay. We make the observation that the requirement is usually to transmit application layer objects (web pages, images, video frames etc) with low latency, and so it is the object delay rather than the per packet delay which is important. This has fundamental implications for multipath scheduler design. We introduce SOS (Stochastic Object-aware Scheduler), the first multipath scheduler that considers application layer object sizes and their relationship to link uncertainty…

多跳无线网络中基于时延的背压调度

Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks

在多跳无线网络中，调度是一种关键且具有挑战性的资源分配机制。这是众所周知的调度方案，有利于具有较大队列长度的链路可以实现高吞吐量性能。然而，由于众所周知的最后一个分组问题，这些基于分组长度的方案可能潜在地遭受大的（甚至无限的）分组延迟，由此属于某些流的分组可能由于缺乏后续分组到达而被过度延迟。基于延迟的方案有可能通过基于分组遇到的延迟来调度链路来解决这个最后分组问题。然而，表征这些基于延迟的方案的吞吐量最优性在多跳无线网络中很大程度上是一个开放的问题（除了在有限的情况下，流量是单跳）。在本文中，我们研究基于延迟的调度方案，多跳流量的情况下，固定的路由。我们开发了一个调度方案的基础上，一个新的延迟度量，并表明，该方案实现了最佳的吞吐量性能。此外，我们进行模拟，以支持我们的分析结果，并表明，基于延迟的调度成功地消除了过多的数据包延迟，同时它实现了相同的吞吐量区域的基于长度的方案。

采用随机协作、网络编码和分组级FEC的双向无线视频通信

Two-way Wireless Video Communication using Randomized Cooperation, Network Coding and Packet Level FEC

无线网络中的双向实时视频通信要求高带宽、低延迟和容错能力。本文针对这些需求，提出了一个系统的集成网络编码（NC），用户合作使用随机分布式空时编码（R-DSTC）和分组级前向纠错（FEC）的单向延迟约束下。仿真结果表明，该方案的性能明显优于传统的直接传输和基于R-DSTC的双向协作传输，并且在用户距离较大时最有效。

Coflow Scheduling in Input-Queued Switches: Optimal Delay Scaling and Algorithms

A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \emph{coflow-level delay}, i.e., the time to complete all the flows in a coflow, in the context of an $N\times N$ input-queued switch. In particular, we develop a throughput-optimal scheduling policy that achieves the best scaling of coflow-level delay as $N\rightarrow\infty$. We first derive lower bounds on the coflow-level delay that can be achieved by any scheduling policy. …

Asymptotically Optimal Delay-aware Scheduling in Queueing Systems

In this paper, we investigate a general delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be the minimization of the total average backlog queues of the network in question. First, we show that our problem falls in the framework of Restless Bandit Problems (RBP), for which obtaining the optimal solution is known to be out of reach. To circumvent this difficulty, we tackle the problem by adopting a Whittle index approach. To that extent, we employ a L…

具有异构时延约束的Ad Hoc网络最优速率分配调度

Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints

本文研究了具有实时业务的单跳无线网络中的调度问题，其中每个到达的数据包都有一个相关的截止日期，并且在截止日期结束之前必须发送最小比例的数据包。利用最优化和随机网络理论，我们提出了一个框架来模拟延迟约束下的服务质量（QoS）的要求。该模型允许相当一般的到达模型与异构的约束。该框架的结果在一个最佳的调度算法，公平地分配数据率的所有流量，同时满足长期的延迟需求。我们还证明，在一个简化的情况下，我们的解决方案转化为一个贪婪的策略，使最佳决策的复杂性低。

Delay-Aware Scheduling over mmWave/Sub-6 Dual Interfaces: A Reinforcement Learning Approach

We consider a transmitter with mmWave/sub6 dual interfaces. Due to the intermittency of mmWave channel, the transmitter must schedule packets wisely across the interfaces to minimize the average delay by observing the system state. We usethe well-known dynamic programming methods and Q-learning to find the optimal scheduling policy and investigate the influenceof observing CSI on the optimal policy under different levels of knowledge of the environment. We find that only when the channel state transition model is not available, the instantaneousCSI can help in reducing system delay

Throughput-Optimal Scheduling for Multi-Hop Networked Transportation Systems With Switch-Over Delay

The emerging connected-vehicle technology provides a new dimension in developing more intelligent traffic control algorithms for signalized intersections in networked transportation systems. An important challenge for the scheduling problem in networked transportation systems is the switch-over delay caused by the guard time before any traffic signal change. The switch-over delay can result in significant loss of system capacity and hence needs to be accommodated in the scheduling design. To tackle this challenge, we propose a distributed online scheduling policy that extends the well-known Ma…

面向6G O-RAN的网络优化脉冲神经网络（NOS）调度：频谱边际与延迟尾部控制

Network-Optimised Spiking Neural Network (NOS) Scheduling for 6G O-RAN: Spectral Margin and Delay-Tail Control

本文提出一种网络优化脉冲神经网络调度器，通过结合双态内核与成对公平授权头，实现6G O-RAN中频谱边际与延迟尾部控制，提升系统利用率与低延迟性能。

重尾业务下排队网络的最大权调度

Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic

研究了单跳路由网络中的分组调度问题，分析了重尾业务对最大权调度性能的影响。作为一个性能指标，我们使用的延迟稳定的流量：流量是延迟稳定的，如果其预期的稳态延迟是有限的，否则延迟不稳定。首先，我们证明了一个重尾的交通流是延迟不稳定的任何调度策略。然后，我们专注于著名的最大权重调度策略，并表明，轻尾流与重尾流的冲突也是延迟不稳定的。这是真实的，而不管轻尾流的速率或尾部分布，或网络中的其他调度约束。令人惊讶的是，我们表明，轻尾流可以延迟不稳定，即使它不与重尾交通冲突。此外，在这种情况下，延迟稳定性可能取决于轻尾流的速率。最后，我们把我们的注意力转移到类的最大权重-a调度策略，我们表明，如果a-参数选择适当，那么稳态队列长度的a-时刻的总和是有限的。我们提供了一个明确的上界，后者的数量，从中我们得到的结果相关的延迟稳定的交通流量，和缩放的时刻的稳态队列长度与交通强度。

Joint Scheduling and Coding For Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback

We consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an information packet or a coded packet. Importantly, this decision is made based on delayed feedback from the receiver. While an exact solution to this decision problem is challenging, we exploit ideas from queueing theory to derive scheduling policies based on prediction of a receiver queue length that, while suboptimal, can be efficiently implemented and offer subst…

具有不同延迟敏感度的无线系统中的联合编码和调度优化

Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities

吞吐量和每包延迟可以提出强的权衡，是重要的延迟敏感的applications.We调查这样的权衡使用随机线性网络编码方案的一个或多个接收器在单跳无线数据包擦除广播信道的情况下。我们捕捉不同类型的网络应用程序的延迟敏感性，使用一类基于数据包到达时间的范数的延迟度量。利用这些时延度量，我们建立了一个统一的框架来描述应用的速率和时延要求，并优化系统参数。在单接收机的情况下，我们证明了平均数据包延迟之间的权衡，我们认为作为吞吐量的倒数，和最大有序的到达间隔延迟的各种系统参数。对于一个单一的广播信道与多个接收机具有不同的延迟约束和反馈延迟，我们共同优化的编码参数和时分调度参数的发射机。我们制定的优化问题作为一个广义几何规划（GGP）。该方法允许发射机自适应地调整编码和调度参数，以在不同的延迟约束下有效地分配网络资源。在接收器由多个非干扰无线广播信道服务的情况下，相同的优化问题被公式化为符号规划，其通常是NP难的。我们提供的近似方法，使用连续制定的几何规划，并显示近似的收敛性。

On the Power of Randomization for Scheduling Real-Time Traffic in Wireless Networks

In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each link are delivered within their deadlines, which is referred to as delivery ratio. This problem has been studied before under restrictive frame-based traffic models, or greedy maximal scheduling schemes like LDF (Largest-Deficit First) that provide poor delivery ratio for general traffic patterns. In this paper, we pursue a different approach through randomi…

无人机集群中联邦学习的延迟与开销高效传输调度

Delay and Overhead Efficient Transmission Scheduling for Federated Learning in UAV Swarms

本文针对无人机集群联邦学习中的多跳无线传输问题，提出一种智能聚合与高效传输调度框架，理论证明其实现最小延迟和通信开销，并通过数值实验验证其优于现有基线方案。

Forward Delay-based Packet Scheduling Algorithm for Multipath TCP

Multipath TCP (MPTCP) is a transport layer protocol that allows network devices to transfer data over multiple concurrent paths, and hence, utilizes the network resources more effectively than does the traditional single-path TCP. However, as a reliable protocol, MPTCP still needs to deliver data packets (to the upper application) at the receiver in the same order they are transmitted at the sender. The out-of-order packet problem becomes more severe for MPTCP due to the heterogeneous nature of delay and bandwidth of each path. In this paper, we propose the forward-delay-based packet schedulin…

Adaptive Policies for Scheduling with Reconfiguration Delay: An End-to-End Solution for All-Optical Data Centers

All-optical switching networks have been considered a promising candidate for the next generation data center networks thanks to its scalability in data bandwidth and power efficiency. However, the bufferless nature and the nonzero recon- figuration delay of optical switches remain great challenges in deploying all-optical networks. This paper considers the end-to- end scheduling for all-optical data center networks with no in- network buffer and nonzero reconfiguration delay. A framework is proposed to deal with the nonzero reconfiguration delay. The proposed approach constructs an adaptive v…

延迟约束系统中赤字轮询调度的凸性与优化

Convexity and Optimization in Deficit Round Robin Scheduling for Delay-Constrained Systems

本文证明DRR调度可行参数集的凸性并扩展到n流系统，提出优化方法在满足延迟约束下最大化每轮服务包数，为网络切片中的QoS保障提供实用框架。

To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks

Conventional wisdom for minimizing the average flow completion time (AFCT) in the datacenter network (DCN), where flow sizes are highly variable, would suggest scheduling every individual flow. However, we show that considering scheduling delay (including scheduler's computational and communication delays), serving most of the flows without any scheduling and only in first-come-first-served (FCFS) manner significantly improves their performance even when it is compared to the shortest remaining processing time (SRPT)-known as optimum algorithm when scheduling delay is zero. To do so, we only r…

Delay-Constrained Topology-Transparent Distributed Scheduling for MANETs

Transparent topology is common in many mobile ad hoc networks (MANETs) such as vehicle ad hoc networks (VANETs), unmanned aerial vehicle (UAV) ad hoc networks, and wireless sensor networks due to their decentralization and mobility nature. There are many existing works on distributed scheduling scheme design for topology-transparent MANETs. Most of them focus on delay-unconstrained settings. However, with the proliferation of real-time applications over wireless communications, it becomes more and more important to support delay-constrained traffic in MANETs. In such applications, each packet …

IEEE 802.16宽带无线接入系统中一种公平高效的分组调度方案

A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems

针对IEEE 802.16宽带无线接入系统，提出了一种公平有效的QoS调度方案，该方案能同时满足各种实时和非实时的应用的吞吐量和时延保证。所提出的QoS调度方案进行了比较，与现有的QoS调度方案中提出的文献在最近的过去。仿真结果表明，所提出的调度方案能够在时延、时延违规率和吞吐量方面为WiMAX标准中定义的所有类型的业务提供严格的QoS保证，从而保持了公平性，并有助于消除低优先级业务的饥饿。系统的带宽利用率和资源的公平性指标也遇到了验证我们提出的调度方案提供的QoS。

多服务器系统中批处理作业的近延迟最优调度

Near Delay-Optimal Scheduling of Batch Jobs in Multi-Server Systems

针对 NBU 服务时间下多服务器并行批处理作业调度，本文证明 FUT、EDD 和 FCFS 三种低复杂度策略对三类延迟指标具有随机序意义下的近最优性，并给出常数或两倍性能界。

Throughput Optimal and Fast Near-Optimal Scheduling with Heterogeneously Delayed Network-State Information (Extended Version)

We consider the problem of distributed scheduling in wireless networks where heterogeneously delayed information about queue lengths and channel states of all links are available at all the transmitters. In an earlier work (by Reddy et al. in Queueing Systems, 2012), a throughput optimal scheduling policy (which we refer to henceforth as the R policy) for this setting was proposed. We study the R policy, and examine its two drawbacks -- (i) its huge computational complexity, and (ii) its non-optimal average per-packet queueing delay. We show that the R policy unnecessarily constrains itself to…

Local Voting: Optimal Distributed Node Scheduling Algorithm for Multihop Wireless Networks

An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centr…

Low Complexity Fair Scheduling in LTE/LTE-A Uplink Involving Multiple Traffic Classes

The bulk of the research on Long Term Evolution/Long Term Evolution-Advanced packet scheduling is concentrated in the downlink and the uplink is comparatively less explored. In up-link, channel aware scheduling with throughput maximization has been widely studied while considering an infinitely back-logged buffer model, which makes the investigations unrealistic. Therefore, we propose an optimal uplink packet scheduling pro-cedure with realistic traffic sources. Firstly, we advocate a joint channel and buffer aware algorithm, which maximizes the actual transmitted bit-count. Thereafter, we int…

一种新的减少背压调度和路由延迟的结构和算法

Novel Architectures and Algorithms for Delay Reduction in Back-pressure Scheduling and Routing

背压算法是一种众所周知的吞吐量优化算法。然而，由于以下两个原因，即使当业务负载不接近网络容量时，其延迟性能也可能相当差。首先，每个节点必须为网络中的每种商品维护一个单独的队列，并且一次只能服务一个队列。第二，背压路由算法可能会沿着很长的路由来路由一些数据包。在本文中，我们提出了解决方案，以解决上述两个问题，因此，提高延迟性能的背压算法。所建议的解决方案之一还降低了要在每个节点处维护的嵌入数据结构的复杂性。

基于TransGNN的延迟导向分布式调度

Delay-Oriented Distributed Scheduling with TransGNN

本文提出基于Transformer GNN的延迟导向分布式调度框架，通过注意力机制生成链路效用分数并构建无冲突传输集，以优化无线多跳网络中的传输延迟。

Delay-Optimal Scheduling for Queueing Systems with Switching Overhead

We study the scheduling polices for asymptotically optimal delay in queueing systems with switching overhead. Such systems consist of a single server that serves multiple queues, and some capacity is lost whenever the server switches to serve a different set of queues. The capacity loss due to this switching overhead can be significant in many emerging applications, and needs to be explicitly addressed in the design of scheduling policies. For example, in 60GHz wireless networks with directional antennas, base stations need to train and reconfigure their beam patterns whenever they switch from…

Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling

Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. It has been used to analyze and design distributed CSMA (Carrier Sense Multiple Access) scheduling algorithms for multi-hop wireless networks. In this paper we derive bounds on the mixing time of a generalization of Glauber dynamics where multiple links are allowed to update their states in parallel and the fugacity of each link can be different. The results can be used to prove that the average queue length (and hence, the delay) under the parallel Glauber dynamics based CS…

LTE上行链路时延估计与快速迭代调度策略

Delay Estimation and Fast Iterative Scheduling Policies for LTE Uplink

我们考虑频谱和功率资源到移动台的分配（即，对于长期演进（LTE）正交频分多址（OFDMA）蜂窝网络，每一子帧（1 ms）在小区中发送一个用户设备（UE）。为了使调度的分组延迟的基础上，我们设计了一种新的机制，用于推断的分组延迟大约从缓冲区状态报告（BSR）由UE发送的BSR报告只包含队列长度信息。然后，我们考虑一个有约束的最优化问题与凹目标函数-如那些基于效用最大化，最大重量调度，最近的结果迭代调度小队列/延迟作为特殊情况。特别地，基于分组延迟的不可微目标函数的构造是新颖的。我们对带宽、UE处的峰值发射功率和UE处的发射功率谱密度（PSD）的约束进行建模，这是由于分数功率控制。当频率分集不存在或不利用在一个快速的时间尺度，我们使用次梯度分析构造一个O（N log L）（每次迭代与少量的迭代）算法来计算N个用户和L点的最优资源分配的不可微的目标函数。对于具有M个子带的频率分集调度器，每次迭代的相应复杂度基本上为O（N（M^2+L^2））。与以往的基于延迟/队列的迭代策略不同，在我们的方法中，当相干带宽较大时，调度的复杂度可以降低。通过详细的系统仿真（基于NGMN和3GPP评估方法），模型H-ARQ，每子帧的有限资源授权，部署，现实的流量，功率限制，干扰和信道衰落，我们证明了我们的计划的LTE的有效性。

Effective Multi-User Delay-Constrained Scheduling with Deep Recurrent Reinforcement Learning

Multi-user delay constrained scheduling is important in many real-world applications including wireless communication, live streaming, and cloud computing. Yet, it poses a critical challenge since the scheduler needs to make real-time decisions to guarantee the delay and resource constraints simultaneously without prior information of system dynamics, which can be time-varying and hard to estimate. Moreover, many practical scenarios suffer from partial observability issues, e.g., due to sensing noise or hidden correlation. To tackle these challenges, we propose a deep reinforcement learning (D…

Joint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks

In this report, we study the issue of delay optimization and energy efficiency in grid wireless sensor networks (WSNs). We focus on STDMA (Spatial Reuse TDMA)) scheduling, where a predefined cycle is repeated, and where each node has fixed transmission opportunities during specific slots (defined by colors). We assume a STDMA algorithm that takes advantage of the regularity of grid topology to also provide a spatially periodic coloring ("tiling" of the same color pattern). In this setting, the key challenges are: 1) minimizing the average routing delay by ordering the slots in the cycle 2) bei…

具有分组重复性的有界延迟调度

Bounded Delay Scheduling with Packet Dependencies

在处理多媒体流量时，常见的情况是将大数据帧分割成较小的IP数据包，并通过网络独立发送这些数据包。对于实时多媒体业务，丢弃帧的甚至几个分组也可能使整个帧无用。这种业务通常被建模为具有{ \em分组间依赖性}。我们研究的问题，调度流量与这种依赖关系，每个数据包有一个截止日期，它应该到达目的地。这样的最后期限是常见的实时多媒体应用程序，并来自严格的延迟约束所造成的应用程序。这种环境中的品质因数是最大化系统的{ \em有效吞吐量}，即成功传送的帧的数量。我们研究在线算法的问题，最大限度地提高吞吐量的延迟有界的流量与包间的依赖性，并使用竞争分析来评估其性能。我们提出了有竞争力的算法的问题，以及匹配的下限是紧到一个常数因子。我们进一步提出了模拟研究的结果，进一步验证了我们的算法方法，并表明我们的分析所产生的见解确实体现在实践中。

云环境中机会性调度以实现最优抢占实例节省

Opportunistic Scheduling for Optimal Spot Instance Savings in the Cloud

本文提出了一种机会性调度方法，通过优化抢占实例和按需实例的使用，实现云环境中的延迟敏感作业调度，以最小化成本并满足延迟约束。

无线传感器网络自稳定虚拟节点实时的调度

Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks

在本文中，我们提出了一种新的调度算法称为实时的调度（RTS），它使用虚拟节点的自我稳定。该算法处理传感器网络中数据包的端到端传输延迟的所有组成部分，并与虚拟节点算法实现QoS方面的数据包传输，多个连接，更好的电源管理和稳定的路由故障的情况下。RTS在中间跳延迟数据包（不仅仅是优先级），持续时间是其截止日期的函数。延迟数据包允许网络避免热点，同时保持最后期限忠诚。我们比较RTS与另一种优先级和调度算法，在传感器网络中的实时数据分发，速度单调调度。本文利用J-Sim对基于最短路径路由和贪婪转发两种典型路由协议的RTS进行了仿真。

混合关键性流调度与低延迟及受限带宽在TSN中的应用

Mixed-Criticality Flow Scheduling with Low Delay and Limited Bandwidth in TSN

本文提出MCFS-2L方案，通过帧聚合与动态重组降低延迟并优化带宽使用，在工业自动化和汽车网络中提升关键和非关键流的接受率。

LTE Cellular Networks Packet Scheduling Algorithms in Downlink and Uplink Transmission, A Survey

This survey paper provides a detailed explanation of Long Term Evolution cellular network packet scheduling algorithms in both downlink and uplink directions. It starts by explaining the difference between Orthogonal Frequency Division Multiple Access that is used in downlink transmission, and Single Carrier Frequency Division Multiple Access is used in uplink. Then, it explains the difference between the LTE scheduling process in the donwlink and uplink through explaining the interaction between users and the scheduler. Then, it explains the most commonly used downlink and uplink scheduling a…

No Delay: Latency-Driven, Application Performance-Aware, Cluster Scheduling

Given the network latency variability observed in data centers, applications' performance is also determined by their placement within the data centre. We present NoMora, a cluster scheduling architecture whose core is represented by a latency-driven, application performance-aware, cluster scheduling policy. The policy places the tasks of an application taking into account the expected performance based on the measured network latency between pairs of hosts in the data center. Furthermore, if a tenant's application experiences increased network latency, and thus lower application performance, …

利用过去减少CSMA调度延迟的高阶马尔可夫链方法

Exploiting the Past to Reduce Delay in CSMA Scheduling: A High-order Markov Chain Approach

最近几个基于Glauber动力学模型的CSMA算法已被提出用于多跳无线调度，作为可行的解决方案，以实现吞吐量最优，但实现简单。然而，它们的延迟性能仍然不能令人满意，这主要是由于底层马尔可夫链的性质，它对链路状态如何随时间演变施加了基本约束。在本文中，我们提出了一种新的方法，以更好的路由和延迟性能，基于我们的观察，该算法不需要是马尔可夫的，只要它可以实现在一个分布式的方式，实现相同的吞吐量最优，同时提供更好的延迟性能一般的网络拓扑结构。我们的方法取决于利用过去的状态信息观察到的本地链路，然后构建一个高阶马尔可夫链的可行的链路时间表的演变。我们表明，在理论和仿真，我们提出的算法，命名为延迟CSMA，增加了几乎没有额外的开销到现有的基于CSMA的算法，实现了吞吐量最优的链路权重作为本地队列长度的函数通常的选择下，也提供了更好的延迟性能，有效地“去相关”的链路状态过程（从而消除链路饥饿）在任何任意的网络拓扑结构。从我们广泛的模拟中，我们观察到，在我们的算法下的延迟往往可以减少20倍，在广泛的情况下，相比标准的基于Glauber动力学的CSMA算法。

A fixed-point model for semi-persistent scheduling of vehicular safety messages

In this paper, we focus on the performance analysis of a semi-persistent scheduling scheme for vehicular safety communications, motivated by the Mode 4 medium access control protocol in 3GPP Release 14 for Cellular-V2X. An analytical model is built and a fixed point method is used to calculate the collision probability and average delay in both fully connected and partially connected cases under the assumption of perfect PHY performance. We use Monte Carlo simulation to verify the results obtained in the analytical model. The simulation results show that our analytical model can give a good es…

多用户OFDMA网络中的一种启发式调度方案

A Heuristic Scheduling Scheme in Multiuser OFDMA Networks

传统的异构业务调度方案利用实时业务的零延迟约束，其目标是最小化实时用户之间的平均分组延迟。然而，在轻负载或中等负载的网络中，这种策略是不必要的，并导致非实时用户的低数据吞吐量。在本文中，我们提出了一种启发式调度方案来解决这个问题。该方案测量并分配调度优先级给实时和非实时用户，并同时调度两个用户类的无线电资源。仿真结果表明，该方案能有效地处理具有不同QoS要求的异构业务调度，并消除了各种业务负载下实时业务和非实时业务之间的不公平性。

Advanced IEEE 802.11ax TCP aware scheduling under unreliable channels

In this paper we suggest advanced IEEE 802.11ax TCP-aware scheduling strategies for optimizing the AP operation under transmission of unidirectional TCP traffic. Our scheduling strategies optimize the performance using the capability for Multi User transmissions over the Uplink, first introduced in IEEE 802.11ax, together with Multi User transmissions over the Downlink. They are based on Transmission Opportunities (TXOP) and we suggest three scheduling strategies determining the TXOP formation parameters. In one of the strategies one can control the achieved Goodput vs. the delay. We also assu…

回程延迟下用于弹性协作波束赋形的时空调度预测

Spatio-Temporal Scheduling Prediction Under Backhaul Delay for Resilient Coordinated Beamforming

研究分布式5G网络中回程延迟致调度信息过时问题，提出基于频谱时间图神经网络的两阶段预测框架，该框架预测准确率高，集成到协作波束赋形中可有效恢复和速率损失及公平性损失，为延迟受限网络小区间协作提供有效方法。

Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, th…

衰落无线信道中异构实时的业务的调度

Scheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels

我们开发了一种通用的方法来设计调度策略的实时的【形】流量在无线信道上。我们扩展以前的工作，其特点是实时的【形】流的流量模式，延迟范围，及时的吞吐量要求，和信道的可靠性，允许时变信道，允许客户端有不同的最后期限，并允许可选的就业率自适应。因此，我们的模型允许治疗更现实的衰落信道以及移动节点的情况下，和使用更一般的传输策略。我们得到了调度策略可行最优的充分条件，从而建立了一类可行最优策略。我们证明了所确定的类的效用，推导出一个可行性的最优策略的情况下，与速率自适应，时变信道，和异构的延迟界限。当速率自适应不可用时，我们也得到了一个可行的时变信道的最优策略。对于速率自适应不可用，但客户端有不同的延迟范围的情况下，我们描述了一个启发式。仿真结果也表明更现实和复杂的情况下的调度策略的实用性。

多跳网络中网络效用最大化的时延感知跨层设计

Delay-Aware Cross-Layer Design for Network Utility Maximization in Multi-hop Networks

我们研究的问题，设计延迟感知的联合流量控制，路由和调度算法，在一般的多跳网络，以最大限度地提高网络利用率。由于端到端延迟性能对跨层算法的高阶顺序统计量具有复杂的依赖性，因此优化长期网络利用率的早期基于优化的设计方法并不立即非常适合延迟感知设计。这促使我们在这项工作中开发一种新的设计框架和替代方法，利用几个未开发的设计选择的路由和调度策略空间。特别是，我们揭示和利用背压型控制器的一个关键特性，使我们能够开发一种新的链路速率分配策略，不仅优化长期的网络利用率，而且还产生每个源-目的地对之间的无环多路径路由。此外，我们提出了一个规范的调度策略，基于令牌的服务纪律，塑造每跳延迟分布，以获得非常理想的端到端延迟性能。我们建立了我们的联合流量控制，路由和调度算法实现无环路由和最佳的网络利用率。我们广泛的数值研究支持我们的理论结果，并进一步表明，我们的联合设计导致大量的端到端的延迟性能改善多跳网络相比，早期的解决方案。

Cross-Layer Scheduling for OFDMA-based Cognitive Radio Systems with Delay and Security Constraints

This paper considers the resource allocation problem in an Orthogonal Frequency Division Multiple Access (OFDMA) based cognitive radio (CR) network, where the CR base station adopts full overlay scheme to transmit both private and open information to multiple users with average delay and power constraints. A stochastic optimization problem is formulated to develop flow control and radio resource allocation in order to maximize the long-term system throughput of open and private information in CR system and ensure the stability of primary system. The corresponding optimal condition for employin…

A Cooperative Scheduling Scheme of Local Cloud and Internet Cloud for Delay-Aware Mobile Cloud Computing

With the proliferation of mobile applications, Mobile Cloud Computing (MCC) has been proposed to help mobile devices save energy and improve computation performance. To further improve the quality of service (QoS) of MCC, cloud servers can be deployed locally so that the latency is decreased. However, the computational resource of the local cloud is generally limited. In this paper, we design a threshold-based policy to improve the QoS of MCC by cooperation of the local cloud and Internet cloud resources, which takes the advantages of low latency of the local cloud and abundant computational r…

Structural Properties of Optimal Transmission Policies for Delay-Sensitive Energy Harvesting Wireless Sensors

We consider an energy harvesting sensor transmitting latency-sensitive data over a fading channel. We aim to find the optimal transmission scheduling policy that minimizes the packet queuing delay given the available harvested energy. We formulate the problem as a Markov decision process (MDP) over a state-space spanned by the transmitter's buffer, battery, and channel states, and analyze the structural properties of the resulting optimal value function, which quantifies the long-run performance of the optimal scheduling policy. We show that the optimal value function (i) is non-decreasing and…