Cut-Set Bounds for Multimessage Multicast Networks with Independent Channels and Zero-Delay Edges
Silas L. Fong

TL;DR
This paper analyzes the capacity bounds of multimessage multicast networks with independent channels and zero-delay edges, showing that the classical cut-set bound remains valid despite the presence of zero-delay edges.
Contribution
It extends the classical cut-set bound to networks with zero-delay edges, demonstrating its validity even when the unit-delay assumption is violated.
Findings
Capacity region lies within the classical cut-set bound.
Zero-delay edges do not violate the cut-set bound.
The result applies to networks with independent channels and cycles.
Abstract
We consider a communication network consisting of nodes and directed edges that connect the nodes. The network may contain cycles. The communications are slotted where the duration of each time slot is equal to the maximum propagation delay experienced by the edges. The edges with negligible delays are allowed to be operated before the other edges in each time slot. For any pair of adjacent edges and where terminates at node and originates from node , we say incurs zero delay on if is operated before ; otherwise, we say incurs a unit delay on . In the classical model, every edge incurs a unit delay on every adjacent edge and the cut-set bound is a well-known outer bound on the capacity region. In this paper, we investigate the multimessage multicast network (MMN) consisting of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
