{"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}
引用次数: 10
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
