Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489836
Bálazs Vass, László Németh, Martin Zachariasen, A. Sousa, János Tapolcai
Several recent works shed light on the vulnerability of networks against regional failures, which are failures of multiple equipments in a geographical region as a result of a natural disaster. In order to enhance the preparedness of a given network to natural disasters, regional failures and associated Shared Risk Link Groups (SRLGs) should be first identified. For simplicity, most of the previous works assume the network is embedded on an Euclidean plane. Nevertheless, since real networks are embedded on the Earth surface, this assumption causes distortion. In this work, we generalize some of the related results on plane to sphere. In particular, we focus on algorithms for listing SRLGs as a result of regional failures of circular shape.
{"title":"Vulnerable Regions of Networks on Sphere","authors":"Bálazs Vass, László Németh, Martin Zachariasen, A. Sousa, János Tapolcai","doi":"10.1109/RNDM.2018.8489836","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489836","url":null,"abstract":"Several recent works shed light on the vulnerability of networks against regional failures, which are failures of multiple equipments in a geographical region as a result of a natural disaster. In order to enhance the preparedness of a given network to natural disasters, regional failures and associated Shared Risk Link Groups (SRLGs) should be first identified. For simplicity, most of the previous works assume the network is embedded on an Euclidean plane. Nevertheless, since real networks are embedded on the Earth surface, this assumption causes distortion. In this work, we generalize some of the related results on plane to sphere. In particular, we focus on algorithms for listing SRLGs as a result of regional failures of circular shape.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238922","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}
Pub Date : 2018-08-01DOI: 10.1109/rndm.2018.8489834
{"title":"[Copyright notice]","authors":"","doi":"10.1109/rndm.2018.8489834","DOIUrl":"https://doi.org/10.1109/rndm.2018.8489834","url":null,"abstract":"","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115608074","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489825
Fábio Barbosa, A. Sousa, A. Agra
Consider the resilience of a network defined by the average 2-terminal reliability (A2TR) against a set of critical node failures. Consider an existing transparent optical network with a total fibre length L. The first goal of this paper is to assess the resiliency gap between the existing topology and a new network topology designed to maximize its resilience with the same fibre budget L. The resiliency gap gives us a measure of how good the resilience of existing network topologies are. Consider now that an existing network is upgraded with new links aiming to maximize its resiliency improvement with a fibre budget L′. The second goal of this paper is to assess how much the resiliency gap can be reduced between a good upgraded solution and a network topology designed to maximize its resiliency with the same fibre budget L + L′. The gap reduction gives us a measure of how close to the best resilience the upgraded solutions can get for different values of L′.To reach these goals, we first describe how the Critical Node Detection problem is defined and solved in the context of transparent optical networks. Then, we propose a multi-start greedy randomized method to generate network topologies, with a given fibre length budget, that are resilient to critical node failures. This method is also adapted to the upgrade of an existing network topology. At the end, we run the proposed methods on network topologies with public available information. The computational results show that the resiliency gap of existing topologies is significantly large but network upgrades with L′ = 10%L can significantly reduce the resiliency gaps provided that such upgrades are aimed at maximizing the network resilience to multiple node failures.
{"title":"Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures","authors":"Fábio Barbosa, A. Sousa, A. Agra","doi":"10.1109/RNDM.2018.8489825","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489825","url":null,"abstract":"Consider the resilience of a network defined by the average 2-terminal reliability (A2TR) against a set of critical node failures. Consider an existing transparent optical network with a total fibre length L. The first goal of this paper is to assess the resiliency gap between the existing topology and a new network topology designed to maximize its resilience with the same fibre budget L. The resiliency gap gives us a measure of how good the resilience of existing network topologies are. Consider now that an existing network is upgraded with new links aiming to maximize its resiliency improvement with a fibre budget L′. The second goal of this paper is to assess how much the resiliency gap can be reduced between a good upgraded solution and a network topology designed to maximize its resiliency with the same fibre budget L + L′. The gap reduction gives us a measure of how close to the best resilience the upgraded solutions can get for different values of L′.To reach these goals, we first describe how the Critical Node Detection problem is defined and solved in the context of transparent optical networks. Then, we propose a multi-start greedy randomized method to generate network topologies, with a given fibre length budget, that are resilient to critical node failures. This method is also adapted to the upgrade of an existing network topology. At the end, we run the proposed methods on network topologies with public available information. The computational results show that the resiliency gap of existing topologies is significantly large but network upgrades with L′ = 10%L can significantly reduce the resiliency gaps provided that such upgrades are aimed at maximizing the network resilience to multiple node failures.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129525177","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489789
P. Wiatr, D. Yuan
In communication networks, a device failure is never a desired event, as it can interrupt multiple connections and disturb transmission of large amount of data and thus decrease connection reliability performance. The approaches used to ensure high connection reliability performance focus mainly on minimizing the impact due to a device failure by using backup resources. These approaches commonly assume the reliability performance of a device to be constant. However, it is known that the device reliability performance is related to its level of occupancy. In this article we leverage on this relation and propose a novel routing algorithm referred to as: device reliability performance aware routing (RAR) that allows for significant reduction of the number of device failures and connection reconfigurations in the network. The proposed RAR algorithm is evaluated using simulations and compared to the shortest path (SP) approach. Evaluation results show that RAR can provide significant benefits comparing to the SP approach. The number of device failures can be reduced by ~20% while the number of connection reconfigurations caused by the failure of a device can be reduced by ~30%.
{"title":"Reliability Performance Aware Routing","authors":"P. Wiatr, D. Yuan","doi":"10.1109/RNDM.2018.8489789","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489789","url":null,"abstract":"In communication networks, a device failure is never a desired event, as it can interrupt multiple connections and disturb transmission of large amount of data and thus decrease connection reliability performance. The approaches used to ensure high connection reliability performance focus mainly on minimizing the impact due to a device failure by using backup resources. These approaches commonly assume the reliability performance of a device to be constant. However, it is known that the device reliability performance is related to its level of occupancy. In this article we leverage on this relation and propose a novel routing algorithm referred to as: device reliability performance aware routing (RAR) that allows for significant reduction of the number of device failures and connection reconfigurations in the network. The proposed RAR algorithm is evaluated using simulations and compared to the shortest path (SP) approach. Evaluation results show that RAR can provide significant benefits comparing to the SP approach. The number of device failures can be reduced by ~20% while the number of connection reconfigurations caused by the failure of a device can be reduced by ~30%.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750184","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489800
T. A. Nguyen, J. Sterbenz
We present the design and simulation analysis of ResTP, a multipath-capable configurable and adaptive transport-layer protocol developed for Future Internet resilience and survivability. ResTP is distinct from the conventional transport protocols such as TCP, UDP, and MPTCP by the flexibility in its design so that it can satisfy the requirements of various traffic classes, application types, and taking into account the underlying network characteristics, and its emphasis on achieving resilience, an essential property that is unfortunately lacking in the current Internet system. In this paper, we perform a simulation evaluation of ResTP, with the focus on its single-path mode, in comparison with TCP and UDP under various network conditions to show that ResTP can be used in place of these standard protocols with no performance loss. In some scenarios, ResTP outperforms the standards due to its flexibility in adopting the appropriate set of algorithms for specific application needs and network conditions.
{"title":"On the Design and Analysis of a Resilient Transport Protocol","authors":"T. A. Nguyen, J. Sterbenz","doi":"10.1109/RNDM.2018.8489800","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489800","url":null,"abstract":"We present the design and simulation analysis of ResTP, a multipath-capable configurable and adaptive transport-layer protocol developed for Future Internet resilience and survivability. ResTP is distinct from the conventional transport protocols such as TCP, UDP, and MPTCP by the flexibility in its design so that it can satisfy the requirements of various traffic classes, application types, and taking into account the underlying network characteristics, and its emphasis on achieving resilience, an essential property that is unfortunately lacking in the current Internet system. In this paper, we perform a simulation evaluation of ResTP, with the focus on its single-path mode, in comparison with TCP and UDP under various network conditions to show that ResTP can be used in place of these standard protocols with no performance loss. In some scenarios, ResTP outperforms the standards due to its flexibility in adopting the appropriate set of algorithms for specific application needs and network conditions.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127410220","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489841
Michal Aibin, K. Walkowiak
In last few years, cloud computing and other services based on data centers have evolved from an emerging technology to a recognized approach that is gaining broad acceptance and deployment. Therefore, there is a significant need to provide efficient and reliable operation of inter-data center networks based on optical technologies. In this article, we focus on cross stratum optimization of an inter-data center elastic optical network with additional survivability requirements. We propose a novel optimization approach that employs machine learning Monte Carlo Tree Search (MCTS) algorithm for simulation of future traffic to improve the performance of the network regarding blocking probability and operational cost. We evaluate the performance of the proposed method and other reference algorithms under various network scenarios, using representative topologies and real data provided by Amazon Web Services. The main conclusion is that the approach based on the MCTS algorithm enables better coordination of resource allocation in both strata, which results in lower blocking of requests and lower cost taking into account the survivability requirements, in comparison to other algorithms.
在过去几年中，基于数据中心的云计算和其他服务已经从一种新兴技术发展成为一种得到广泛接受和部署的公认方法。因此，为基于光技术的数据中心间网络提供高效、可靠的运行是迫切需要的。在本文中，我们关注具有额外生存性要求的数据中心间弹性光网络的跨层优化。我们提出了一种新的优化方法，采用机器学习蒙特卡罗树搜索(MCTS)算法来模拟未来的流量，以提高网络在阻塞概率和运行成本方面的性能。我们使用具有代表性的拓扑和Amazon Web Services提供的真实数据，评估了所提出的方法和其他参考算法在各种网络场景下的性能。主要结论是，与其他算法相比，基于MCTS算法的方法可以更好地协调两个层的资源分配，从而减少请求阻塞，降低成本，同时考虑到生存性要求。
{"title":"Monte Carlo Tree Search for Cross-Stratum Optimization of Survivable Inter-Data Center Elastic Optical Network","authors":"Michal Aibin, K. Walkowiak","doi":"10.1109/RNDM.2018.8489841","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489841","url":null,"abstract":"In last few years, cloud computing and other services based on data centers have evolved from an emerging technology to a recognized approach that is gaining broad acceptance and deployment. Therefore, there is a significant need to provide efficient and reliable operation of inter-data center networks based on optical technologies. In this article, we focus on cross stratum optimization of an inter-data center elastic optical network with additional survivability requirements. We propose a novel optimization approach that employs machine learning Monte Carlo Tree Search (MCTS) algorithm for simulation of future traffic to improve the performance of the network regarding blocking probability and operational cost. We evaluate the performance of the proposed method and other reference algorithms under various network scenarios, using representative topologies and real data provided by Amazon Web Services. The main conclusion is that the approach based on the MCTS algorithm enables better coordination of resource allocation in both strata, which results in lower blocking of requests and lower cost taking into account the survivability requirements, in comparison to other algorithms.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116306611","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489809
J. Marzo, E. Calle, Sergio G. Cosgaya, D. F. Rueda, Andreu Manosa
This paper deals with selecting the most relevant metrics with which to measure the robustness of a network. Although earlier efforts have also attempted to do this, there is still no consensus on how to define a single robustness metric. Instead, a large set of metrics regarding the structural, fragmentation, connectivity and centrality properties of a graph have been used. Here, we propose a novel methodology based on the Principal Component Analysis to calculate a single value Robustness* (R*). This is also a consistent way of analyzing how a network behaves under a severe removal of elements. Results show how to select the most relevant metrics for robustness and how to apply them in heterogeneous topologies.
{"title":"On Selecting the Relevant Metrics of Network Robustness","authors":"J. Marzo, E. Calle, Sergio G. Cosgaya, D. F. Rueda, Andreu Manosa","doi":"10.1109/RNDM.2018.8489809","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489809","url":null,"abstract":"This paper deals with selecting the most relevant metrics with which to measure the robustness of a network. Although earlier efforts have also attempted to do this, there is still no consensus on how to define a single robustness metric. Instead, a large set of metrics regarding the structural, fragmentation, connectivity and centrality properties of a graph have been used. Here, we propose a novel methodology based on the Principal Component Analysis to calculate a single value Robustness* (R*). This is also a consistent way of analyzing how a network behaves under a severe removal of elements. Results show how to select the most relevant metrics for robustness and how to apply them in heterogeneous topologies.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126263007","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489837
Emma Fitzgerald, M. Pióro, A. Tomaszewski
Adverse weather conditions can cause deterioration of wireless channels, leading to reduced link capacities. Unlike in other types of networks, in radio-based wireless mesh networks, the link capacities depend not only on the prevailing conditions, but also on interfering transmissions, as well as the transmission power and modulation and coding schemes used. This leads to increased difficulty in modelling and mitigating partial link failures, such as those caused by unfavourable weather. In this paper we present optimisation models for reconfiguration of routing and traffic demand volumes in wireless mesh networks, taking into account transmission power and modulation and coding schemes. We consider both a network planning application and online optimisation in response to failure states as they occur. We conduct a numerical study on a realistic network topology, showing the feasibility of our models for practical implementation.
{"title":"Protecting Wireless Mesh Networks Against Adverse Weather Conditions","authors":"Emma Fitzgerald, M. Pióro, A. Tomaszewski","doi":"10.1109/RNDM.2018.8489837","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489837","url":null,"abstract":"Adverse weather conditions can cause deterioration of wireless channels, leading to reduced link capacities. Unlike in other types of networks, in radio-based wireless mesh networks, the link capacities depend not only on the prevailing conditions, but also on interfering transmissions, as well as the transmission power and modulation and coding schemes used. This leads to increased difficulty in modelling and mitigating partial link failures, such as those caused by unfavourable weather. In this paper we present optimisation models for reconfiguration of routing and traffic demand volumes in wireless mesh networks, taking into account transmission power and modulation and coding schemes. We consider both a network planning application and online optimisation in response to failure states as they occur. We conduct a numerical study on a realistic network topology, showing the feasibility of our models for practical implementation.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805557","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489819
Andrés Castillo, Tetsuhei Nakashima-Paniagua, J. Doucette
The meta-mesh approach was previously proposed as an innovative method for improving the capacity efficiency of span restoration in sparse network topologies. The fundamental idea is to route lightpaths that fully transit chains of degree-2 nodes onto logical bypass spans that physically traverse the chain, but which are allowed to fail back to the anchor nodes or degree-3 nodes of the chain. From the transiting lightpath perspective, the effect is an increase in network connectivity from which a decrease in required spare capacity is allowed. Prior work on the meta-mesh approach considered only single span failure restorability. The work herein addresses the issue of dual-failure survivability by developing an ILP design model that produces a minimum-cost meta-mesh network design that is fully restorable in the event of all possible dual span failures scenarios.
{"title":"Dual-Failure Restorability of Meta-Mesh Networks","authors":"Andrés Castillo, Tetsuhei Nakashima-Paniagua, J. Doucette","doi":"10.1109/RNDM.2018.8489819","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489819","url":null,"abstract":"The meta-mesh approach was previously proposed as an innovative method for improving the capacity efficiency of span restoration in sparse network topologies. The fundamental idea is to route lightpaths that fully transit chains of degree-2 nodes onto logical bypass spans that physically traverse the chain, but which are allowed to fail back to the anchor nodes or degree-3 nodes of the chain. From the transiting lightpath perspective, the effect is an increase in network connectivity from which a decrease in required spare capacity is allowed. Prior work on the meta-mesh approach considered only single span failure restorability. The work herein addresses the issue of dual-failure survivability by developing an ILP design model that produces a minimum-cost meta-mesh network design that is fully restorable in the event of all possible dual span failures scenarios.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103102","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}
Pub Date : 2018-08-01DOI: 10.1109/RNDM.2018.8489835
M. Pióro, I. Kalesnikau, M. Poss, D. Nace, A. Tomaszewski
Flow thinning (FT) is a traffic protection mechanism for communication networks with variable link capacities, for example wireless networks. With FT, end-to-end traffic demands are equipped with dedicated logical tunnels, for example MPLS tunnels, whose nominal capacity is subject to thinning in order to follow the fluctuations of link capacities availability. Moreover, instantaneous traffic of each demand is throttled at its originating node accordingly to the current total capacity available on the demand’s dedicated tunnels. In effect, the network is always capable of carrying the admitted traffic. In this paper we deal with an efficient, implementable version of FT, referred to as AFT (affine flow thinning). By deriving appropriate cutting-plane and path-generation algorithms, we show how real-life network dimensioning problems for AFT can be efficiently treated using a proper characterization of the network link availability states. Results of a numerical study illustrate tractability of the cost minimization problems, and assess cost efficiency of AFT in comparison with other protection mechanisms.
{"title":"Practical aspects of Flow Thinning optimization","authors":"M. Pióro, I. Kalesnikau, M. Poss, D. Nace, A. Tomaszewski","doi":"10.1109/RNDM.2018.8489835","DOIUrl":"https://doi.org/10.1109/RNDM.2018.8489835","url":null,"abstract":"Flow thinning (FT) is a traffic protection mechanism for communication networks with variable link capacities, for example wireless networks. With FT, end-to-end traffic demands are equipped with dedicated logical tunnels, for example MPLS tunnels, whose nominal capacity is subject to thinning in order to follow the fluctuations of link capacities availability. Moreover, instantaneous traffic of each demand is throttled at its originating node accordingly to the current total capacity available on the demand’s dedicated tunnels. In effect, the network is always capable of carrying the admitted traffic. In this paper we deal with an efficient, implementable version of FT, referred to as AFT (affine flow thinning). By deriving appropriate cutting-plane and path-generation algorithms, we show how real-life network dimensioning problems for AFT can be efficiently treated using a proper characterization of the network link availability states. Results of a numerical study illustrate tractability of the cost minimization problems, and assess cost efficiency of AFT in comparison with other protection mechanisms.","PeriodicalId":340686,"journal":{"name":"2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129500959","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：