{"title":"带缓冲的随机线性网络编码的网格连通性分析","authors":"Yunnan Wu","doi":"10.1109/ISIT.2006.261636","DOIUrl":null,"url":null,"abstract":"Previous studies have proposed a practical network coding scheme for multicasting information in packet networks, which buffers received packets and outputs random linear mixtures of packets in the buffer. To analyze the performance of such a scheme, this paper introduces a continuous-time trellis, which models the packet transmissions in a practical asynchronous network. The continuous-time trellis represents an extension of a discrete-time trellis that was used in prior theoretical studies to model a synchronized network. The asymptotic throughput of the practical network coding scheme is characterized via an analysis of the asymptotic s-T connectivity in the trellis","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"A Trellis Connectivity Analysis of Random Linear Network Coding with Buffering\",\"authors\":\"Yunnan Wu\",\"doi\":\"10.1109/ISIT.2006.261636\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Previous studies have proposed a practical network coding scheme for multicasting information in packet networks, which buffers received packets and outputs random linear mixtures of packets in the buffer. To analyze the performance of such a scheme, this paper introduces a continuous-time trellis, which models the packet transmissions in a practical asynchronous network. The continuous-time trellis represents an extension of a discrete-time trellis that was used in prior theoretical studies to model a synchronized network. The asymptotic throughput of the practical network coding scheme is characterized via an analysis of the asymptotic s-T connectivity in the trellis\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261636\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Trellis Connectivity Analysis of Random Linear Network Coding with Buffering
Previous studies have proposed a practical network coding scheme for multicasting information in packet networks, which buffers received packets and outputs random linear mixtures of packets in the buffer. To analyze the performance of such a scheme, this paper introduces a continuous-time trellis, which models the packet transmissions in a practical asynchronous network. The continuous-time trellis represents an extension of a discrete-time trellis that was used in prior theoretical studies to model a synchronized network. The asymptotic throughput of the practical network coding scheme is characterized via an analysis of the asymptotic s-T connectivity in the trellis
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
