Random Linear Network Coding for Time Division Duplexing: Queueing Analysis

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

Daniel E. Lucani (Author) FEUP; Muriel Médard (Author) FEUP; Milica Stojanovic (Author) FEUP

Conference proceedings International

Title: ISIT 2009

Pages: 1423-1427

IEEE International Symposium on Information Theory, 2009. ISIT 2009.

Seoul, Korea, June 28 to July 3, 2009

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Engineering > Communication engineering > Telecommunications engineering

Other information

Resumo (PT): We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network coding is provided for time division duplexing channels by means of the moment generating function. We present numerical results for the mean number of packets in the queue and consider the effect of the range of allowable bulk sizes. We show that there exists an optimal choice of this range that minimizes the mean number of data packets in the queue.

Abstract (EN): We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network coding is provided for time division duplexing channels by means of the moment generating function. We present numerical results for the mean number of packets in the queue and consider the effect of the range of allowable bulk sizes. We show that there exists an optimal choice of this range that minimizes the mean number of data packets in the queue.

Language: English

Type (Professor's evaluation): Scientific