Network Coding Gaps for Completion Times of Multiple Unicasts

05/07/2019
by   Bernhard Haeupler, et al.
0

Arguably the most common network communication problem is multiple-unicasts: Distinct packets at different nodes in a network need to be delivered to a destination specific to each packet as fast as possible. The famous multiple-unicast conjecture posits that, for this natural problem, there is no performance gap between routing and network coding, at least in terms of throughput. We study the same network coding gap but in terms of completion time. While throughput corresponds to the completion time for asymptotically-large transmissions, we look at completion times of multiple unicasts for arbitrary amounts of data. We develop nearly-matching upper and lower bounds. In particular, we prove that the network coding gap for the completion time of k unicasts is at most polylogarithmic in k, and there exist instances of k unicasts for which this coding gap is polylogarithmic in k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2018

On the Packet Decoding Delay of Linear Network Coded Wireless Broadcast

We apply linear network coding (LNC) to broadcast a block of data packet...
research
11/24/2019

Delay-Complexity Trade-off of Random Linear Network Coding in Wireless Broadcast

In wireless broadcast, random linear network coding (RLNC) over GF(2^L) ...
research
09/19/2018

Zero-error communication over adder MAC

Adder MAC is a simple noiseless multiple-access channel (MAC), where if ...
research
06/20/2020

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

This paper tackles the problem of transmitting a common content to a num...
research
08/24/2019

Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing

Flow routing over inter-datacenter networks is a well-known problem wher...
research
01/04/2019

Network Coding Solutions for the Combination Network and its Subgraphs

The combination network is one of the simplest and insightful networks i...
research
05/05/2019

Efficient Inter-Datacenter Bulk Transfers with Mixed Completion Time Objectives

Bulk transfers from one to multiple datacenters can have many different ...

Please sign up or login with your details

Forgot password? Click here to reset