2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)最新文献_第4页

Robust plans for spectrum allocation in elastic flexgrid optical networks 弹性柔性网格光网络中频谱分配的鲁棒方案

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608275

Christina Büsing, A. Koster, M. Tieves

引用次数: 1

Factorization theory in diameter constrained reliability 直径约束可靠性的因式分解理论

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608269

E. Canale, P. Romero, G. Rubino

{"title":"Factorization theory in diameter constrained reliability","authors":"E. Canale, P. Romero, G. Rubino","doi":"10.1109/RNDM.2016.7608269","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608269","url":null,"abstract":"In classical network reliability, the system under study is a network with perfect nodes and imperfect links that fail randomly and independently. The typical problem in the area is to find the probability that the resulting random graph is connected( or more generally, that a given subset K of nodes belong to the same connected component), called reliability. Although (and because) the exact reliability computation belongs to the class of NP-Hard problems, the literature offers many methods for this purpose, given the importance of the models. This paper deals with diameter-constrained reliability, a similar metric defined in 2001, inspired by delay-sensitive applications in telecommunications, where terminals are required to be connected by d hops or less, for a given positive integer d called diameter. Factorization theory is one of the fundamental tools of classical network reliability, and today it is a mature area. However, its extension to the diameter-constrained context requires at least the recognition of irrelevant links, which is an open problem. In this paper, irrelevant links are efficiently determined in the most basic and, by far, used case, the source-terminal one, where |K| = 2, thus providing a first step towards a Factorization theory in diameter constrained reliability. We also discuss the metric value in some special graphs, and we propose a specific Factoring algorithm. The paper is closed with a discussion of trends for future work.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131678155","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}

引用次数: 4

ILP-based heuristic method for the multi-period survivable network augmentation problem 基于ilp的多周期可生存网络增强问题的启发式方法

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608268

Yali Wang, J. Doucette

引用次数: 0

Network graph transformation providing fast calculation of paths for resilient routing 网络图变换为弹性路由提供了快速的路径计算

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608293

K. Myslitski, J. Rak, L. Kuszner

{"title":"Network graph transformation providing fast calculation of paths for resilient routing","authors":"K. Myslitski, J. Rak, L. Kuszner","doi":"10.1109/RNDM.2016.7608293","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608293","url":null,"abstract":"Protection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandari's scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint paths in advance to be able to start serving the demands once they have arrived. In particular, since the issue of establishing a set of node-disjoint paths is equivalent to the problem of determining the cheapest cycle in the network topology traversing the demand end nodes, we propose a generalization of this scheme assuming that any pair of node-disjoint paths can be obtained by means of merging a number of basic cycles defined for a network topology. The main contribution of this paper is the BCMP method of cheapest end-to-end cycles formation based on basic cycles, which, as verified for real network topologies, reduces up to 70% the time needed to establish node-disjoint paths in comparison with results obtained for the reference Bhandari's scheme.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114652670","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

Reliable Virtual Machine placement in distributed clouds 在分布式云中可靠的虚拟机放置

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608297

Song Yang, P. Wieder, R. Yahyapour

{"title":"Reliable Virtual Machine placement in distributed clouds","authors":"Song Yang, P. Wieder, R. Yahyapour","doi":"10.1109/RNDM.2016.7608297","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608297","url":null,"abstract":"In nowadays cloud computing systems, leveraging the virtualization technology, the customer's requested data computing or storing service is accommodated by a set of mutual-communicated Virtual Machines (VM) in a scalable and elastic manner. These VMs are placed in one or more datacenter nodes according to nodes' capacities, failure probabilities, etc. The VM placement availability refers to the probability that at least one set of the whole customer's requested VMs operates during the entire requested lifetime. The placed VMs should obey the agreed-upon availability, otherwise the cloud provider may face revenue loss. In this paper, we study the problem of placing at most H sets of k requested VMs on minimum number of datacenter nodes, such that the VM placement availability requirement is satisfied and each VM pair has a communication delay no greater than the specified. We prove that this problem is NP-hard. We subsequently propose an exact Integer Nonlinear Program (INLP) and an efficient heuristic to solve this problem. Finally, we conduct simulations to compare the proposed algorithms with two existing heuristics in terms of acceptance ratio, average number of used nodes and running time.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"75 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133406317","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}

引用次数: 13

Delay constrained offloading for Mobile Edge Computing in cloud-enabled vehicular networks 云车辆网络中移动边缘计算的延迟约束卸载

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608300

Ke Zhang, Y. Mao, S. Leng, A. Vinel, Yan Zhang

引用次数: 105

Techno-economic analysis of a software-defined optical media contribution and distribution network 软件定义光媒体贡献与分配网络的技术经济分析

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608276

Bram Naudts, M. V. D. Wee, Lucian Andries, S. Verbrugge, D. Colle

{"title":"Techno-economic analysis of a software-defined optical media contribution and distribution network","authors":"Bram Naudts, M. V. D. Wee, Lucian Andries, S. Verbrugge, D. Colle","doi":"10.1109/RNDM.2016.7608276","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608276","url":null,"abstract":"Bringing video images from camera to screen is a complex production process involving several intermediate steps and actors. The media sector is characterized by a high need for fast and reliable data transport, between production locations, post-production facilities, broadcasters and back-up locations. The growing size of video files and the stringent network requirements for live production have given rise to a combination of transport solutions including physical transport of raw materials, transport of proxies via best-effort Internet Protocol (IP) networks and transport of live video streams via Serial Digital Interface (SDI) over microwave, satellite, leased lines or optical fiber. Due to this fast-paced evolution, media companies face high investments costs for upgrading both end devices (e.g. cameras) and network transport infrastructure. As such, the cost of maintaining and upgrading a multitude of transport networks can be prohibitive. The MECaNO project [1] proposes a lossless packet switching technology developed that can guarantee delivery deadlines in order to create a single, lossless, IP-based production system which is realized by leveraging technological advances such as the decreasing cost of optical technology and the flow-based software-defined networking (SDN) architecture. Apart from explaining the MECaNO solution, the goal of this paper is to quantify the economic impact of the proposed technological solution. The results show that the cost for the optical infrastructure (L1) remains relatively stable while the cost for L2-L3 technologies drops significantly leading to a total cost reduction of 27%.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114491627","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

An efficient heuristic for calculating a protected path with specified nodes 一种有效的启发式算法，用于计算具有指定节点的受保护路径

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608281

Lúcia Martins, Teresa Gomes, D. Tipper

{"title":"An efficient heuristic for calculating a protected path with specified nodes","authors":"Lúcia Martins, Teresa Gomes, D. Tipper","doi":"10.1109/RNDM.2016.7608281","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608281","url":null,"abstract":"The problem of determining a path between two nodes in a network that must visit specific intermediate nodes arises in a number of contexts. For example, one might require traffic to visit nodes where it can be monitored by deep packet inspection for security reasons. In this paper a new recursive heuristic is proposed for finding the shortest loopless path, from a source node to a target node, that visits a specified set of nodes in a network. In order to provide survivability to failures along the path, the proposed heuristic is modified to ensure that the calculated path can be protected by a node-disjoint backup path. The performance of the heuristic, calculating a path with and without protection, is evaluated by comparing with an integer linear programming (ILP) formulation for each of the considered problems. The ILP solver may fail to obtain a solution in a reasonable amount of time, especially in large networks, which justifies the need for effective, computationally efficient heuristics for solving these problems. Our numerical results are also compared with previous heuristics in the literature.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133710331","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

Managing software failures and capacity assignment to control interval availability in PONs 管理软件故障和容量分配，以控制pon的间隔可用性

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608274

Alvaro Fernández, N. Stol

{"title":"Managing software failures and capacity assignment to control interval availability in PONs","authors":"Alvaro Fernández, N. Stol","doi":"10.1109/RNDM.2016.7608274","DOIUrl":"https://doi.org/10.1109/RNDM.2016.7608274","url":null,"abstract":"Dependability in Time Division Multiplexed Passive Optical Networks (TDM PONs) is becoming crucial as end-users not only expect access networks to provide high bandwidth, but also to be dependable. While hardware failures in steady state assumptions have been extensively studied, little can be found regarding software failures in literature. Hence, it is the aim of this paper to study software failures in TDM PONs, as well as how to manage the PON available capacity to gain control over the interval availability of a client. Based on empirical data, failures of the Optical Line Terminal (OLT) software in TDM PONs are characterized, including their impact on PONs available capacity. Then, a fault-tolerance mechanism, protecting against both OLT hardware and software failures, is proposed, as well as a dependability-aware capacity assignment scheme. Both mechanisms are analyzed by means of Markov models, solved through simulations. These mechanisms not only improve the interval availability of PON clients with respect to an unprotected case, but also reduce its variability. Besides, the capacity assignment scheme reveals to be self-regulating, and can be used either as a fairness method regarding dependability, or to implement differentiated dependability in PONs by efficiently using the PON available capacity.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"520 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116266021","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

On the complexity of routing and spectrum allocation in survivable elastic optical network with unicast and anycast traffic 单播和任播弹性光网络中路由和频谱分配的复杂性研究

2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM) Pub Date : 2016-09-01 DOI: 10.1109/RNDM.2016.7608283

Róża Goścień, K. Walkowiak, M. Klinkowski

引用次数: 3