{"title":"The k-node-connected subgraph problem: Facets and Branch-and-Cut","authors":"I. Diarrassouba, Meriem Mahjoub, A. Mahjoub","doi":"10.1109/DRCN.2016.7470828","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470828","url":null,"abstract":"In this paper we consider the k-node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facial aspect. We also devise separation routines and discuss some structure properties and reduction operations. Using these results, we devise a Branch-and-Cut algorithm along with some computational results.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993409","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 controllers in a resilient SDN architecture","authors":"N. Perrot, T. Reynaud","doi":"10.1109/DRCN.2016.7470849","DOIUrl":"https://doi.org/10.1109/DRCN.2016.7470849","url":null,"abstract":"The SDN (Software Defined Networking) paradigm brings flexibility to the network management and is an enabler to reduce the energy consumption of the networks. However deploying a set of SDN controllers to manage a Wide Area Network is still a challenge as it implies to determine the right number of controllers to install and their locations within the network. In this paper, we give the key performance criteria that should be taken into account to provide a “good” placement in terms of Quality of Service and we propose an integer linear programming formulation of the resilient controller placement problem. This formulation provides the optimal number of controllers and their location while embedding QoS and load balancing constraints for several level of backup controllers.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414333","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}
Maryam Barshan, Hendrik Moens, J. Famaey, F. Turck
{"title":"Resilient algorithms for advance bandwidth reservation in media production networks","authors":"Maryam Barshan, Hendrik Moens, J. Famaey, F. Turck","doi":"10.1109/INM.2015.7140291","DOIUrl":"https://doi.org/10.1109/INM.2015.7140291","url":null,"abstract":"Media production networks connect different actors such as production houses, broadcasters and advertisers over a large geographical area. The substrate network in a media production process can be shared among many users simultaneously. These networks often have predictable traffic, meaning that the timing and bandwidth requirements of data transfers are generally known at least hours or even days in advance. Using this knowledge, an efficient advance reservation mechanism can be deployed to improve the performance in terms of resource utilization and cost. In such mechanisms, to improve the performance, defining strategies to deal with unforeseen failures in the network is required. In this paper, we propose a resilient advance bandwidth reservation algorithm for media production networks. To enable a quick response to sudden changes such as failures in the network, we rely on a protection mechanism, which means that backup paths are found in advance, before any failure happens in the network. The proposed scheme aims at minimizing the resource usage of backups, while it guarantees 100% recovery against any single link failure. We have performed an availability analysis of the proposed scheme considering an optical transport network and compared it with the non-resilient approach. The results show that the proposed scheme performs reasonably well and enhances the availability significantly compared to the non-resilient approach.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116281702","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}