{"title":"基于随机组播树网络编码的弹性低延迟P2P流系统","authors":"Marco Toldo, E. Magli","doi":"10.1109/MMSP.2010.5662054","DOIUrl":null,"url":null,"abstract":"Network coding is known to provide increased throughput and reduced delay for communications over networks. In this paper we propose a peer-to-peer video streaming system that exploits network coding in order to achieve low start-up delay, high streaming rate, and high resiliency to peers' dynamics. In particular, we introduce the concept of random multicast trees as overlay topology. This topology offers all benefits of tree-based overlays, notably a short start-up delay, but is much more efficient at distributing data and recovering from ungraceful peers departures. We develop a push-based streaming system that leverages network coding to efficiently distribute the information in the overlay without using buffer maps. We show performance results of the proposed system and compare it with an optimized pull systems based on Coolstreaming, showing significant improvement.","PeriodicalId":105774,"journal":{"name":"2010 IEEE International Workshop on Multimedia Signal Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"A resilient and low-delay P2P streaming system based on network coding with random multicast trees\",\"authors\":\"Marco Toldo, E. Magli\",\"doi\":\"10.1109/MMSP.2010.5662054\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network coding is known to provide increased throughput and reduced delay for communications over networks. In this paper we propose a peer-to-peer video streaming system that exploits network coding in order to achieve low start-up delay, high streaming rate, and high resiliency to peers' dynamics. In particular, we introduce the concept of random multicast trees as overlay topology. This topology offers all benefits of tree-based overlays, notably a short start-up delay, but is much more efficient at distributing data and recovering from ungraceful peers departures. We develop a push-based streaming system that leverages network coding to efficiently distribute the information in the overlay without using buffer maps. We show performance results of the proposed system and compare it with an optimized pull systems based on Coolstreaming, showing significant improvement.\",\"PeriodicalId\":105774,\"journal\":{\"name\":\"2010 IEEE International Workshop on Multimedia Signal Processing\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Workshop on Multimedia Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2010.5662054\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Workshop on Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2010.5662054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A resilient and low-delay P2P streaming system based on network coding with random multicast trees
Network coding is known to provide increased throughput and reduced delay for communications over networks. In this paper we propose a peer-to-peer video streaming system that exploits network coding in order to achieve low start-up delay, high streaming rate, and high resiliency to peers' dynamics. In particular, we introduce the concept of random multicast trees as overlay topology. This topology offers all benefits of tree-based overlays, notably a short start-up delay, but is much more efficient at distributing data and recovering from ungraceful peers departures. We develop a push-based streaming system that leverages network coding to efficiently distribute the information in the overlay without using buffer maps. We show performance results of the proposed system and compare it with an optimized pull systems based on Coolstreaming, showing significant improvement.