A population based incremental learning for delay constrained network coding resource minimization

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In network coding based multicast, coding operations are expected to be minimized as they not only incur additional computational cost at corresponding nodes in network but also increase data transmission delay. On the other hand, delay constraint must be concerned particularly in delay sensitive applications, e.g. video conferencing. In this paper, we study the problem of minimizing the amount of coding operations required while meeting the end-to-end delay constraint in network coding based multicast. A population based incremental learning (PBIL) algorithm is developed, where a group of best so far individuals, rather than a single one, is maintained and used to update the probability vector, which enhances the global search capability of the algorithm. Simulation results demonstrate the effectiveness of our PBIL. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Xing, H., & Qu, R. (2011). A population based incremental learning for delay constrained network coding resource minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6625 LNCS, pp. 51–60). https://doi.org/10.1007/978-3-642-20520-0_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free