2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)最新文献_第3页

Dimensioning backbone networks for multi-site data centers: Exploiting anycast routing for resilience 对多站点数据中心的骨干网络进行量纲化:利用任意播路由实现弹性

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7324306

Chris Develder, B. Jaumard

{"title":"Dimensioning backbone networks for multi-site data centers: Exploiting anycast routing for resilience","authors":"Chris Develder, B. Jaumard","doi":"10.1109/RNDM.2015.7324306","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324306","url":null,"abstract":"In the current era of big data, applications increasingly rely on powerful computing infrastructure residing in large data centers (DCs), often adopting cloud computing technology. Clearly, this necessitates efficient and resilient networking infrastructure to connect the users of these applications with the data centers hosting them. In this paper, we focus on backbone network infrastructure on large geographical scales (i.e., the so-called wide area networks), which typically adopts optical network technology. In particular, we study the problem of dimensioning such backbone networks: what bandwidth should each of the links provide for the traffic, originating at known sources, to reach the data centers? And possibly even: how many such DCs should we deploy, and at what locations? More concretely, we summarize our recent work that essentially addresses the following fundamental research questions: (1) Does the anycast routing strategy influence the amount of required network resources? (2) Can we exploit anycast routing for resilience purposes, i.e., relocate to a different DC under failure conditions, to reduce resource capacity requirements? (3) Is it advantageous to change anycast request destinations from one DC location to the other, from one time period to the next, if service requests vary over time?","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124015061","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

Robust cooperative monitoring problem 鲁棒协同监控问题

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325228

D. Papadimitriou, B. Fortz

引用次数: 2

An ant colony approach to regenerator placement with fault tolerance in optical networks 光网络容错再生器安置的蚁群方法

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325213

M. Morgan

{"title":"An ant colony approach to regenerator placement with fault tolerance in optical networks","authors":"M. Morgan","doi":"10.1109/RNDM.2015.7325213","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325213","url":null,"abstract":"This paper introduces an ant colony optimisation algorithm for the optimal placement of regenerators in optical networks. The algorithm guarantees survivability of the underlying network whilst also minimising the number of regenerators required. These are vital requirements in optical networks as the cost of regeneration equipment is very high. However, minimisation of the number of regenerator sites must be achieved whilst maintaining alternative lightpaths in the event of equipment failure. The latter constraint is one which does not appear to have been adequately addressed by research literature to date. Weaknesses in other published formulations of this problem are analysed and shown not to guarantee fault tolerance in all circumstances or to be too restrictive in establishing the existence of alternative paths. Following this, a new model is introduced in the form of a minimum k-connected k-dominating set problem with shared risk resource groups. A greedy algorithm is then introduced and modified into an ant colony optimisation approach. The two algorithms are tested against one another and the ant colony heuristic is seen to produce superior results with reasonable runtimes.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129154146","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

Protected shortest path visiting specified nodes 访问指定节点的受保护最短路径

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325218

Teresa Gomes, Sofia Marques, Lúcia Martins, M. Pascoal, D. Tipper

{"title":"Protected shortest path visiting specified nodes","authors":"Teresa Gomes, Sofia Marques, Lúcia Martins, M. Pascoal, D. Tipper","doi":"10.1109/RNDM.2015.7325218","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325218","url":null,"abstract":"In this paper heuristics are proposed for finding the shortest loopless path, from a source node to a target node, that visits a given set of nodes in a directed graph, such that it can be protected using a node-disjoint path. This type of problem may arise due to network management constraints. The problem of calculating the shortest path that visits a given set of nodes is at least as difficult as the traveling salesman problem, and it has not received much attention. Nevertheless an efficient integer linear programming (ILP) formulation has been recently proposed for this problem. Here, the ILP formulation is adapted to include the constraint that the obtained path will be able to be protected by a node-disjoint path. Computational experiments show that this approach, namely in large networks, may fail to obtain a solution in a reasonable amount of time. Therefore three versions of a heuristic are proposed, for which extensive computational results show that they are able to find a solution in most cases, and that the calculated solutions present an acceptable relative error regarding the cost of the optimal active path. Further the CPU time required by the heuristics is significantly smaller than the required by the used ILP solver.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125968189","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

Constructions for unambiguous node failure localization in grid topologies 网格拓扑中明确节点故障定位的构造

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325233

László Gyimóthi, É. Hosszu, János Tapolcai

引用次数: 0

Resilient access via 3D hand-over 通过3D移交的弹性访问

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325223

Á. Ladányi, T. Cinkler

引用次数: 1

Virtual traffic lights: Managing intersections in the cloud 虚拟交通灯:管理云中的十字路口

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325248

Wolfgang Münst, C. Dannheim, Markus Mäder, Nicolas Gay, B. Malnar, Moinul Al-Mamun, Christian Icking

引用次数: 18

Achieving dependability in software-defined networking — A perspective 在软件定义的网络中实现可靠性——一个视角

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7324310

P. Heegaard, B. Helvik, V. Mendiratta

引用次数: 19

Efficient distribution of static or slowly changing configuration parameters in VANETs 在VANETs中有效地分配静态或缓慢变化的配置参数

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7325244

Sebastian Bittl

引用次数: 0

Comparison of different data center location policies in survivable elastic optical networks 弹性光网络中不同数据中心选址策略的比较

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM) Pub Date : 2015-11-12 DOI: 10.1109/RNDM.2015.7324308

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

{"title":"Comparison of different data center location policies in survivable elastic optical networks","authors":"Róża Goścień, K. Walkowiak","doi":"10.1109/RNDM.2015.7324308","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324308","url":null,"abstract":"In this paper, we focus on the important problem of locating data centers (DCs) in elastic optical network (EON). We propose to use both topology-based (that follow directly from the network graph structure) and demographic-economical (characteristics of the cities that correspond to network nodes) data to define DC location policies. In particular, we define 7 different DC location polices, which can be classified as topology-based, demographic-economical, and hybrid (use both groups of information). The policies are applied to determine location of DCs for two realistic network topologies. Next, we solve routing and spectrum allocation (RSA) problem in EON protected by a dedicated path protection (DPP) with realistic traffic demands generated with respect to demographic-economical model. The obtained results are analyzed in order to compare different DC location policies according to the spectrum usage and possibility to improve network survivability in case of a random large-scale disaster. The results of our investigation prove, that DC location policy has a crucial influence on the network performance (in terms of the spectrum usage and survivability provisioning), especially when the number of available DCs is relatively small. What is more, according to the results topology-based DC location policies significantly outperform demographic-economical methods in terms of both performance metrics.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255113","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