Performance Analysis of Chainsaw-based Live P2P Video Streaming
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Due to the growing popularity of viewing media over the Internet, content servers are suffering from more and more stress every day. This problem is traditionally solved by enhancing the server infrastructure at the content provider, which is effective but also costly. A more cost effective solution would be to use P2P technology to distribute the media stream in real-time. For this purpose, the Chainsaw algorithm has been proposed, which performs very well in simulations. However, Chainsaw has not been implemented in a real video player yet. We have built our own version of Chainsaw called Kettingzaag, and we have added some improvements and features which make it more resillient to errors, such as multiple description coding. Kettingzaag is put to the test in our own video player called Lumberjack, on the DAS-3 supercomputer in Delft. Our experiments show that the Kettingzaag algorithm performs well for network sizes up to a hundred nodes, and is likely to perform just as well for larger network sizes.