Simulating network coding for accelerating tit-for-tat in peer-to-peer content sharing

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The deterministic network coding has several advantages over random network coding methods, like lower communication overhead and faster linear independence check. We would like to create a P2P content sharing simulation environment, where nodes communicate with deterministic network coding to observe the different properties of deterministic source coding. Our simulator is based on the Peersim generic P2P simulation framework. We examine the diversity of block combinations, as this property is the key for increasing the P2P network reliability. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Ludányi, Á., Lukovszki, T., & Ekler, P. (2012). Simulating network coding for accelerating tit-for-tat in peer-to-peer content sharing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7479 LNCS, pp. 408–411). https://doi.org/10.1007/978-3-642-32808-4_37

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