双向环网的多报文单播容量区域

2006 IEEE International Symposium on Information Theory Pub Date : 2006-07-09 DOI:10.1109/ISIT.2006.261635

S. Savari, G. Kramer

{"title":"双向环网的多报文单播容量区域","authors":"S. Savari, G. Kramer","doi":"10.1109/ISIT.2006.261635","DOIUrl":null,"url":null,"abstract":"The capacity region for multiple unicast sessions on a bidirectional ring network is established and is shown to be achieved by routing. The proof uses recently developed progressive d-separating edge set bounds, new extensions of these bounds, as well as tools from the literature on the multicommodity flow problem","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"333 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"The Multimessage Unicast Capacity Region for Bidirectional Ring Networks\",\"authors\":\"S. Savari, G. Kramer\",\"doi\":\"10.1109/ISIT.2006.261635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The capacity region for multiple unicast sessions on a bidirectional ring network is established and is shown to be achieved by routing. The proof uses recently developed progressive d-separating edge set bounds, new extensions of these bounds, as well as tools from the literature on the multicommodity flow problem\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"333 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.261635\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.261635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

建立了双向环形网络上多个单播会话的容量区域，并通过路由实现。证明使用了最近开发的渐进式d分离边集边界，这些边界的新扩展，以及来自多商品流问题文献的工具

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The Multimessage Unicast Capacity Region for Bidirectional Ring Networks

The capacity region for multiple unicast sessions on a bidirectional ring network is established and is shown to be achieved by routing. The proof uses recently developed progressive d-separating edge set bounds, new extensions of these bounds, as well as tools from the literature on the multicommodity flow problem

求助全文

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

来源期刊

2006 IEEE International Symposium on Information Theory

自引率

0.00%

发文量