Pub Date : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949103
Róża Goścień
In this paper we focus on the efficient dynamic routing in spectrally-spatially flexible optical networks (SS-FON). To this end, we propose novel adaptive spectral-spatial allocation (ASSA) algorithm supported by high load spectral-spatial allocation (HLSSA) mechanism. The main principle of the ASSA/HLSSA is to allow for demand allocation using spectral-spatial channels only in the case of high network load while prioritizing channels using lowest possible number of spatial modes. Then, we evaluate efficiency of the proposed approach by means of extensive numerical experiments. The results show its high efficiency especially for sets of relatively big demands and in a survivable network (in that case protected by dedicated path protection). According to the experiments, the methods allow to reduce bandwidth blocking probability up to 5.5% comparing to the allocation without their application.
{"title":"On the Efficient Dynamic Routing in Spectrally-Spatially Flexible Optical Networks","authors":"Róża Goścień","doi":"10.1109/RNDM48015.2019.8949103","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949103","url":null,"abstract":"In this paper we focus on the efficient dynamic routing in spectrally-spatially flexible optical networks (SS-FON). To this end, we propose novel adaptive spectral-spatial allocation (ASSA) algorithm supported by high load spectral-spatial allocation (HLSSA) mechanism. The main principle of the ASSA/HLSSA is to allow for demand allocation using spectral-spatial channels only in the case of high network load while prioritizing channels using lowest possible number of spatial modes. Then, we evaluate efficiency of the proposed approach by means of extensive numerical experiments. The results show its high efficiency especially for sets of relatively big demands and in a survivable network (in that case protected by dedicated path protection). According to the experiments, the methods allow to reduce bandwidth blocking probability up to 5.5% comparing to the allocation without their application.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114080544","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949126
A. Modarresi, J. Symons
The Internet of Things (IoT) has changed the shape of edge networks by adding various technologies to support a wide range of services from interactive and high-bit-rate to battery-operated, long-range and low-bit-rate services. While the diversity of heterogeneous technologies can be exploited to increase network resilience, a proper model is required to understand, design, and analyse the relationship between these technologies and the overall smart environment. In this paper, we propose a formal multidimensional multilayer model to describe the Internet and IoT topology from functional, geographic, and technology-level perspectives. This model is intended to capture the complexity of the smart-home and smart-city environments attached to the Internet through diverse access technologies including emerging 5G mobile networks. We analyse the resilience of diverse network technologies for smart homes using our technology interdependence graph.
{"title":"Modeling Technological Interdependency in IoT - A Multidimensional and Multilayer Network Model for Smart Environments","authors":"A. Modarresi, J. Symons","doi":"10.1109/RNDM48015.2019.8949126","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949126","url":null,"abstract":"The Internet of Things (IoT) has changed the shape of edge networks by adding various technologies to support a wide range of services from interactive and high-bit-rate to battery-operated, long-range and low-bit-rate services. While the diversity of heterogeneous technologies can be exploited to increase network resilience, a proper model is required to understand, design, and analyse the relationship between these technologies and the overall smart environment. In this paper, we propose a formal multidimensional multilayer model to describe the Internet and IoT topology from functional, geographic, and technology-level perspectives. This model is intended to capture the complexity of the smart-home and smart-city environments attached to the Internet through diverse access technologies including emerging 5G mobile networks. We analyse the resilience of diverse network technologies for smart homes using our technology interdependence graph.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662085","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949163
M. Sayıt, Erdem Karayer, Chi-Dung Phung, Stefano Secci, S. Boumerdassi
In order to sustain the connectivity in case of a technology related disaster, providing multipath connection infrastructure can be an alternative. Multipath TCP (MPTCP) is a transport layer protocol which allows more than one path to transfer TCP segments by utilizing multi-homed devices. MPTCP can be used for minimizing the connectivity problems in case of a failure. It is known that the performance of MPTCP can be increased if the paths for the subflows are carefully chosen by considering the disjointness and end-to-end delay of the paths. On the other hand, the scheduler affects the performance of MPTCP especially when connectivity problems exist. In this paper, we investigate the performances of different MPTCP schedulers and show how the selection of the paths for MPTCP subflows affect communication performance in case of link failures.
{"title":"Numerical evaluation of MPTCP schedulers in terms of throughput and reliability","authors":"M. Sayıt, Erdem Karayer, Chi-Dung Phung, Stefano Secci, S. Boumerdassi","doi":"10.1109/RNDM48015.2019.8949163","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949163","url":null,"abstract":"In order to sustain the connectivity in case of a technology related disaster, providing multipath connection infrastructure can be an alternative. Multipath TCP (MPTCP) is a transport layer protocol which allows more than one path to transfer TCP segments by utilizing multi-homed devices. MPTCP can be used for minimizing the connectivity problems in case of a failure. It is known that the performance of MPTCP can be increased if the paths for the subflows are carefully chosen by considering the disjointness and end-to-end delay of the paths. On the other hand, the scheduler affects the performance of MPTCP especially when connectivity problems exist. In this paper, we investigate the performances of different MPTCP schedulers and show how the selection of the paths for MPTCP subflows affect communication performance in case of link failures.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129738230","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949109
Dorabella Santos, Teresa Gomes
In SDN networks, the problem of how many controllers and where to place them, has been extensively studied. This is known as the controller placement problem, and has been addressed mainly considering the delays between the SDN switches and controllers. Although the delays between switches and controllers and the intercontroller delays are key aspects, a less addressed issue is the availability of the control paths (the routing paths between the switches and their controllers). In this paper, the problem regarding controller placements with QoS requirements, both in terms of delays and availability of the control paths, is addressed. To guarantee the availability requirements, a set of links is selected to have upgraded availability. An exact method and a heuristic method are proposed for solving the problem. Computational results show that the heuristic method provides near-optimal solutions within reasonable runtimes, when the exact method becomes computationally expensive.
{"title":"Controller Placement and Availability Link Upgrade Problem in SDN Networks","authors":"Dorabella Santos, Teresa Gomes","doi":"10.1109/RNDM48015.2019.8949109","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949109","url":null,"abstract":"In SDN networks, the problem of how many controllers and where to place them, has been extensively studied. This is known as the controller placement problem, and has been addressed mainly considering the delays between the SDN switches and controllers. Although the delays between switches and controllers and the intercontroller delays are key aspects, a less addressed issue is the availability of the control paths (the routing paths between the switches and their controllers). In this paper, the problem regarding controller placements with QoS requirements, both in terms of delays and availability of the control paths, is addressed. To guarantee the availability requirements, a set of links is selected to have upgraded availability. An exact method and a heuristic method are proposed for solving the problem. Computational results show that the heuristic method provides near-optimal solutions within reasonable runtimes, when the exact method becomes computationally expensive.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133804305","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949099
C. Risso, C. Mayr, E. Grampín
The Internet is a collection of interconnected Autonomous Systems (ASes) that use the Border Gateway Protocol (BGP) to exchange reachability information. The design of an optimal BGP overlay for an AS is a known NP-Hard problem this team tackled previously for IP networks, i.e, for the best effort paradigm. However, most Internet providers implement their backbones by combining IP routing with MPLS (Multipro- tocol Label Switching) for QoS-aware traffic forwarding. MPLS forwarding incorporates traffic engineering and more efficient failover mechanisms. The present work introduces a coordinated design of both IP/MPLS substrates. Our contribution is on proposing an optimal and yet resilient topology design for an IP/MPLS Internet backbone, which takes advantage of traffic engineering features to optimize the demands, maintaining the aforementioned iBGP overlay optimality.
{"title":"A Combined BGP and IP/MPLS Resilient Transit Backbone Design","authors":"C. Risso, C. Mayr, E. Grampín","doi":"10.1109/RNDM48015.2019.8949099","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949099","url":null,"abstract":"The Internet is a collection of interconnected Autonomous Systems (ASes) that use the Border Gateway Protocol (BGP) to exchange reachability information. The design of an optimal BGP overlay for an AS is a known NP-Hard problem this team tackled previously for IP networks, i.e, for the best effort paradigm. However, most Internet providers implement their backbones by combining IP routing with MPLS (Multipro- tocol Label Switching) for QoS-aware traffic forwarding. MPLS forwarding incorporates traffic engineering and more efficient failover mechanisms. The present work introduces a coordinated design of both IP/MPLS substrates. Our contribution is on proposing an optimal and yet resilient topology design for an IP/MPLS Internet backbone, which takes advantage of traffic engineering features to optimize the demands, maintaining the aforementioned iBGP overlay optimality.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123498917","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949086
A. Sousa, J. Piccini, F. Robledo, P. Romero
For a given graph and a positive number k, the goal of the Critical Node Detection Problem (CNDP) is to find the set of $k$ nodes, named critical nodes, whose removal minimize the connectivity between the surviving nodes. The CNDP has been extensively studied in the literature and is gaining special attention in the vulnerability evaluation of telecommunication networks. More recently, a worst-case analysis of an epidemic model was introduced, where a disease is spread among a given population. The goal is to find a set of nodes to be immunized that minimize the number of dead-nodes as a result. This extremal analysis is captured by a combinatorial optimization problem, called Graph Fragmentation Problem (GFP). In this paper, we show that the CNDP and the GFP are identical combinatorial problems, in the sense that the globally optimal solution is identical under the same instances. As corollary, we conclude universal inapproximability results for the CNDP.
{"title":"An Interplay between Critical Node Detection and Epidemic Models","authors":"A. Sousa, J. Piccini, F. Robledo, P. Romero","doi":"10.1109/RNDM48015.2019.8949086","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949086","url":null,"abstract":"For a given graph and a positive number k, the goal of the Critical Node Detection Problem (CNDP) is to find the set of $k$ nodes, named critical nodes, whose removal minimize the connectivity between the surviving nodes. The CNDP has been extensively studied in the literature and is gaining special attention in the vulnerability evaluation of telecommunication networks. More recently, a worst-case analysis of an epidemic model was introduced, where a disease is spread among a given population. The goal is to find a set of nodes to be immunized that minimize the number of dead-nodes as a result. This extremal analysis is captured by a combinatorial optimization problem, called Graph Fragmentation Problem (GFP). In this paper, we show that the CNDP and the GFP are identical combinatorial problems, in the sense that the globally optimal solution is identical under the same instances. As corollary, we conclude universal inapproximability results for the CNDP.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134235557","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949127
T. Bauschert, Varun S. Reddy
We consider the task of provisioning a generic network slice request on a given physical substrate network infrastructure-a problem that arises in the context of next generation networks-under traffic uncertainty, with the objective of minimising the capital and operational expenditures incurred to accommodate the network slice. As the resulting formulation can be hard to tackle using commercial MIP solvers even for problem instances of moderate size, we devise a hybrid biased-random key genetic algorithm to solve the robust network slice design problem. Finally, we present a performance evaluation of the proposed solution methodologies using realistic datasets from SNDlib [1].
{"title":"Hybrid Bio-Inspired Heuristics for the Robust Network Slice Design Problem","authors":"T. Bauschert, Varun S. Reddy","doi":"10.1109/RNDM48015.2019.8949127","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949127","url":null,"abstract":"We consider the task of provisioning a generic network slice request on a given physical substrate network infrastructure-a problem that arises in the context of next generation networks-under traffic uncertainty, with the objective of minimising the capital and operational expenditures incurred to accommodate the network slice. As the resulting formulation can be hard to tackle using commercial MIP solvers even for problem instances of moderate size, we devise a hybrid biased-random key genetic algorithm to solve the robust network slice design problem. Finally, we present a performance evaluation of the proposed solution methodologies using realistic datasets from SNDlib [1].","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"2484 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131156488","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949141
Fábio Barbosa, A. Sousa, A. Agra, K. Walkowiak, Róża Goścień
An Elastic Optical Network (EON) provides a lot of flexibility on the way an optical network supports the demands of multiple services. This flexibility is given by the Routing, Modulation and Spectrum Assignment (RMSA) algorithm whose primary goal is to use the spectrum resources of the network in an efficient way. Recently, large-scale failures are becoming a concern and one source of such failures is malicious human activities. In terrorist attacks, although node shutdowns are harder to realize than link cuts, they are the most rewarding in the attackers' perspective since the shutdown of one node also shuts down all its connected links. In order to obtain a RMSA algorithm resilient to multiple node failures, we propose the use of a path disaster availability metric which measures the probability of each path not being affected by a multiple node failure. We present computational results considering a mix of unicast and anycast services in 3 well-known topologies. We assess the trade-off between spectrum usage efficiency and resilience to multiple node failures of our proposal against other previous known algorithms. The results show that the RMSA decision is always better when the disaster path availability metric is used. Moreover, the best way to use the path disaster availability metric in the RMSA decision depends on the traffic load of the EON.
{"title":"A RMSA Algorithm Resilient to Multiple Node Failures on Elastic Optical Networks","authors":"Fábio Barbosa, A. Sousa, A. Agra, K. Walkowiak, Róża Goścień","doi":"10.1109/RNDM48015.2019.8949141","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949141","url":null,"abstract":"An Elastic Optical Network (EON) provides a lot of flexibility on the way an optical network supports the demands of multiple services. This flexibility is given by the Routing, Modulation and Spectrum Assignment (RMSA) algorithm whose primary goal is to use the spectrum resources of the network in an efficient way. Recently, large-scale failures are becoming a concern and one source of such failures is malicious human activities. In terrorist attacks, although node shutdowns are harder to realize than link cuts, they are the most rewarding in the attackers' perspective since the shutdown of one node also shuts down all its connected links. In order to obtain a RMSA algorithm resilient to multiple node failures, we propose the use of a path disaster availability metric which measures the probability of each path not being affected by a multiple node failure. We present computational results considering a mix of unicast and anycast services in 3 well-known topologies. We assess the trade-off between spectrum usage efficiency and resilience to multiple node failures of our proposal against other previous known algorithms. The results show that the RMSA decision is always better when the disaster path availability metric is used. Moreover, the best way to use the path disaster availability metric in the RMSA decision depends on the traffic load of the EON.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122966524","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949142
Alija Pašić, Rita Girão-Silva, Bálazs Vass, Teresa Gomes, Ferenc Mogyorósi, P. Babarczi, János Tapolcai
In this paper, we present a framework for disaster resilience, called FRADIR-II, which improves the performance of its previous counterpart. In the novel framework, two different failure models are jointly considered: independent random failures and regional failures that may be used to model the effect of disasters. First, we design an infrastructure against random failures, termed as the spine, which guarantees a certain availability to the working paths. Second, in order to prepare this infrastructure against disasters, we introduce a probabilistic regional failure model, where a modified Euclidean distance of an edge to the epicenter of a disaster is used. The proposed function jointly takes into account the physical length of the edges and their availability, so that a higher/lower availability is reflected in a higher/lower distance from the epicenter. This novel availability-aware disaster failure model generates a failure list which is deemed to be more realistic than previous approaches. Next, a heuristic for link upgrade attempting at the reduction of the likelihood of regional failures disconnecting the network is proposed. Finally, a generalized dedicated protection algorithm is used to route the connection requests, providing protection against the obtained failure list. The experimental results show that FRADIR-II is able to provide disaster resilience even in critical infrastructures.
{"title":"FRADIR-II: An Improved Framework for Disaster Resilience","authors":"Alija Pašić, Rita Girão-Silva, Bálazs Vass, Teresa Gomes, Ferenc Mogyorósi, P. Babarczi, János Tapolcai","doi":"10.1109/RNDM48015.2019.8949142","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949142","url":null,"abstract":"In this paper, we present a framework for disaster resilience, called FRADIR-II, which improves the performance of its previous counterpart. In the novel framework, two different failure models are jointly considered: independent random failures and regional failures that may be used to model the effect of disasters. First, we design an infrastructure against random failures, termed as the spine, which guarantees a certain availability to the working paths. Second, in order to prepare this infrastructure against disasters, we introduce a probabilistic regional failure model, where a modified Euclidean distance of an edge to the epicenter of a disaster is used. The proposed function jointly takes into account the physical length of the edges and their availability, so that a higher/lower availability is reflected in a higher/lower distance from the epicenter. This novel availability-aware disaster failure model generates a failure list which is deemed to be more realistic than previous approaches. Next, a heuristic for link upgrade attempting at the reduction of the likelihood of regional failures disconnecting the network is proposed. Finally, a generalized dedicated protection algorithm is used to route the connection requests, providing protection against the obtained failure list. The experimental results show that FRADIR-II is able to provide disaster resilience even in critical infrastructures.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122207090","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 : 2019-10-01DOI: 10.1109/RNDM48015.2019.8949090
C. Christodoulou, G. Ellinas
This work proposes a resilient wheel-based optical access network architecture for backhauling network traffic. This proposed resilient architecture can efficiently support not only the fixed users but also the mobile users in the downstream direction under normal and failure scenarios, while minimizing the average traffic delivery time and without using extra redundant fibers for protection purposes.
{"title":"Resilient Wheel-Based Optical Access Network Architecture","authors":"C. Christodoulou, G. Ellinas","doi":"10.1109/RNDM48015.2019.8949090","DOIUrl":"https://doi.org/10.1109/RNDM48015.2019.8949090","url":null,"abstract":"This work proposes a resilient wheel-based optical access network architecture for backhauling network traffic. This proposed resilient architecture can efficiently support not only the fixed users but also the mobile users in the downstream direction under normal and failure scenarios, while minimizing the average traffic delivery time and without using extra redundant fibers for protection purposes.","PeriodicalId":120852,"journal":{"name":"2019 11th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115671884","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
扫码关注我们
求助内容：
应助结果提醒方式：