Undirected Unicast Network Capacity: A Partition Bound
Abstract
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in undirected unicast networks and give an algorithm to compute it. Two classes of networks are presented for which the bound is tight and the capacity is achievable by routing thus confirming the undirected unicast conjecture for these classes of networks. We also show that the bound can be loose in general and present an approach to tighten it.
Cite
@article{arxiv.2005.10530,
title = {Undirected Unicast Network Capacity: A Partition Bound},
author = {Satyajit Thakor and Mohammad Ishtiyaq Qureshi},
journal= {arXiv preprint arXiv:2005.10530},
year = {2020}
}
Comments
ISIT'19 (c) 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works