{"title":"Reliability-dependent combined network design and routing optimization","authors":"D. Papadimitriou, B. Fortz","doi":"10.1109/RNDM.2014.7014928","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014928","url":null,"abstract":"The capacitated Fixed-Charge Network Design (FCND) problem deals with the simultaneous optimization of capacity installation and routing of traffic, where a fixed cost is paid for opening a link and a linear routing cost is paid for sending traffic flow on a link. The routing decision must be performed such that flows remain bounded by the installed capacities. This problem appears as a particular case of the combined network design and traffic flow routing problem with time-dependent demands as developed in this paper. This general problem can be formulated as a multi-period mixed integer optimization problem. A compact formulation based on the aggregation of flows by destination and an extended formulation, where flows are decomposed by origin-destination pairs while keeping the requirement of destination-based routing, have been proposed in [1] and [2], respectively. As these computational improvements enable to progressively overcome the limit of solving such problem when the network size and number of periods increases, we propose an extended model that accounts for different patterns of failures affecting installed arcs over time. The latter lead to consider time-variable link maintenance cost function as part of our generalized formulation. We also analyze the quality of the results for the proposed formulation with different link maintenance cost functions with the objective to derive the best arc replacement strategy.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628411","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":"Survivable multicasting in sparse-splitting optical networks","authors":"Costas K. Constantinou, K. Manousakis, G. Ellinas","doi":"10.1109/RNDM.2014.7014944","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014944","url":null,"abstract":"In this work, the problem of provisioning survivable multicast connections in optical networks is investigated, under the assumption that not all network nodes are multicast capable (MC). A MC capable node is a node that can forward the incoming signal to multiple output ports. An integer linear programming (ILP) formulation is presented, as well as a heuristic algorithm to address the problem. Simulations show that the proposed heuristic gives an average cost of the derived multicasting subgraphs that is very close to the optimal one obtained by the ILP.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132006900","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}
Rein Houthooft, Sahel Sahhaf, W. Tavernier, F. De Turck, D. Colle, M. Pickavet
{"title":"Fault-tolerant Greedy Forest Routing for complex networks","authors":"Rein Houthooft, Sahel Sahhaf, W. Tavernier, F. De Turck, D. Colle, M. Pickavet","doi":"10.1109/RNDM.2014.7014924","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014924","url":null,"abstract":"Geometric routing has been proposed in literature as a memory-efficient alternative to traditional lookup-based routing and forwarding algorithms. However, existing geometric routing schemes lack the ability to address network link and node failures in a natural way, while maintaining a low path stretch. The main contribution of this paper is a novel routing scheme called Greedy Forest Routing (GFR) based on the principles of geometric routing. By employing a graph embedding based on low-redundancy spanning trees, its fault-tolerant characteristics are enhanced. Using a multi-dimensional tree embedding enables natural traffic redirection while still attaining a low average hop count.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131486231","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}
Isil Burcu Barla Harter, M. Hoffmann, D. Schupke, G. Carle
{"title":"Scalable resilient virtual network design algorithms for cloud services","authors":"Isil Burcu Barla Harter, M. Hoffmann, D. Schupke, G. Carle","doi":"10.1109/RNDM.2014.7014941","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014941","url":null,"abstract":"The dependency of businesses and private applications on cloud solutions is increasing day by day. Still, many businesses are reluctant to adopt cloud solutions mainly due to reliability concerns. Service degradation or outages can be caused both due to the cloud domain and the communication network connecting the users to the cloud, which are operated mainly by different entities. Network virtualization with combined control for network and IT domains enables an end-toend resilience design. Resilience, however, can be very costly due to requirements for redundant resources. Shared protection is a solution that offers a compromise between reduced redundant resource requirements and fast recovery. In this paper, we present a mathematical model for resilient virtual network design with shared protection for cloud services. Due to the scalability issues of the optimization model, we also provide two novel heuristic algorithms. Both algorithms are scalable, enable a near optimal resilient virtual network design with shared protection for cloud services. We show that shared protection offers 10-20% less cost and resource requirement compared with dedicated protection.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125208221","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":"Geodiverse routing with path jitter requirement under regional challenges","authors":"Yufei Cheng, J. Sterbenz","doi":"10.1109/RNDM.2014.7014949","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014949","url":null,"abstract":"In this paper, we have extended the GeoDivRP geodiverse routing protocol to consider jitter requirements when using multiple geographic paths for telecommunication networks under regional challenges. We have formulated bounded-jitter multipath routing using a multi-commodity flow problem and proposed an integer linear programming formulation to solve it. We have implemented the routing protocol in ns-3 to employ the optimised paths provided by the bounded-jitter optimisation solution and have demonstrated its effectiveness compared to OSPF in terms of both throughput and overall edge capacity utilisation. GeoDivRP guarantees the jitter constraint provided by the upper layer and satisfies the traffic demand imposed by multiple routing commodities in the telecommunication networks.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129246735","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":"Availability-based path selection","authors":"Song Yang, S. Trajanovski, F. Kuipers","doi":"10.1109/RNDM.2014.7014929","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014929","url":null,"abstract":"In data communication networks, connection availability, which is defined as the probability that the corresponding connection will be found in the operating state, is a key element of many Service Level Agreements (SLA). The path over which a connection is to be established should obey the agreed-upon availability, otherwise the service provider may face revenue loss as stipulated in the SLA. In this paper, we study the problem of establishing a connection over at most k (partially) link-disjoint paths for which the availability is no less than δ (0 <; δ ≤ 1). We consider networks with and without Shared-Risk Link Groups (SRLGs). We prove that this problem, in general, cannot be approximated in polynomial time, unless P=NP. We subsequently propose a polynomial-time heuristic algorithm and an exact Integer Nonlinear Programming (INLP) formulation for availability-based path selection. Finally, the proposed algorithms and two existing heuristic algorithms are compared in terms of acceptance ratio and running time.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132233313","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":"A heuristic for widest edge-disjoint path pair lexicographic optimization","authors":"P. Cruz, Teresa Gomes, D. Medhi","doi":"10.1109/RNDM.2014.7014925","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014925","url":null,"abstract":"Telecommunication services are pervasive in today's human activity and are required to offer reliable and quality-of-service(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths. In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115093711","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}
Yoann Fouquet, D. Nace, M. Pióro, M. Poss, M. Żotkiewicz
{"title":"Elastic Rerouting - models and resolution methods","authors":"Yoann Fouquet, D. Nace, M. Pióro, M. Poss, M. Żotkiewicz","doi":"10.1109/RNDM.2014.7014930","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014930","url":null,"abstract":"This study is concerned with an original traffic restoration strategy for wide-area communication networks called Elastic Rerouting (ER). ER aims at alleviating the tradeoff between the network cost and traffic restoration complexity observed in existing solutions. We present the strategy, provide a mathematical formulation for the ER related optimization problem, and discuss an approach to its resolution.We also report results of a numerical illustrating effectiveness of ER in terms of the link capacity cost.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130933047","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}
K. Walkowiak, M. Kucharzak, Pawel Kopec, A. Kasprzak
{"title":"ILP model and algorithms for restoration of anycast flows in Elastic Optical Networks","authors":"K. Walkowiak, M. Kucharzak, Pawel Kopec, A. Kasprzak","doi":"10.1109/RNDM.2014.7014938","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014938","url":null,"abstract":"Elastic Optical Network (EON) is a promising technology proposed recently to provide flexible and multi-bitrate data transmission in the optical layer. EONs utilize various modulation format conversion and smaller spectrum granularity, what provide more efficient use of spectrum resources comparing to currently used fix-grid WDM networks. Concurrently, growing popularity of network services provided by Data Centers located in different network nodes and related to cloud computing and Content Delivery Network applications triggers the need to address anycast transmissions as an effective way to improve network performance. This paper focuses on modeling and optimization of anycast flows in EONs in the context of network restoration. Specifically, we formulate an original NP-hard Routing and Spectrum Allocation for Restoration of Anycast Flows (RSA/RAF) problem. In order to solve the problem, we design, implement and evaluate four greedy algorithms and a metaheuristic derived from Simulated Annealing. Extensive numerical experiments prove high practical applicability of presented algorithms.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129029017","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":"Analysis of critical node attacks in mobile ad hoc networks","authors":"Dongsheng Zhang, J. Sterbenz","doi":"10.1109/RNDM.2014.7014948","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014948","url":null,"abstract":"Understanding network behavior under challenges is essential to constructing a resilient and survivable network. Due to the mobility and wireless channel properties, it is more difficult to model and analyze MANETs (mobile ad hoc networks) under various challenges. Previously, we have modeled network attacks based on a priori complete knowledge of network structure and mobility. In this paper, we present the analysis of MANET behavior under random node failures and centrality-based attacks based on real-time topological information, and provide a comparison of network performance under complete information and real-time attacks. In addition, we adapt betweenness and closeness centrality to measure node significance in asymmetric source/sink network scenarios. The ns-3 simulator is used to examine network throughput under various intelligent attacks. By analyzing network topological properties, we provide a theoretical verification of the simulation results.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133649586","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}