{"title":"分组交换网络中的容错能力和流量分配","authors":"C. Kang, H. H. Tan","doi":"10.1109/MILCOM.1992.244171","DOIUrl":null,"url":null,"abstract":"The authors consider channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assignments which minimize network cost while maintaining quality-of-service performance requirements are determined. This approach is shown to yield significant network cost reductions compared to previous heuristic methods.<<ETX>>","PeriodicalId":394587,"journal":{"name":"MILCOM 92 Conference Record","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Fault-tolerant capacity and flow assignment in packet switched networks\",\"authors\":\"C. Kang, H. H. Tan\",\"doi\":\"10.1109/MILCOM.1992.244171\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assignments which minimize network cost while maintaining quality-of-service performance requirements are determined. This approach is shown to yield significant network cost reductions compared to previous heuristic methods.<<ETX>>\",\"PeriodicalId\":394587,\"journal\":{\"name\":\"MILCOM 92 Conference Record\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MILCOM 92 Conference Record\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MILCOM.1992.244171\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 92 Conference Record","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1992.244171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fault-tolerant capacity and flow assignment in packet switched networks
The authors consider channel allocation and flow assignment (routing) in a network subject to link failures. Fault-tolerant channel allocation and flow assignments which minimize network cost while maintaining quality-of-service performance requirements are determined. This approach is shown to yield significant network cost reductions compared to previous heuristic methods.<>