{"title":"Capacity of broadcast erasure networks using spatial network coding","authors":"M. Salmasi, S. Golestani","doi":"10.1109/ISITA.2008.4895512","DOIUrl":null,"url":null,"abstract":"We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We study the capacity of a multicast session in point-to-point erasure networks as well as interference-free broadcast erasure networks, under a class of network coding schemes referred to as spatial network coding. In this class of coding, nodes are prohibited from performing coding on successive data units of a link; only combining data units arriving on different incoming links is permitted. We prove that, for both point-to-point and broadcast networks, the capacity of a multicast session is equal to the minimum of the capacities of the constituent unicast sessions. The capacity of a unicast session is equal to the statistical mean of the minimum cut rate of the corresponding random graph, where the notions of graph model and minimum cut rate are extended to apply to broadcast networks.