PPPC - Peer-2-peer streaming and algorithm for creating spanning trees for peer-2-peer networks

Amir Averbuch*, Yehuda Roditi, Nezer Jacob Zaidenberg

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We describe a system that builds peer-2-peer multicast trees. The proposed system has a unique algorithm that incorporates real-time and priority-based scheduler into a graph theory with robust implementation that supports multiple platforms. Special consideration was given to conditional access and trust computing. We also describe the system design as well as the computational aspects of processing the graphs used by the system.

Original languageEnglish
Title of host publicationNumerical Methods for Differential Equations, Optimization, and Technological Problems
EditorsSergey Repin, Timo Tiihonen, Tero Tuovinen
PublisherSpringer Netherland
Pages363-377
Number of pages15
ISBN (Print)9789400752870
DOIs
StatePublished - 2013
EventECCOMAS Thematic Conference Computational Analysis and Optimization, CAO 2011 - Jyvaskyla, Finland
Duration: 9 Jun 201111 Jun 2011

Publication series

NameComputational Methods in Applied Sciences
Volume27
ISSN (Print)1871-3033

Conference

ConferenceECCOMAS Thematic Conference Computational Analysis and Optimization, CAO 2011
Country/TerritoryFinland
CityJyvaskyla
Period9/06/1111/06/11

Fingerprint

Dive into the research topics of 'PPPC - Peer-2-peer streaming and algorithm for creating spanning trees for peer-2-peer networks'. Together they form a unique fingerprint.

Cite this