Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis

Details Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis

2009-03-25

arxiv.org/abs/0903.4434v1

Computer Science

Information Theory

5 pages, 5 figures, 2 tables, Submitted to ISIT 2009

Scientific paper

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 [1] 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.

Affiliated with

Also associated with

No associations

Rating

Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-69052