Optimal Scheduling for Network Coding: Delay v.s. Efficiency

Abstract

Network Coding can greatly increase the network transmission efficiency by combining multiple input packets into one packet algebraically before forwarding. However, the first arriving packets need to wait for the later ones before coding, which may cause additional delay. In this work, we will investigate the optimal queuing and scheduling strategy that can minimize the delay introduced by network coding, as well as the tradeoff between delay and efficiency of network coding. We will characterize the arriving packet processes into two classes: Uniform and Random. For uniform arriving processes, we will put forward the delay-minimized queuing schemes for both equal rates and unequal rates flows and analyze their performances. For random arriving processes, a half-opportunistic scheduling strategy that can jointly control delay, queue lengths and efficiency will be proposed. Finally, we will study the effect of processing time on the whole queuing system.

Opportunistic and Fairness Scheduling Mechanism for Wireless Network Coding

“…In [9], some optimization trade-offs among throughput, energy cost and delay in network coding are studied. In [10], authors investigate the optimal queuing and scheduling strategy and study the tradeoff between delay and efficiency for both uniform and random arriving processes.…”

Performance Analysis of Enhanced Genetic Algorithm Based Network Coding in Wireless Networks

“…In COPE, the coding scheme principle of not delaying packets is applied. It has been proven that waiting the incoming packets intelligently will lead to an increasing of opportunities of the nodes coding [14]. Table I shows the general parameter settings for E-GACAR.…”

Network Coding Scheme of Wireless Node with Unequal Data Arriving Rates

“…Authors of [10] introduce an opportunistic scheduling, which selects a set of nodes whose packets are network-coded as well as the data rate for the broadcast transmission according to the instantaneous link conditions. In [11], authors investigate the optimal queuing and scheduling strategy and study the tradeoff between delay and efficiency for both uniform and random arriving processes.…”

“…The data arriving model of node r's buffer for network coding is shown in Figure 2 [11]. The packets of two flows arrive independently without synchronization.…”