{"title":"Robust Network Coding in the Presence of Link Failure Using a Multicast Rate-Diversity Trade off","authors":"H. Bahramgiri, Mohammad Jabbari, F. Lahouti","doi":"10.1109/ITWITWN.2007.4318048","DOIUrl":null,"url":null,"abstract":"We introduce a centralized joint network-channel coding scheme for maximized throughput and increased robustness against link failure in a communication network. We introduce RNC1(h,k) to multicast k independent data in a directed and acyclic network with capacity h, klesh . The redundancy through path diversity increases the resistance of the network against link failure. An improved version of RNC1, RNC2(h,k), is introduced to guarantee the rate k for h-k flow failures. The proposed schemes exploit the network structure for code design, which results in a manageable design complexity.","PeriodicalId":257392,"journal":{"name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWITWN.2007.4318048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
We introduce a centralized joint network-channel coding scheme for maximized throughput and increased robustness against link failure in a communication network. We introduce RNC1(h,k) to multicast k independent data in a directed and acyclic network with capacity h, klesh . The redundancy through path diversity increases the resistance of the network against link failure. An improved version of RNC1, RNC2(h,k), is introduced to guarantee the rate k for h-k flow failures. The proposed schemes exploit the network structure for code design, which results in a manageable design complexity.