相关论文: Efficiently Finding Simple Schedules in Gaussian H…

We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only…

In this paper, we consider full-duplex and half-duplex Gaussian relay channels where the noises at the relay and destination are arbitrarily correlated. We first derive the capacity upper bound and the achievable rates with three existing…

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

For every Gaussian relay network with a single source-destination pair, it is known that there exists a corresponding deterministic network called the discrete superposition network that approximates its capacity uniformly over all SNR's to…

Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…

Proportional fair scheduling (PFS) has been adopted as a standard solution for fair resource allocation in modern wireless cellular networks. With the emergence of heterogeneous networks with widely varying user loads, it is of great…

In this paper, we propose a general model to study the full-duplex non-coherent decode-and-forward Gaussian relay channel with energy harvesting (EH) nodes, called NC-EH-$\mathcal{RC}$, in three cases: $i)$ no energy transfer (ET), $ii)$…

In this paper we study the problem of discovering a timeline of events in a temporal network. We model events as dense subgraphs that occur within intervals of network activity. We formulate the event-discovery task as an optimization…

We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to…

For every Gaussian network, there exists a corresponding deterministic network called the discrete superposition network. We show that this discrete superposition network provides a near-optimal digital interface for operating a class…

We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time;…

As machine learning techniques become ubiquitous, the efficiency of neural network implementations is becoming correspondingly paramount. Frameworks, such as Halide and TVM, separate out the algorithmic representation of the network from…

With the rapid development of high-speed railway (HSR), how to provide the passengers with multimedia services has attracted increasing attention. A key issue is to develop an effective scheduling algorithm for multiple services with…

In this paper, we consider a wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point (HAP) in full-duplex mode. Each user has to transmit…

We propose a new way to construct a multicast coding scheme for linear deterministic relay networks. Our construction can be regarded as a generalization of the well-known multicast network coding scheme of Jaggi et al. to linear…

In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with residual self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link…

In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congestion, energy consumption, and radio footprint expansion. To…

We investigate a scheduling scheme incorporating network coding and channel varying information for the two-way relay networks. Our scheduler aims at minimizing the time span needed to send all the data of each source of the network. We…

We consider the classical problem of scheduling task graphs corresponding to complex applications on distributed computing systems. A number of heuristics have been previously proposed to optimize task scheduling with respect to metrics…