{"title":"生活的真相","authors":"A. Barbero, Øyvind Ytrehus","doi":"10.1109/ICCCN.2007.4317921","DOIUrl":null,"url":null,"abstract":"The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a \"real\" network, through the use of a simulation model. We present results on the algorithm's ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Facts of LIFE\",\"authors\":\"A. Barbero, Øyvind Ytrehus\",\"doi\":\"10.1109/ICCCN.2007.4317921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a \\\"real\\\" network, through the use of a simulation model. We present results on the algorithm's ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.\",\"PeriodicalId\":388763,\"journal\":{\"name\":\"2007 16th International Conference on Computer Communications and Networks\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 16th International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2007.4317921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 16th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2007.4317921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The linear information flow (LIF) algorithm and its relatives are the most efficient centralized algorithms known for finding network encoding equations for multicast communication. This paper examines the performance of the LIFE (linear information flow on edges) algorithm on a "real" network, through the use of a simulation model. We present results on the algorithm's ability to encode in a finite field of given cardinality, and on the efficiency of the randomized version of the algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
