Title :
Exact modeling of the performance of random linear network coding in finite-buffer networks
Author :
Torabkhani, Nima ; Vellambi, Badri N. ; Beirami, Ahmad ; Fekri, Faramarz
Author_Institution :
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
Abstract :
In this paper, we present an exact model for the analysis of the performance of Random Linear Network Coding (RLNC) in wired erasure networks with finite buffers. In such networks, packets are delayed due to either random link erasures or blocking by full buffers. We assert that because of RLNC, the content of buffers have dependencies which cannot be captured directly using the classical queueing theoretical models. We model the performance of the network using Markov chains by a careful derivation of the buffer occupancy states and their transition rules. We verify by simulations that the proposed framework results in an accurate measure of the network throughput offered by RLNC. Further, we introduce a class of acyclic networks for which the number of state variables is significantly reduced.
Keywords :
Markov processes; linear codes; network coding; queueing theory; random codes; Markov chains; RLNC; acyclic networks; finite-buffer networks; queueing theoretical models; random linear network coding; random link erasures; wired erasure networks; Computational modeling; Conferences; Network coding; Relays; Throughput; Vectors;
Conference_Titel :
Information Theory Workshop (ITW), 2011 IEEE
Conference_Location :
Paraty
Print_ISBN :
978-1-4577-0438-3
DOI :
10.1109/ITW.2011.6089560