{"title":"StrandCast:用于容忍延迟应用程序的点对点内容分发","authors":"Ketan Mayer-Patel, Andrew Jones","doi":"10.1109/COMSNETS.2010.5431998","DOIUrl":null,"url":null,"abstract":"Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"StrandCast: Peer-to-peer content distribution for latency tolerant applications\",\"authors\":\"Ketan Mayer-Patel, Andrew Jones\",\"doi\":\"10.1109/COMSNETS.2010.5431998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.\",\"PeriodicalId\":369006,\"journal\":{\"name\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"volume\":\"349 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2010.5431998\",\"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 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5431998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
StrandCast: Peer-to-peer content distribution for latency tolerant applications
Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.