2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020最新文献_第3页

Design of Most-Reliable Cubic Networks by Augmentations 最可靠三次网络的增广设计

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570611164

E. Canale, G. Rela, F. Robledo, P. Romero, Luis Stábile

引用次数: 1

Multiple-criteria Evaluation of Disaster Recovery Strategies Based on Stochastic Models 基于随机模型的多准则容灾策略评价

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570614925

Júlio Mendonça, R. Lima, E. Andrade, Julian Araujo, Dong Seong Kim

{"title":"Multiple-criteria Evaluation of Disaster Recovery Strategies Based on Stochastic Models","authors":"Júlio Mendonça, R. Lima, E. Andrade, Julian Araujo, Dong Seong Kim","doi":"10.1109/DRCN48652.2020.1570614925","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570614925","url":null,"abstract":"The consequences for a company losing its data or having its IT system disrupted are severe and can impact negatively on business operations. It can also cause customer dissatisfaction and subsequent revenue loss. In a competitive global market, companies have been adopting disaster recovery (DR) strategies as an attempt to keep IT systems operational, prevent data loss, and ensure business continuity. However, there is not a single DR strategy that meets the requirements of every business (e.g., availability and cost). Besides, most of the time, these requirements are conflicting. Therefore, efficient and accurate analysis of DR strategies before its deployment is crucial to choose the best strategy that suits companies’ needs and budget. In this paper, we propose the adoption of a multiple-criteria decision-making (MCDM) method and stochastic models to evaluate and rank DR strategies for IT infrastructures. The stochastic models are used for quantitative assessing distinct DR strategies regarding five DR key-metrics: availability, downtime, Recovery Time Objective (RTO), and Recovery Point Objective (RPO), and cost. We also use an MCDM method to rank the strategies according to multiple criteria (e.g., availability maximization and costs minimization). A case study demonstrates the feasibility and usefulness of the proposed approach for finding the best DR strategies according to multiple criteria.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128810184","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}

引用次数: 3

Formal Modeling and Analysis of Multi-Rogue Backoff Manipulation Attacks in Unlicensed Networks 非授权网络中多流氓退避操纵攻击的形式化建模与分析

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570610618

Jordi Navarrette, S. Shankar, Xiaojie Zhang, S. Debroy

{"title":"Formal Modeling and Analysis of Multi-Rogue Backoff Manipulation Attacks in Unlicensed Networks","authors":"Jordi Navarrette, S. Shankar, Xiaojie Zhang, S. Debroy","doi":"10.1109/DRCN48652.2020.1570610618","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570610618","url":null,"abstract":"Security vulnerabilities that are unique to unlicensed (secondary) networks have been well studied in literature. However, the nature and impact of traditional wireless network threats, such as backoff manipulation when applied to secondary networks, require further investigation in particular for multiple rogue station scenarios. In this paper, we perform modeling and analysis of multi-rogue backoff manipulation attack strategies in secondary wireless networks using the PRISM probabilistic model checker. Our secondary network implementation in PRISM includes scenarios where: a) sub-band (channel) occupancy by licensed (primary) nodes follows an ON-OFF model with parameters derived from real measurement data and b) the secondary network consists of up to three rogue secondary stations out of eight total with all following CSMA/CA like contention process for channel access. Unlike honest secondary stations, the rogues carry out a backoff-manipulation strategy of selecting a backoff timer that deviates from the backoff-selection process mandated by the secondary network. Unlike simulation based analysis, our analysis using PRISM model checker considers all possible combinations of system parameters and proves that for any set of primary ONOFF parameters and for any density of rogues in the network, a fixed backoff selection (instead of random) maximizes the channel access probability of a particular rogue irrespective of other rogues’ selection strategy. The results from this work will help generate deeper understanding of medium access threat landscape of secondary networks and foster design of more resilient access control strategies.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"250 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752068","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}

引用次数: 1

Availability-Guaranteed Service Function Chain Provisioning with Optional Shared Backups 提供可用性保证的业务功能链，提供可选的共享备份

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570611128

I. M. Araújo, C. Natalino, Hao Chen, M. D. Andrade, D. Cardoso, P. Monti

{"title":"Availability-Guaranteed Service Function Chain Provisioning with Optional Shared Backups","authors":"I. M. Araújo, C. Natalino, Hao Chen, M. D. Andrade, D. Cardoso, P. Monti","doi":"10.1109/DRCN48652.2020.1570611128","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570611128","url":null,"abstract":"The dynamic provisioning of Service Function Chain (SFC) using Virtual Network Functions (VNFs) is a challenging problem, especially for availability-constrained services. The provisioning of backup resources is often used to ensure that availability requirements are fulfilled. However, the assignment of backup resources should be carefully designed to avoid resource inefficiencies as much as possible.This paper proposes the Optional Backup with Shared Path and Shared Function (OBSPSF) strategy, which aims at improving resource efficiency while fulfilling the availability requirements of SFC requests. The strategy uses optional backup provisioning to ensure that backup resources are assigned only when strictly needed (i.e., when the SFC alone does not meet the availability constraint). Moreover, OBSPSF encourages backup sharing (among both connectivity and backup VNFs) to reduce the backup resource overhead. Results show that the strategy can accommodate orders-of-magnitude more services than benchmark heuristics from the literature.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491167","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}

引用次数: 8

DRCN 2020 Welcome DRCN 2020欢迎

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/drcn48652.2020.9089337

引用次数: 0

End-to-End Quantum Key Distribution (QKD) from Metro to Access Networks 从城域网到接入网的端到端量子密钥分发(QKD)

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570611062

Hua Wang, Yongli Zhao, A. Nag, Xiaosong Yu, Xinyi He, Jie Zhang

{"title":"End-to-End Quantum Key Distribution (QKD) from Metro to Access Networks","authors":"Hua Wang, Yongli Zhao, A. Nag, Xiaosong Yu, Xinyi He, Jie Zhang","doi":"10.1109/DRCN48652.2020.1570611062","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570611062","url":null,"abstract":"Derived from quantum cryptography, quantum key distribution (QKD) can deliver secret keys between two users to secure communication under a certain scale. Nowadays, QKD integrated in backbone, metro, and access areas has been respectively studied and tested around the world. Although the experiments in various scenarios can verify the feasibility of QKD, the situation of QKD between two end users from metro to access networks has not been considered up to now. In this paper, we propose a QKD Network (QKDN) architecture for end-to-end QKD from metro to access networks in a costefficient manner. The cost efficiency can be achieved by sharing Quantum Receivers (Qrecs) in the metro network with the Quantum Transmitters (Qtras) in various access networks since the distance between any two end users within a metro network permits to distribute quantum keys. Under such an architecture, an end-to-end QKD scheme is designed to provide secret keys for end users in different access networks, by mapping Qrecs and allocating time slots according to security requests. Through the end-to-end QKD scheme, the occupation of Qrecs and time slots can be appropriately improved. To verify the effectiveness of the scheme, simulation is conducted on two different topologies respectively. Performances are evaluated in terms of three parameters: i) the failure ratio of end-to-end QKD (FQ), ii) the utilization ratio of time slots (TU), and iii) the utilization ratio of Qrecs (QU). Simulation results show that the topology with more nodes will lower the QU by distributing requests to more numbers of Qrecs. Moreover, the topology with bigger node connectivity can lower FQ since a shorter path will be selected to save the unnecessary occupation of link resources for other end-to-end requests.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"42 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131646429","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}

引用次数: 3

FRADIR Meets Availability fradr满足可用性

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570603965

L. Pasic, Azra Pasic, Ferenc Mogyorósi, Alija Pašić

引用次数: 5

DRCN 2020 Technical Program Committee DRCN 2020技术计划委员会

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/drcn48652.2020.9089382

引用次数: 0

Structural Dependency Aware Service Chain Mapping for Network Function Virtualization 面向网络功能虚拟化的结构依赖感知服务链映射

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570611214

Arunabha Sen, Sandipan Choudhuri, K. Basu

{"title":"Structural Dependency Aware Service Chain Mapping for Network Function Virtualization","authors":"Arunabha Sen, Sandipan Choudhuri, K. Basu","doi":"10.1109/DRCN48652.2020.1570611214","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570611214","url":null,"abstract":"Network Function Virtualization (NFV) has emerged as an attractive technology solution to improve the efficiency and flexibility of network services through a technique called Service Chain mapping. A Network Service may be composed of several components (sub-services) and a subset of the physical network nodes may be able to provide each of the individual sub-services. The goal of the Service Chain Mapping problem is to select a physical network node to get the individual sub-services executed and making sure that results from execution of one sub-service flows smoothly to the physical node selected for execution of the next sub-service. Recently, there is increasing awareness in the research community that there exists significant dependency between network nodes. In order to seamlessly deal with failures, provisions are made for redundant services (and sub-services). However, unless the Service Chain mapping is carried out carefully, both the primary and the backup service providers may be unavailable due to the failure of one single physical node. Even if the backup service provider is available, the increased delay to access the backup node may be unacceptably high. Recognizing the importance of structural dependency, researchers have recently started studying dependency-aware Service Chain mapping. In this paper, we draw attention to some of the shortcomings of a recently proposed metric for measuring structural dependency. In addition, we introduce a notion of utility of a path for data transfer from a source node u to a destination node v, to provide a dynamic programming based algorithm for mapping a service chain on a physical network which ensures that the loss of utility due to failure of physical network nodes is minimized.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131023343","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}

引用次数: 1

Virtual Network Embedding Satisfying Resiliency of Cooperative Services 满足协同服务弹性的虚拟网络嵌入

2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020 Pub Date : 2020-03-01 DOI: 10.1109/DRCN48652.2020.1570602981

N. Ogino, T. Kitahara

{"title":"Virtual Network Embedding Satisfying Resiliency of Cooperative Services","authors":"N. Ogino, T. Kitahara","doi":"10.1109/DRCN48652.2020.1570602981","DOIUrl":"https://doi.org/10.1109/DRCN48652.2020.1570602981","url":null,"abstract":"Various smart services are provided on multiple virtual networks embedded into a common inter-cloud substrate network. Service providers can enhance their smart services in cooperation with other service providers. They specify multiple cooperating virtual nodes with a function that allows cooperation when they request VNE (Virtual Network Embedding). The substrate network operator prepares multiple shared substrate nodes to assist cooperation securely and maps each cooperating virtual node to one of the multiple shared substrate nodes. Even if one of the shared substrate nodes incurs damage, the resiliency of the cooperative services is ensured due to reallocation of the workload and backup of the service data for the cooperative services to the remaining normal shared substrate nodes. However, the uninterrupted connectivity of the virtual networks must be guaranteed after a shared substrate node failure has occurred. This paper formulates the resilient cooperative VNE problem that involves the above connectivity constraints and proposes a lightweight VNE method to solve the problem efficiently. Simulation results reveal that the proposed method can obtain a desirable VNE solution through just a few iterations of solving the mathematical models with a limited scale.","PeriodicalId":334421,"journal":{"name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131497920","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}

引用次数: 0