无向图中多个单播会话的容量

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

K. Jain, V. Vazirani, G. Yuval

{"title":"无向图中多个单播会话的容量","authors":"K. Jain, V. Vazirani, G. Yuval","doi":"10.1109/TIT.2006.874543","DOIUrl":null,"url":null,"abstract":"Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K3,2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"73","resultStr":"{\"title\":\"On the capacity of multiple unicast sessions in undirected graphs\",\"authors\":\"K. Jain, V. Vazirani, G. Yuval\",\"doi\":\"10.1109/TIT.2006.874543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K3,2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"73\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIT.2006.874543\",\"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/TIT.2006.874543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 73

摘要

Li和Li推测，在具有多个单播会话的无向网络中，网络编码不会导致任何编码增益。令人惊讶的是，到目前为止，即使是由k3,2和四个源-汇对组成的简单网络，也无法验证这一猜想。利用熵演算，我们首次验证了该网络的Li-Li猜想。我们将边界推广到任意有向二部网络的情况

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

查看原文本刊更多论文

On the capacity of multiple unicast sessions in undirected graphs

Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K3,2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network

求助全文

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

来源期刊

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

自引率

0.00%

发文量