Go to:
Logótipo
Você está em: Start » Publications » View » Online Network Coding for Time Division Duplexing
Publication

Online Network Coding for Time Division Duplexing

Title
Online Network Coding for Time Division Duplexing
Type
Article in International Conference Proceedings Book
Year
2010
Authors
Daniel E. Lucani
(Author)
FEUP
Muriel Medard
(Author)
FEUP
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Milica Stojanovic
(Author)
FEUP
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
IEEE Global Communications Conference (GLOBECOM)
Miami, FL, USA, 6 a 10 de Dezembro de 2010
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
Other information
Resumo (PT): We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variable bulk size and with feedback, i.e., when a set of packets are serviced at a given time, they might be reintroduced to the queue to form part of the next service batch. We show that there is an optimal number of coded data packets that the sender should transmit back-to-back before stopping to wait for an acknowledgement from the receiver. This number depends on the latency, probability of packet erasure, degrees of freedom at the receiver, the size of the coding window, and the arrival rate of the Poisson process. Random network coding is performed across a moving window of packets that depends on the packets in the queue, design constraints on the window size, and the feedback sent from the receiver. We study the mean time between generating a packet at the source and it being ``seen", but not necessarily decoded, at the receiver. We also analyze the mean time between a decoding event and the next, defined as the decoding of all the packets that have been previously ``seen" and those packets involved in the current window of packets. Inherently, a decoding event implies an in-order decoding of a batch of data packets. We present numerical results illustrating the trade-off between mean delay and mean time between decoding events.
Abstract (EN): We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variable bulk size and with feedback, i.e., when a set of packets are serviced at a given time, they might be reintroduced to the queue to form part of the next service batch. We show that there is an optimal number of coded data packets that the sender should transmit back-to-back before stopping to wait for an acknowledgement from the receiver. This number depends on the latency, probability of packet erasure, degrees of freedom at the receiver, the size of the coding window, and the arrival rate of the Poisson process. Random network coding is performed across a moving window of packets that depends on the packets in the queue, design constraints on the window size, and the feedback sent from the receiver. We study the mean time between generating a packet at the source and it being ``seen", but not necessarily decoded, at the receiver. We also analyze the mean time between a decoding event and the next, defined as the decoding of all the packets that have been previously ``seen" and those packets involved in the current window of packets. Inherently, a decoding event implies an in-order decoding of a batch of data packets. We present numerical results illustrating the trade-off between mean delay and mean time between decoding events.
Language: English
Type (Professor's evaluation): Scientific
Contact: Daniel E. Lucani (dlucani@fe.up.pt)
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Systematic Network Coding for Time Division Duplexing (2010)
Article in International Conference Proceedings Book
Daniel E. Lucani; Muriel Medard; Milica Stojanovic
Sharing Information in Time-Division Duplexing Channels: A Network Coding Approach (2009)
Article in International Conference Proceedings Book
Daniel E. Lucani; Muriel Medard; Milica Stojanovic; David R. Karger
Random Linear Network Coding for Time Division Duplexing: Field Size Considerations (2009)
Article in International Conference Proceedings Book
Daniel E. Lucani; Muriel Medard; Milica Stojanovic
Network Coding For Data Dissemination: It Is Not What You Know, But What Your Neighbors Don’t Know (2009)
Article in International Conference Proceedings Book
Daniel E. Lucani; Frank H. P. Fitzek; Muriel Medard; Milica Stojanovic
Multi-hop Routing is Order-optimal in Underwater Extended Networks (2010)
Article in International Conference Proceedings Book
Won-Yong Shin; Daniel E. Lucani; Muriel Medard; Milica Stojanovic; Vahid Tarokh
Recommend this page Top
Copyright 1996-2024 © Faculdade de Medicina da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-08-26 at 17:18:08
Acceptable Use Policy | Data Protection Policy | Complaint Portal | Política de Captação e Difusão da Imagem Pessoal em Suporte Digital