Referenced Items are not available for this document.
We propose a novel deterministic method for source coding in peer-to-peer networks. The main advantage of our method compared to randomized methods is that the coding will be invertible with probability one. A further advantage is a much lower communication overhead due to special coding vectors. We apply the coding algorithm in a scalable and robust peer-to-peer system. We analyze the deterministic method theoretically and prove upper and lower bounds for the number coded pieces. The theoretical results are backed up by simulations.
Published in:
Computational Intelligence and Informatics (CINTI), 2011 IEEE 12th International Symposium on
Date of Conference: 21-22 Nov. 2011
- Page(s):
- 403 - 408
- Print ISBN:
- 978-1-4577-0044-6
- INSPEC Accession Number:
- 12442647
- Conference Location :
- Budapest
- Digital Object Identifier :
- 10.1109/CINTI.2011.6108539
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
