{"title":"基于端点的组播流容错性能研究","authors":"G. Dán, I. Chatzidrossos, V. Fodor, G. Karlsson","doi":"10.1109/IWQOS.2006.250464","DOIUrl":null,"url":null,"abstract":"In this paper we propose an analytical model of a resilient end-node multicast streaming architecture based on multiple minimum-depth-trees that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We study the performance of the architecture in the presence of packet losses and dynamic node behavior. We show that for a given redundancy the probability that an arbitrary node possesses a packet is high as long as the loss probability in the network is below a certain threshold. After reaching the threshold the packet possession probability suddenly drops; the rate decrease gets faster as the number of nodes in the overlay grows. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees. We study the overlay structure in the presence of node dynamics and conclude that stability can be achieved only if the root node serves a large number of nodes simultaneously","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"On the Performance of Error-resilient End-point-based Multicast Streaming\",\"authors\":\"G. Dán, I. Chatzidrossos, V. Fodor, G. Karlsson\",\"doi\":\"10.1109/IWQOS.2006.250464\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose an analytical model of a resilient end-node multicast streaming architecture based on multiple minimum-depth-trees that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We study the performance of the architecture in the presence of packet losses and dynamic node behavior. We show that for a given redundancy the probability that an arbitrary node possesses a packet is high as long as the loss probability in the network is below a certain threshold. After reaching the threshold the packet possession probability suddenly drops; the rate decrease gets faster as the number of nodes in the overlay grows. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees. We study the overlay structure in the presence of node dynamics and conclude that stability can be achieved only if the root node serves a large number of nodes simultaneously\",\"PeriodicalId\":248938,\"journal\":{\"name\":\"200614th IEEE International Workshop on Quality of Service\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"200614th IEEE International Workshop on Quality of Service\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQOS.2006.250464\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"200614th IEEE International Workshop on Quality of Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2006.250464","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Performance of Error-resilient End-point-based Multicast Streaming
In this paper we propose an analytical model of a resilient end-node multicast streaming architecture based on multiple minimum-depth-trees that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We study the performance of the architecture in the presence of packet losses and dynamic node behavior. We show that for a given redundancy the probability that an arbitrary node possesses a packet is high as long as the loss probability in the network is below a certain threshold. After reaching the threshold the packet possession probability suddenly drops; the rate decrease gets faster as the number of nodes in the overlay grows. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees. We study the overlay structure in the presence of node dynamics and conclude that stability can be achieved only if the root node serves a large number of nodes simultaneously