Related papers: Low Complexity Fair Scheduling in LTE/LTE-A Uplink…
Reconfigurable optical topologies are emerging as a promising technology to improve the efficiency of datacenter networks. This paper considers the problem of scheduling opportunistic links in such reconfigurable datacenters. We study the…
Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…
The bounded delay buffer management problem, which was proposed by Kesselman et~al.\ (STOC 2001 and SIAM Journal on Computing 33(3), 2004), is an online problem focusing on buffer management of a switch supporting Quality of Service (QoS).…
We consider a scheduling problem pertinent to a base station (BS) that serves heterogeneous users (UEs). We focus on a downlink model, with users that are either interested in large throughput, low latency (the time difference between the…
We consider distributed Luby transform (DLT) codes for efficient packet transmission in a multi-way relay network, where the links are modeled as erasure channels. Density evolution is applied for asymptotic performance analysis, and…
The problem of user scheduling and power allocation in full-duplex (FD) cellular networks is considered, where a FD base station communicates simultaneously with one half-duplex (HD) user on each downlink and uplink channel. First, we…
Full-duplex is a promising technology and great system performance enhancement can be achieved especially when we apply it to base stations. In this paper, we consider a Multi-User OFDMA network consisting of one Full-duplex base station,…
The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services, such as enhanced mobile broadband (eMBB) devices, by only allocating resources when…
Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these…
The evolution of 5G and Beyond networks has enabled new applications with stringent end-to-end latency requirements, but providing reliable low-latency service with high throughput over public wireless networks is still a significant…
This article considers the problem of delay optimal bundling of the input symbols into transmit packets in the entry point of a wireless sensor network such that the link delay is minimized under an arbitrary arrival rate and a given…
Distributed network optimization has been studied for well over a decade. However, we still do not have a good idea of how to design schemes that can simultaneously provide good performance across the dimensions of utility optimality,…
3GPP has introduced LTE Femtocells to manipulate the traffic for indoor users and to minimize the charge on the Macro cells. A key mechanism in the LTE traffic handling is the packet scheduler which is in charge of allocating resources to…
Beam selection for joint transmission in cell-free massive multi-input multi-output systems faces the problem of extremely high training overhead and computational complexity. The traffic-aware quality of service additionally complicates…
This letter analyzes the Low-latency Region (LLR) of a best-effort link (i.e., no traffic differentiation, and first come first serve scheduling) carrying both delay-sensitive (DS) streaming and non-delay-sensitive (NDS) background traffic.…
We investigate the downlink scheduling problem under Markovian ON/OFF fading channels, where the instantaneous channel state information is not directly accessible, but is revealed via ARQ-type feedback. The scheduler can exploit the…
We propose a distributed algorithm for controlling traffic signals, allowing constraints such as periodic switching sequences of phases and minimum and maximum green time to be incorporated. Our algorithm is adapted from backpressure…
Since the packet is transmitted to a set of relaying nodes in opportunistic routing strategy, so the transmission delay and the duplication transmission are serious. For reducing the transmission delay and the duplicate transmission, in…
We propose a dynamic programming algorithm that constructs delay-optimized circuits for alternating And-Or paths with prescribed input arrival times. Our algorithm fulfills best-known approximation guarantees and empirically outperforms…
The optimal scheduling of interfering links in a dense wireless network with full frequency reuse is a challenging task. The traditional method involves first estimating all the interfering channel strengths then optimizing the scheduling…