{"title":"Design of broadband virtual private networks: Model and heuristics for the B-WiN","authors":"A. Bley, M. Grötschel, R. Wessäly","doi":"10.1090/dimacs/053/01","DOIUrl":"https://doi.org/10.1090/dimacs/053/01","url":null,"abstract":"We investigate the problem of designing survivable broadband virtual private networks that employ the Open Shortest Path First (OSPF) routing protocol to route the packages. The capacities available for the links of the network are a minimal capacity plus multiples of a unit capacity. Given the directed communication demands between all pairs of nodes, we wish to select the capacities in a such way, that even in case of a single node or a single link failure a specified percentage of each demand can be satisfied and the costs for these capacities are minimal. We present a mixed--integer linear programming formulation of this problem and several heuristics for its solution. Furthermore, we report on computational results with real-world data.","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132048642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An approximation algorithm for minimum-cost network design","authors":"Y. Mansour, D. Peleg","doi":"10.1090/dimacs/053/06","DOIUrl":"https://doi.org/10.1090/dimacs/053/06","url":null,"abstract":"This paper considers the problem of designing a minimum cost network meeting a given set of traffic requirements between n sites, using one type of channels of a given capacity, with varying set-up costs for different vertex pairs (comprised of a fixed part plus a part dependent on the pair). An approximation algorithm is proposed for this problem, which guaranteed a solution whose cost is greater than the optimum by a factor of at most log n (and constant in the planar case). The algorithm is based on an application of the recent construction of light-weight distance-preserving spanners.","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust interprocessor connections for very-high performance","authors":"Sotirios G. Ziavras, Qian Wang","doi":"10.1090/dimacs/053/09","DOIUrl":"https://doi.org/10.1090/dimacs/053/09","url":null,"abstract":"","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127840360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Constructing optical networks using combinatorial designs","authors":"Si-Qing Zheng","doi":"10.1090/dimacs/053/08","DOIUrl":"https://doi.org/10.1090/dimacs/053/08","url":null,"abstract":"","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125495967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Nonblocking and almost nonblocking multicast switching networks","authors":"Yuanyuan Yang","doi":"10.1090/dimacs/053/07","DOIUrl":"https://doi.org/10.1090/dimacs/053/07","url":null,"abstract":"","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122104731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Communication aspects of fat-tree-based interconnection networks for multicomputers","authors":"Sajal K. Das, Sabine R. Öhring, Maximilian Ibel","doi":"10.1090/dimacs/053/03","DOIUrl":"https://doi.org/10.1090/dimacs/053/03","url":null,"abstract":"","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123127158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal placement of repair servers for reliable multicast","authors":"Lixin Gao, Bo Li, Feng Chen","doi":"10.1090/dimacs/053/04","DOIUrl":"https://doi.org/10.1090/dimacs/053/04","url":null,"abstract":"","PeriodicalId":326021,"journal":{"name":"Robust Communication Networks: Interconnection and Survivability","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133756454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}