2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)最新文献

On the design of Resilient IP Overlays 弹性IP覆盖层的设计

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816147

Máté Nagy, János Tapolcai, G. Rétvári

引用次数: 1

Network coding-based protection scheme for Elastic Optical Networks 基于网络编码的弹性光网络保护方案

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816136

W. Ramírez, X. Masip-Bruin, M. Yannuzzi, D. Montero, Anny Martínez, V. López

{"title":"Network coding-based protection scheme for Elastic Optical Networks","authors":"W. Ramírez, X. Masip-Bruin, M. Yannuzzi, D. Montero, Anny Martínez, V. López","doi":"10.1109/DRCN.2014.6816136","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816136","url":null,"abstract":"Optical technologies are the foundations supporting the current telecommunication network backbones due to the high speed transmissions achieved in fiber optical networks. Traditional optical networks consist of a fixed 50 GHz grid, resulting in a low optical spectrum (OS) utilization, specifically with transmission rates above 100 Gbps. This issue is magnified when network resilience capabilities are required. For instance, proactive protection solutions such as Dedicated Protection (DP) are widely used because of their low recovery time. However, a significant drawback of DP is its high utilization of optical bandwidth. Recently, optical networks are undergoing significant changes with the purpose of providing a flexible grid that can fully exploit the potential of optical networks. This has led to a new network paradigm termed as Elastic Optical Networks (EON). Moreover, a novel strategy referred to as network coding (NC) has been proposed with the aim of improving network throughput. In this paper, we propose a proactive protection scheme so-called E-DPNC* that combines both the advantages concerning network throughput offered by EON and NC, and the low recovery time of a DP scheme, in order to enable network resilience against optical link failures while also reducing the optical spectrum utilization. Our evaluation results show that our solution reduces the OS utilization by 41% compared with conventional protection schemes deployed on fixed grid scenarios.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125835908","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}

引用次数: 15

Availability analysis of resilient geometric routing on Internet topology Internet拓扑下弹性几何路由的可用性分析

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816153

Sahel Sahhaf, W. Tavernier, D. Colle, M. Pickavet, P. Demeester

{"title":"Availability analysis of resilient geometric routing on Internet topology","authors":"Sahel Sahhaf, W. Tavernier, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/DRCN.2014.6816153","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816153","url":null,"abstract":"Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching. In this scheme, network nodes are assigned virtual coordinates and packets are forwarded towards their intended destination following a distance-decreasing policy. Dynamics in the network such as node/link failures might affect this forwarding and lead packets to a dead end. We proposed recovery techniques in geometric routing to deliver packets to the destination in case of failures. In this paper, we perform an analysis on the availability of the proposed protection techniques on the Internet graph. The routing scheme over optical transport network is considered and the reliability data of physical components and a known network availability model are used. This evaluation is compared with the shortest cycle scheme which finds two node disjoint paths between every source and destination in the topology and also with geometric routing with no protection. The results show that the proposed scheme performs reasonably well compared to the shortest cycle scheme and significantly enhances the availability compared to geometric routing without any protection.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200527","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

Optimised heuristics for a geodiverse routing protocol 地理多样性路由协议的优化启发式算法

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816133

Yufei Cheng, M. T. Gardner, Junyan Li, Rebecca May, D. Medhi, J. Sterbenz

引用次数: 30

Energy & reliability optimal MAC for WSNs 无线传感器网络的能量和可靠性最优MAC

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816150

E. O’Connell, B. O’flynn, D. Boyle

引用次数: 8

Joint anycast and unicast routing and spectrum allocation with dedicated path protection in Elastic Optical Networks 弹性光网络中带专用路径保护的任播和单播联合路由和频谱分配

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816137

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

{"title":"Joint anycast and unicast routing and spectrum allocation with dedicated path protection in Elastic Optical Networks","authors":"Róża Goścień, K. Walkowiak, M. Klinkowski","doi":"10.1109/DRCN.2014.6816137","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816137","url":null,"abstract":"Elastic Optical Networks (EONs) are considered as a very promising approach for effective bandwidth allocation in optical networks. Concurrently, anycast (one-to-one-of-many transmission technique) is gaining more and more interest in contemporary Internet due to its connection with as popular services as Content Delivery Networks, video streaming, computing grids. Moreover, the Internet and other communication networks are an indispensable part of the present and future world, and the consequences of network failures can become critical, especially when related to backbone networks. Therefore, the survivability aspects are increasingly important when analyzing existing and designing new networks. In this paper, we focus on joint optimization of anycast and unicast flows in EONs with survivability consideration. In particular, we formulate Routing and Spectrum Allocation problem with Dedicated Path Protection consideration (RSA-JAU-DPP) as an Integer Linear Programming (ILP) problem and propose a heuristic algorithm AFA-JAU-DPP to solve it. We evaluate the performance of our algorithm and compare it with both optimal results obtained by CPLEX and results obtained with heuristic methods proposed in the literature. Numerical results show that proposed heuristic algorithm outperforms other reference methods.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"360 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122764563","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}

引用次数: 28

Using Multi-Topology Routing to improve routing during geographically correlated failures 利用多拓扑路由改进地理相关故障时的路由

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816134

M. T. Gardner, Rebecca May, C. Beard, D. Medhi

{"title":"Using Multi-Topology Routing to improve routing during geographically correlated failures","authors":"M. T. Gardner, Rebecca May, C. Beard, D. Medhi","doi":"10.1109/DRCN.2014.6816134","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816134","url":null,"abstract":"During large geographic events in networks, the routing churn that occurs has been shown to cause significant impacts in routing stabilization following the event. This work proposes a set of algorithms that is based on Multi-Topology Routing (MTR) for pre-planning for geographically correlated failures. Thus, in the event of a failure, our approach, Geographic MTR, switches to virtual topologies that reduce the impact of routing changes that can result in dropped connections until a new link state and shortest path trees can be established. We propose two algorithms to generate virtual topologies, Geographic Coverage MTR (gcMTR) and Geographic Targeted MTR (gtMTR). The first method, gcMTR, is to create virtual topologies taking a network wide coverage approach, while gtMTR is a targeted approach that can be used in anticipation of a specific event where knowledge of that event exists. A third algorithm proposed in this work specifies a way to detect a geographic event and select a topology to use. We evaluated our approach on two network topologies and observed that the number of connections that are dropped during a geographic event can be reduced significantly, thereby reducing the impact to the non-affected part of the network.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122836881","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}

引用次数: 17

Optimal resource allocation for survivable virtual infrastructures 可生存的虚拟基础设施的最优资源分配

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816146

Gustavo Cavalcanti, R. Obelheiro, G. Koslovski

{"title":"Optimal resource allocation for survivable virtual infrastructures","authors":"Gustavo Cavalcanti, R. Obelheiro, G. Koslovski","doi":"10.1109/DRCN.2014.6816146","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816146","url":null,"abstract":"Virtual infrastructures (VIs) consolidated the dynamic provisioning of computing and communication resources. A VI is a set of virtual machines interconnected by virtual links and switches/routers. Infrastructure providers (InPs) manage the physical substrates in which virtual resources requested by VIs (such as CPU, disk, memory, bandwidth) are reserved and allocated. Resource allocation is a complex problem that needs to satisfy different goals: users expect to run their applications on survivable VIs, while InPs aim to maximize profits, minimize costs and reduce substrate fragmentation. However, there is a dichotomy between minimizing substrate fragmentation, by co-locating VIs, and maximizing VI survivability, by sparsely allocating resources in order to decrease the impact of substrate failures. In this context, this paper discusses VI survivability and its impact on substrate fragmentation. We propose a mixed integer linear programming model to allocate resources considering the joint coordination of fragmentation and survivability. Experimental results suggest that it is possible to enhance VI survivability without significantly impacting substrate fragmentation.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128135334","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}

引用次数: 10

Route leak identification: A step toward making inter-domain routing more reliable 路由泄漏识别:使域间路由更可靠的一个步骤

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816139

M. S. Siddiqui, D. Montero, M. Yannuzzi, R. Serral-Gracià, X. Masip-Bruin

{"title":"Route leak identification: A step toward making inter-domain routing more reliable","authors":"M. S. Siddiqui, D. Montero, M. Yannuzzi, R. Serral-Gracià, X. Masip-Bruin","doi":"10.1109/DRCN.2014.6816139","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816139","url":null,"abstract":"Route leaks are one of the anomalies of inter-domain routing that have the capacity to produce large Internet service disruptions. Route leaks are caused because of violation of routing policies among Autonomous Systems. Unfortunately, there are not many studies that formally and thoroughly analyze the route leak problem. There exist few conventional solutions that can be used as a first line of defense, such as route filters. However, these palliatives become unfeasible in terms of scalability, mainly due to the administrative overhead and cost of maintaining the filters updated. As a result, a significant part of the Internet is defenseless against route leak attacks. In this paper, we define, describe, and examine the different types of route leaks that threaten the security and reliability of the routing system. Our main contributions can be summarized as follows. We develop a rather basic theoretical framework, which, under realistic assumptions, enables a domain to autonomously determine if a particular route advertisement received corresponds to a route leak. We reason the possible occurrence of route leaks in different scenarios, with the aim of formulating requirements for their identification, and hence thereof prevention to improve routing reliability.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134146719","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}

引用次数: 10

Network design for tolerating multiple link failures using Fast Re-route (FRR) 基于快速重路由(FRR)的多链路容错网络设计

2014 10th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2014-04-01 DOI: 10.1109/DRCN.2014.6816140

R. Sinha, Funda Ergun, K. Oikonomou, K. Ramakrishnan

{"title":"Network design for tolerating multiple link failures using Fast Re-route (FRR)","authors":"R. Sinha, Funda Ergun, K. Oikonomou, K. Ramakrishnan","doi":"10.1109/DRCN.2014.6816140","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816140","url":null,"abstract":"In this paper we present techniques and protocols for protecting a network against multiple link failures. The existing link-based restoration with MPLS Fast Re-route (FRR) is fast, but can create congestion by overloading edges, which is undesirable since many applications are sensitive to congestion-related packet loss. The problem is exacerbated with multiple link failures, frequent enough to be of concern in production networks. In this paper we investigate enhancements to FRR restoration in the presence of multiple failures through network and protocol design. We describe several network designs that add a small number of edges to an existing topology, intended for use by backup paths. For each design, we describe a protocol (that piggybacks on OSPF) for distributing state information and a distributed algorithm for reconfiguring backup paths, after each failure, based on the state information. We prove that for any k, our design, associated protocol, and distributed backup path reconfiguration scheme can handle k arbitrary link failures without causing disconnection or congestion. Through a series of constructions, our final network design is nearly optimal with respect to the number of additional edges in the topology. We believe that these network designs are the first to have such provable guarantees for failures of arbitrary multiplicity.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122652284","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}

引用次数: 19