%0 Conference Proceedings
%T Simulating Network Coding for Accelerating Tit-for-Tat in Peer-to-Peer Content Sharing
%+ Department of Automation and Applied Informatics
%+ Eötvös Loránd University (ELTE)
%A Ludányi, Ákos
%A Lukovszki, Tamás
%A Ekler, Péter
%Z Part 6: Poster Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th European Conference on Information and Communications Technologies (EUNICE)
%C Budapest, Hungary
%Y Róbert Szabó
%Y Attila Vidács
%I Springer
%3 Information and Communication Technologies
%V LNCS-7479
%P 408-411
%8 2012-08-29
%D 2012
%R 10.1007/978-3-642-32808-4_37
%K network coding
%K P2P
%K deterministic network coding
%K content sharing
%K network simulation
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.2
%Z WG 6.6
%2 https://inria.hal.science/hal-01543140/document
%2 https://inria.hal.science/hal-01543140/file/978-3-642-32808-4_37_Chapter.pdf
%L hal-01543140
%U https://inria.hal.science/hal-01543140
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-WG6-6
%~ IFIP-WG6-2
%~ IFIP-EUNICE
%~ IFIP-LNCS-7479