{"title":"计算机广域网中多商品流问题的线性容量算法","authors":"A. F. Zantuti","doi":"10.1109/ICSEng.2017.17","DOIUrl":null,"url":null,"abstract":"The problem consists in selection of multicommodity flow routes and channel capacities and the paper presents the algorithm for capacity and routing assignment problem to minimize the average delay per packet subject to the budget constraint.","PeriodicalId":202005,"journal":{"name":"2017 25th International Conference on Systems Engineering (ICSEng)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Linear Capacity Algorithms for Multicommodity Flow Problems in Computer WAN\",\"authors\":\"A. F. Zantuti\",\"doi\":\"10.1109/ICSEng.2017.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem consists in selection of multicommodity flow routes and channel capacities and the paper presents the algorithm for capacity and routing assignment problem to minimize the average delay per packet subject to the budget constraint.\",\"PeriodicalId\":202005,\"journal\":{\"name\":\"2017 25th International Conference on Systems Engineering (ICSEng)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 25th International Conference on Systems Engineering (ICSEng)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEng.2017.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 25th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEng.2017.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Linear Capacity Algorithms for Multicommodity Flow Problems in Computer WAN
The problem consists in selection of multicommodity flow routes and channel capacities and the paper presents the algorithm for capacity and routing assignment problem to minimize the average delay per packet subject to the budget constraint.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
