群网络编码的最优性研究

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523694

T. Chan

{"title":"群网络编码的最优性研究","authors":"T. Chan","doi":"10.1109/ISIT.2005.1523694","DOIUrl":null,"url":null,"abstract":"It is well-known that linear network codes are sufficient to achieve maximal network throughput (or bandwidth utilization efficiency) in the single-session multicast scenario. However, it is not known whether they are still optimal in maximizing network throughput in the multiple-session scenario (either single-source or multiple-source ones). In this paper, we prove that a more general class of network codes - group network codes - are sufficient to achieve the maximal throughput in the single-source multiple-session multicast scenario","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"On the optimality of group network codes\",\"authors\":\"T. Chan\",\"doi\":\"10.1109/ISIT.2005.1523694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is well-known that linear network codes are sufficient to achieve maximal network throughput (or bandwidth utilization efficiency) in the single-session multicast scenario. However, it is not known whether they are still optimal in maximizing network throughput in the multiple-session scenario (either single-source or multiple-source ones). In this paper, we prove that a more general class of network codes - group network codes - are sufficient to achieve the maximal throughput in the single-source multiple-session multicast scenario\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523694\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523694","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

众所周知，在单会话组播场景中，线性网络码足以实现最大的网络吞吐量(或带宽利用效率)。但是，在多会话场景(单源或多源场景)中，它们在最大化网络吞吐量方面是否仍然是最优的，目前尚不清楚。在本文中，我们证明了在单源多会话组播场景中，一种更一般的网络编码-组网络编码-足以实现最大吞吐量

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the optimality of group network codes

It is well-known that linear network codes are sufficient to achieve maximal network throughput (or bandwidth utilization efficiency) in the single-session multicast scenario. However, it is not known whether they are still optimal in maximizing network throughput in the multiple-session scenario (either single-source or multiple-source ones). In this paper, we prove that a more general class of network codes - group network codes - are sufficient to achieve the maximal throughput in the single-source multiple-session multicast scenario

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量