Space information flow: Multiple unicast

Li, Zongpeng; Wu, Chuan

doi:10.1109/isit.2012.6283627

Cited by 27 publications

(21 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparatively, a new paradigm of Space Information Flow (SIF) [4] [5], which studies network coding in a geometric space, was proposed by Li et al in 2011. This paper uses the terms SIF and network coding in space in an interchangeable way (See Fig.1).…”

Section: Fig 1 Network Coding In Space (Sif)mentioning

confidence: 99%

On Space Information Flow: Single multicast

Huang

Yin

Zhang

et al. 2013

2013 International Symposium on Network Coding (NetCod)

Self Cite

View full text Add to dashboard Cite

Abstract-Departing from Network Information Flow (NIF) that studies network coding in graphs, Space Information Flow (SIF) is a new paradigm that studies network coding in a geometric space. This work focuses on the problem of min-cost multicast network coding in a 2-dimensional Euclidean space. We prove a number of properties of the optimal SIF solutions, and propose a two-phase heuristic algorithm for computing the optimal SIF. The first phase computes the optimal topology through space partitioning that translates the SIF problem into a NIF problem, which is then solved using linear optimization. The second phase computes the min-cost embedding of the SIF topology found in the first phase, by fine tuning the location of each relay node using properties that an optimal SIF must satisfy.

show abstract

Section: Fig 1 Network Coding In Space (Sif)mentioning

confidence: 99%

On Space Information Flow: Single multicast

Huang

Yin

Zhang

et al. 2013

2013 International Symposium on Network Coding (NetCod)

Self Cite

View full text Add to dashboard Cite

show abstract

“…How much is the difference between the cost of a minimum Steiner tree and a minimum network coding based solution? In Li and Wu's work [1] that proposes the space information flow problem, such a gap is studied, with upper-bound on the gap proven for special cases.…”

Section: The Equivalence Between Steiner Trees and Min-cost Multmentioning

confidence: 99%

“…The total cost of a multicast network is then its "volume": the product of capacity and distance at each link, summed over all links in the network. Li and Wu [1] show that given network coding, a min-cost multicast network is no longer necessarily a Steiner tree. Below we explain this fact with a new and simpler example.…”

Section: Introductionmentioning

confidence: 99%

“…As one of the first work along this direction, we study basic problems including (1) what properties must an optimal multicast network have, (2) when does an optimal multicast network require and not require network coding, and (3) the computational complexity of constructing the optimal multicast network. In particular, we prove that network coding is not necessary in the basic case of 1-to-2 multicast (three terminals, including one source and two receivers).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Min-cost multicast networks in Euclidean space

Yin

Wang

et al. 2012

2012 IEEE International Symposium on Information Theory Proceedings

Self Cite

View full text Add to dashboard Cite

Abstract-Space information flow is a new field of research recently proposed by Li and Wu [1], [2]. It studies the transmission of information in a geometric space, where information flows can be routed along any trajectories, and can be encoded wherever they meet. The goal is to satisfy given endto-end unicast/multicast throughput demands, while minimizing a natural bandwidth-distance sum-product (network volume). Space information flow models the design of a blueprint for a minimum-cost network. We study the multicast version of the space information flow problem, in Euclidean spaces. We present a simple example that demonstrates the design of an information network is indeed different from that of a transportation network. We discuss properties of optimal multicast network embedding, prove that network coding does not make a difference in the basic case of 1-to-2 multicast, and prove upper-bounds on the number of relay nodes required in an optimal multicast network in general.

show abstract

“…In this work, we apply a recently proposed tool, space information flow [3]- [5], to develop a geometric framework for studying the multiple unicast network coding conjecture.…”

Section: Introductionmentioning

confidence: 99%