Undirected Unicast Network Capacity: A Partition Bound

@article{Thakor2019UndirectedUN,
  title={Undirected Unicast Network Capacity: A Partition Bound},
  author={Satyajit Thakor and Mohammad Ishtiyaq Qureshi},
  journal={2019 IEEE International Symposium on Information Theory (ISIT)},
  year={2019},
  pages={1-5}
}
  • Satyajit Thakor, Mohammad Ishtiyaq Qureshi
  • Published 2019
  • Computer Science, Mathematics
  • 2019 IEEE International Symposium on Information Theory (ISIT)
  • 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… CONTINUE READING

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.

    On the Partition Bound for Undirected Unicast Network Information Capacity

    VIEW 5 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES

    On the capacity of multiple unicast sessions in undirected graphs

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    The Two-Unicast Problem

    VIEW 1 EXCERPT

    A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding

    VIEW 1 EXCERPT

    On the capacity of information networks

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Cut-Set Bounds on Network Information Flow

    Network coding capacity: A functional dependence bound

    On the k-pairs problem