The Encoding Complexity of Network Coding for Two Simple Multicast Sessions
نویسندگان
چکیده
The intersession network coding problem, which is also known as the multiple source network coding problem is a challenging topic, and has attracted significant attention from the network coding community. In this paper, we study the encoding complexity for intersession network coding with two simple multicast sessions. The encoding complexity is characterized from two aspects: the number of encoding links and the finite field size for achieving a solution. We prove that (1) the number of encoding links required to achieve a solution is upper-bounded by 2N − 1; and (2) the size of the field required to achieve a linear solution is upper-bounded by ⌊ √ 4N − 31/4 + 3/2⌋, where |E| is the number of edges and N is the number of sinks of the network.
منابع مشابه
Information Multicast in Planar Networks: Efficient Network Coding over Small Finite Fields
Network coding encourages in-network mixing of information flows for enhanced network capacity, particularly for multicast data dissemination. While existing theory on multicast network coding often treats the underlying network topology as a blackbox, we show that exploring network-specific properties in the topology can lead to much more efficient network coding solutions, including efficient...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملBounds on the Benefit of Network Coding for Multicast and Unicast Sessions in Wireless Networks
In this technical report we establish fundamental limitations to the benefit of network coding in terms of energy and throughput in multihop wireless networks. Thereby we adopt two well accepted scenarios in the field: single multicast session and multiple unicast sessions. Most of our results apply to arbitrary wireless network and are, in particular, not asymptotic in kind. We prove that the ...
متن کاملClassifying Networks for Network Coding
Network coding is a relatively recent development in the realm of maximizing information transfer in communications and computer networks. Traditional networks operate by simply storing and forwarding data along. Network coding, however, allows intermediate network nodes to combine data using arithmetic operations. In many instances, this can lead to more efficient use of network resources. Sin...
متن کاملMinimum cost multiple multicast network coding with quantized rates
In this paper, we consider multiple multicast sessions with intra-session network coding where rates over all links are integer multiples of a basic rate. Although having quantized rates over communication links is quite common, conventional minimum cost network coding problem cannot generally result in quantized solutions. In this research, the problem of finding minimum cost transmission for ...
متن کامل