We consider the scenario where a sender periodically sends a batch of data to a receiver
over a multi-hop network, possibly using multiple paths. Our objective is to minimize …

This work considers the problem of sending a 1-bit message over an acyclic network, where
the “edge” connecting any two nodes is a memoryless binary-input/symmetric-output (BISO) …

We study network coding gaps for the problem of makespan minimization of multiple
unicasts. In this problem distinct packets at different nodes in a network need to be delivered …

This paper compares the end-to-end (E2E) fountain codes and random linear network
coding (RLNC) for lossy multi-hop short-packet communications, under the constraint that …

An eavesdropper is a passive adversary that aims at extracting private information on the
input and output values of the network's participants, by listening to the traffic exchanged …

Parallelism has become one of the key architectural features in 40-/100-/400-Gb Ethernet
multi lane distribution (MLD) standards. The MLD packetizes and distributes traffic …

We consider the communication capacity of wireline networks for a two-unicast traffic
pattern. The network has two sources and two destinations with each source communicating …

Channel dispersion quantifies the convergence speed of coding rate to channel capacity
under different latency constraints. Under the setting of packet erasure channels (PECs) with …

We consider the single-unicast communication problem in a network with a delay constraint.
For this setting, it has recently been shown that network coding offers an advantage over …

We prove tight network topology dependent bounds on the round complexity of computing
well studied k-party functions such as set disjointness and element distinctness. Unlike the …