{"title":"On the asymptotic behavior of end-point-based multicast streaming","authors":"G. Dán, V. Fodor, G. Karlsson","doi":"10.1109/IZS.2006.1649080","DOIUrl":null,"url":null,"abstract":"In this paper we propose an analytical model of a resilient, tree-based end-node multicast streaming architecture that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We show that this architecture can distribute data to nodes arbitrarily far away from the root of the trees as long as the loss probability is lower than a certain threshold, but the probability of packet reception suddenly drops to zero once this threshold is exceeded. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees","PeriodicalId":405389,"journal":{"name":"2006 International Zurich Seminar on Communications","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Zurich Seminar on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IZS.2006.1649080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper we propose an analytical model of a resilient, tree-based end-node multicast streaming architecture that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We show that this architecture can distribute data to nodes arbitrarily far away from the root of the trees as long as the loss probability is lower than a certain threshold, but the probability of packet reception suddenly drops to zero once this threshold is exceeded. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees