An efficient centralized binary multicast network coding algorithm for any cyclic network

Routing and Network Coding over a Cyclic Network for Online Video Gaming

Online video games are getting more popular, attracting a continuously growing number of players. The main performance metrics of this application on the network level are packet ordering, communication throughput and transmission latency. Nowadays there is an interest in cyclic logical network topologies for online gaming, due to the easiness to preserve the packet order over cycles.Unfortunately, this approach increases the end-to-end transmission delays. In our paper, two main contributions are therefore presented. Firstly, it is shown that one can improve the latency of a gaming protocol o…

Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control

The cloud radio access network (Cloud-RAN) has recently been proposed as one cost-effective and energy-efficient technique for 5G wireless networks. By moving the signal processing functionality to a single baseband unit (BBU) pool, centralized signal processing and resource allocation are enabled in Cloud-RAN, thereby providing the promise of improving the energy efficiency via effective network adaptation and interference management. In this paper, we propose a holistic sparse optimization framework to design green Cloud-RAN by taking into consideration the power consumption of the fronthaul…

Circular-shift Linear Network Coding

We study a class of linear network coding (LNC) schemes, called circular-shift LNC, whose encoding operations consist of only circular-shifts and bit-wise additions (XOR). Formulated as a special vector linear code over GF($2$), an $L$-dimensional circular-shift linear code of degree $δ$ restricts its local encoding kernels to be the summation of at most $δ$ cyclic permutation matrices of size $L$. We show that on a general network, for a certain block length $L$, every scalar linear solution over GF($2^{L-1}$) can induce an $L$-dimensional circular-shift linear solution with 1-bit redundancy …

Noisy Network Coding

A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi,…

A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem

The problem of finding network codes for general connections is inherently difficult in capacity constrained networks. Resource minimization for general connections with network coding is further complicated. Existing methods for identifying solutions mainly rely on highly restricted classes of network codes, and are almost all centralized. In this paper, we introduce linear network mixing coefficients for code constructions of general connections that generalize random linear network coding (RLNC) for multicast connections. For such code constructions, we pose the problem of cost minimization…

Dynamic Network-Code Design for Satellite Networks

Internet access from space enjoys renaissance as satellites in Mega-Constellations is no longer fictitious. Network capacity, subject to power and computational complexity constraints among other challenges, is a major goal in this type of networks. This work studies Network Coding in the presence of dynamically changing network conditions. The notion of generalized acyclic network is introduced and employed for promoting the generation of linear-multicast network code for what is considered to be a cyclic network. The performance of several network coding schemes, among these is the known sta…

基于循环移位的向量线性网络编码及其在阵列码中的应用

Circular-shift-based Vector Linear Network Coding and Its Application to Array Codes

本文提出基于循环移位的向量LNC，通过非平凡设计的局部编码核精确实现组播网络容量并保持低复杂度，同时将其应用于Vandermonde循环MDS阵列码的刻画与设计，提出了两种新型阵列码及更优的编码算法。

Capacity Factors of a Point-to-point Network

In this paper, we investigate some properties on capacity factors, which were proposed to investigate the link failure problem from network coding. A capacity factor (CF) of a network is an edge set, deleting which will cause the maximum flow to decrease while deleting any proper subset will not. Generally, a $k$-CF is a minimal (not minimum) edge set which will cause the network maximum flow decrease by $k$. Under point to point acyclic scenario, we characterize all the edges which are contained in some CF, and propose an efficient algorithm to classify. And we show that all edges on some $s$…