We consider a single-unicast networking scenario where a sender streams a flow at a fixed
rate to a receiver across a multi-hop network, possibly using multiple paths. Transmission …

We consider a single-unicast networking scenario where a sender periodically sends a
batch of data to a receiver over a multi-hop network, possibly using multiple paths. We study …

We consider the scenario where a sender streams a flow at a fixed rate to a receiver across
a multi-hop network, possibly using multiple paths. Data transmission over a link incurs a …

We consider a multiple-unicast network flow problem of maximizing aggregate user utilities
under link capacity constraints, maximum delay constraints, and user throughput …

We study a delay-sensitive information flow problem where a source streams information to
a sink over a directed graph G=(V, E) at a fixed rate R possibly using multiple paths to …

Providing end-to-end network delay guarantees in packet-switched networks such as the
Internet is highly desirable for mission-critical and delay-sensitive data transmission, yet it …

This paper considers the following fundamental maximum throughput routing problem: given
a set of k (splittable) multicommodity flows with equal demands in an n-node network, select …

Scheduling packets with end-to-end deadline constraints in multihop networks is an
important problem that has been notoriously difficult to tackle. Recently, there has been …

We consider the transmission of a message of size r from a source to a destination with the
minimum end-to-end delay over a computer network where bandwidth can be reserved and …

There is a demand of high bandwidth in the emerging real-time applications, such as
autonomous vehicles, robotics, and industrial automation, where time-sensitive networking …