Simulating Network Coding for Accelerating Tit-for-Tat in Peer-to-Peer Content Sharing

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.
Type de document :
Communication dans un congrès
Róbert Szabó; Attila Vidács. 18th European Conference on Information and Communications Technologies (EUNICE), Aug 2012, Budapest, Hungary. Springer, Lecture Notes in Computer Science, LNCS-7479, pp.408-411, 2012, Information and Communication Technologies. 〈10.1007/978-3-642-32808-4_37〉
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01543140
Contributeur : Hal Ifip <>
Soumis le : mardi 20 juin 2017 - 15:21:08
Dernière modification le : vendredi 8 décembre 2017 - 18:04:01
Document(s) archivé(s) le : vendredi 15 décembre 2017 - 19:57:23

Fichier

978-3-642-32808-4_37_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Ákos Ludányi, Tamás Lukovszki, Péter Ekler. Simulating Network Coding for Accelerating Tit-for-Tat in Peer-to-Peer Content Sharing. Róbert Szabó; Attila Vidács. 18th European Conference on Information and Communications Technologies (EUNICE), Aug 2012, Budapest, Hungary. Springer, Lecture Notes in Computer Science, LNCS-7479, pp.408-411, 2012, Information and Communication Technologies. 〈10.1007/978-3-642-32808-4_37〉. 〈hal-01543140〉

Partager

Métriques

Consultations de la notice

16

Téléchargements de fichiers

18