2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)最新文献

筛选
英文 中文
Critical services in the cloud: Understanding security and resilience risks 云中的关键服务:了解安全性和弹性风险
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI: 10.1109/RNDM.2014.7014942
Thom Hecht, Paul Smith, Marcus Scholler
{"title":"Critical services in the cloud: Understanding security and resilience risks","authors":"Thom Hecht, Paul Smith, Marcus Scholler","doi":"10.1109/RNDM.2014.7014942","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014942","url":null,"abstract":"The promise of low costs, adaptation to customer load, and fast service roll-out has made cloud infrastructures a primary choice for many service providers. So far, this has been largely for end-user and enterprise services. Recently, the cloud paradigm is being considered by service providers of critical infrastructures. A prominent example of this is ETSI's Industry Specification Group (ISG) on Network Function Virtualization, which provides guidelines on how to move telecommunications services to the cloud. But other critical infrastructure providers are following closely. Common characteristics of critical infrastructure services, such as network functions, are their high requirements for service dependability and security. In this paper, we present a risk assessment method for assessing the risks of moving critical infrastructure services to the cloud. To achieve this, we have extended a well-established information security risk assessment process and developed an extensive cloud-specific fault and challenge catalogue.","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":"131016664","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}
引用次数: 6
Diameter constrained reliability: Complexity and distinguished topologies 直径约束可靠性:复杂性和区分拓扑
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI: 10.1109/RNDM.2014.7014935
E. Canale, H. Cancela, F. Robledo, P. Romero, Pablo Sartor
{"title":"Diameter constrained reliability: Complexity and distinguished topologies","authors":"E. Canale, H. Cancela, F. Robledo, P. Romero, Pablo Sartor","doi":"10.1109/RNDM.2014.7014935","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014935","url":null,"abstract":"Let G = (V,E) be a simple graph with |V| = n nodes and |E| = m links, a subset K ⊆ V of terminals, a vector p = (p<sub>1</sub>, ..., p<sub>m</sub>) ∈ [0, 1]<sup>m</sup> and a positive integer d, called diameter. We assume nodes are perfect but links fail stochastically and independently, with probabilities q<sub>i</sub> = 1 - p<sub>i</sub>. The diameter-constrained reliability (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by d links, or less. This number is denoted by R<sub>K,G</sub><sup>d</sup>(p).","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"41 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":"117126535","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
Network coding for survivable multicast video streaming networks 可生存多播视频流网络的网络编码
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI: 10.1109/RNDM.2014.7014943
C. Bentz, S. Elloumi, É. Gourdin, Thibaut Lefebvre
{"title":"Network coding for survivable multicast video streaming networks","authors":"C. Bentz, S. Elloumi, É. Gourdin, Thibaut Lefebvre","doi":"10.1109/RNDM.2014.7014943","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014943","url":null,"abstract":"To ensure the robust delivery of video streams, a network must emit additional data that will replace the missing ones in case of a failure of some server. One key issue is then to keep this so-called redundancy as low as possible while still ensuring some quality of service. In this paper, we provide protection-oriented models to compute the minimum level of redundancy ensuring that every customer still receives its required stream whatever failure scenario occurs. In particular, our models allow us to compare the optimal redundancy in the multicast delivery of video streams with and without the use of network coding, a technique that allows to perform coding operations within the network. Our computational experiments show that the use of network coding helps to reduce the redundancy in many realistic network settings.","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":"130177378","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
Pre-configured polyhedron (p-Poly) with optimal protection efficiency for dual-link failure in optical mesh networks 光网状网络中具有最佳双链路故障保护效率的预配置多面体(p-Poly)
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-11-01 DOI: 10.1109/RNDM.2014.7014926
Chen Ma, Jie Zhang, Yongli Zhao, Xin Li, Jian Yuan, Zilian Jin, Shanguo Huang, W. Gu
{"title":"Pre-configured polyhedron (p-Poly) with optimal protection efficiency for dual-link failure in optical mesh networks","authors":"Chen Ma, Jie Zhang, Yongli Zhao, Xin Li, Jian Yuan, Zilian Jin, Shanguo Huang, W. Gu","doi":"10.1109/RNDM.2014.7014926","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014926","url":null,"abstract":"With the expansion of optical networks, the failure probability of dual-link failure has also improved, so it is urgent to find novel protection structures to deal with dual-link failure. In this paper, we mainly focus the protection structures to solve the problem. Firstly, we describe the scenarios and the problem of dual-link failure. Then, theory of pre-configured polyhedron (p-Poly) is introduced as the basis of structures with an efficient integer linear programming (ILP) construction model and two resources allocation schemes. Based on p-Poly, a novel structure named pre-configured ball (p-Ball) is introduced with an ILP construction model and a heuristic fast routing algorithm. Links on structure and in rings are used to evaluate the protection efficiency of structures. Simulation results show that, p-Ball has better performance than baseline structures (pre-configured prism) in protection efficiency, and it is quite close to the optimal p-Poly structure. The trend of p-Poly is finding novel structures with minimum links on structure and maximum links in rings.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"71 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":"114944983","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}
引用次数: 5
Epidemic and cascading survivability of complex networks 复杂网络的流行病和级联生存能力
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-05-02 DOI: 10.1109/RNDM.2014.7014950
M. Manzano, E. Calle, J. Ripoll, A. M. Fagertun, Victor Torres-Padrosa, S. Pahwa, C. Scoglio
{"title":"Epidemic and cascading survivability of complex networks","authors":"M. Manzano, E. Calle, J. Ripoll, A. M. Fagertun, Victor Torres-Padrosa, S. Pahwa, C. Scoglio","doi":"10.1109/RNDM.2014.7014950","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014950","url":null,"abstract":"Our society nowadays is governed by complex networks, examples being the power grids, telecommunication networks, biological networks, and social networks. It has become of paramount importance to understand and characterize the dynamic events (e.g. failures) that might happen in these complex networks. For this reason, in this paper, we propose two measures to evaluate the vulnerability of complex networks in two different dynamic multiple failure scenarios: epidemic-like and cascading failures. Firstly, we present epidemic survivability (ES), a new network measure that describes the vulnerability of each node of a network under a specific epidemic intensity. Secondly, we propose cascading survivability (CS), which characterizes how potentially injurious a node is according to a cascading failure scenario. Then, we show that by using the distribution of values obtained from ES and CS it is possible to describe the vulnerability of a given network. We consider a set of 17 different complex networks to illustrate the suitability of our proposals. Lastly, results reveal that distinct types of complex networks might react differently under the same multiple failure scenario.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124093941","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}
引用次数: 5
An algorithm for computing all-terminal reliability bounds 一种计算全终端可靠性边界的算法
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-01-19 DOI: 10.1109/RNDM.2014.7014934
Jaime Silva, Teresa Gomes, D. Tipper, Lúcia Martins, Velin Kounev
{"title":"An algorithm for computing all-terminal reliability bounds","authors":"Jaime Silva, Teresa Gomes, D. Tipper, Lúcia Martins, Velin Kounev","doi":"10.1109/RNDM.2014.7014934","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014934","url":null,"abstract":"The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths.","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-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129431622","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
SRLG failure localization using nested M-trails 使用嵌套M-trails进行SRLG故障定位
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-01-19 DOI: 10.1109/RNDM.2014.7014933
M. L. Ali, P. Ho, János Tapolcai
{"title":"SRLG failure localization using nested M-trails","authors":"M. L. Ali, P. Ho, János Tapolcai","doi":"10.1109/RNDM.2014.7014933","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014933","url":null,"abstract":"This paper introduces a novel technique called nested m-trail method in all-optical mesh networks for failure localization of any shared risk link group (SRLG) with up to d undirected links. The proposed method decomposes each network topology that is at least d-connected into virtual cycles and trails, in which sets of m-trails that traverse through a common monitoring node (MN) can be obtained. The nested m-trails are used in the monitoring burst (m-burst) framework, in which the MN can localize any SRLG failure by inspecting the optical bursts traversing through it. An integer linear program (ILP) and a heuristic are proposed for the network decomposition, which are further verified by numerical experiments. We show that the proposed method significantly reduces the required fault localization latency compared to the existing methods.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133955586","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}
引用次数: 2
Threshold configuration of emergency trunk reservation considering traffic intensity for accepting more general telephone calls 考虑业务强度以接受更多一般电话呼叫的紧急中继预留阈值配置
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-01-19 DOI: 10.1109/RNDM.2014.7014947
K. Tanabe, S. Miyata, K. Baba, K. Yamaoka
{"title":"Threshold configuration of emergency trunk reservation considering traffic intensity for accepting more general telephone calls","authors":"K. Tanabe, S. Miyata, K. Baba, K. Yamaoka","doi":"10.1109/RNDM.2014.7014947","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014947","url":null,"abstract":"We propose a threshold configuration and holding time limitation for general telephone calls under trunk reservation control in emergency situations. Our proposed method aims to accept more general calls while required emergency calls are still accepted. With our method, the threshold is configured in consideration of the ratio of traffic intensities which are estimated in advance. Computer simulation with a queueing system model of a telephone exchange showed that the general call-blocking rate was much lower than that without threshold relaxation or trunk reservation, while the emergency call-blocking rate was reduced to almost zero unless the sum of estimated traffic intensity was nearly equal to the number of lines. Moreover, we confirmed that the threshold was appropriately configured by using the proposed method, from the comparison between the result of the proposed method and that obtained by using the fixed value of a threshold.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133338792","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}
引用次数: 2
Region based fault-tolerant distributed file storage system design under budget constraint 预算约束下基于区域的容错分布式文件存储系统设计
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2014-01-19 DOI: 10.1109/RNDM.2014.7014932
Anisha Mazumder, Arun Das, Chenyang Zhou, Arunabha Sen
{"title":"Region based fault-tolerant distributed file storage system design under budget constraint","authors":"Anisha Mazumder, Arun Das, Chenyang Zhou, Arunabha Sen","doi":"10.1109/RNDM.2014.7014932","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014932","url":null,"abstract":"Two independent lines of research, (i) erasure code based file storage system design, and (ii) fault-tolerant network design for spatially correlated (or region-based) failures, have received considerable attention in the networking research community in recent times. A recently proposed (N,K)-coding based distributed file storage scheme ensures complete reconstruction of a file after network fragmentation due to any single region-based fault. For every region of the network, it stores K distinct file segments in one of the largest connected component that results from the fragmentation of the network due to the failure of a region. This distribution scheme provides an all-region fault-tolerant storage system, in the sense that no matter which region of the network fails, a largest connected component of the fragmented network will still have enough distinct file segments with which to reconstruct the file. However, the storage requirement and the associated cost for such an all-region-fault-tolerant storage system may be quite high. As such, with a limited budget it may not be possible to realize such an all-region fault-tolerant storage system. We consider a budget constrained distributed file system design problem and provide solutions that maximizes the number of regions that can be made fault-tolerant, within the specified budget. We show that the problem is NP-complete, and provide an approximation algorithm for the problem. The performance of the approximation algorithm is evaluated through simulation on two real networks. The simulation results demonstrate that the worst case experimental performance is significantly better than the worst case theoretical bound. Moreover, the approximation algorithm almost always produce near optimal solution in a fraction of time needed to find the optimal solution.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116872586","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}
引用次数: 7
Design of robust dependent networks against flow-based cascading failures 针对基于流的级联故障的鲁棒相关网络设计
2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 1900-01-01 DOI: 10.1109/RNDM.2014.7014931
T. Ouboter, D. Worm, R. Kooij, Huijuan Wang
{"title":"Design of robust dependent networks against flow-based cascading failures","authors":"T. Ouboter, D. Worm, R. Kooij, Huijuan Wang","doi":"10.1109/RNDM.2014.7014931","DOIUrl":"https://doi.org/10.1109/RNDM.2014.7014931","url":null,"abstract":"In this paper we propose strategies to increase the robustness of a communication network which depends on the proper functioning of an electricity network. The strategies involve selecting nodes of the communication network and removing their dependency on the electricity network. Compared to existing literature on this topic, such as Schneider et al. [1], we use a more realistic model of the electricity network by taking the essential characteristics of the power flow into account, instead of considering purely the topological structure. The effect of the flow-based cascading failures originating from the electrical grid, on the communication network is studied, where the coupling between those networks plays an important role. We have computed the performance of our proposed selection strategies by averaging over many configurations of communication networks, which are modelled both as scale-free networks and as Erdös-Rényi random graphs, applied to an electricity network formed by the IEEE 118 bus test system. We show that a hybrid strategy, based on the degree of the communication nodes and the failure probabilities of the electricity nodes, give a significant improvement over a random selection strategy, as well as over other strategies we proposed. Our method is also tested on a real-world interdependent network: the high voltage electricity grid in Italy coupled with a communication network, inspired by the Italy blackout in 2003.","PeriodicalId":299072,"journal":{"name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133554299","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信