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

{"title":"Optimal regenerator placement in survivable translucent networks","authors":"Quazi Rahman, Y. Aneja, S. Bandyopadhyay, A. Jaekel","doi":"10.1109/DRCN.2014.6816144","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816144","url":null,"abstract":"In optical networks, the optical reach is defined as the distance an optical signal can travel, before its quality degrades to a level that requires 3R-regeneration. In a translucent optical network, if an optical signal has to be communicated over a distance that exceeds the optical reach, the signal is regenerated at selected nodes of the network, so that the signal quality never degrades to an unacceptable level. Given a value of the optical reach, the goal of the Regenerator Placement Problem (RPP) in dynamic Physical Impairment aware Route and Wavelength Assignment (PI-RWA), for survivable translucent networks, is to identify the minimum number of nodes capable of 3R regeneration, so that every pair of nodes (u, v) can establish a lightpath (either transparent or translucent) from u to v. In a survivable network, even if any fault occurs, it must be guaranteed that every pair of surviving nodes (u, v) can still establish a lightpath (either transparent or translucent) from u to v, avoiding all faulty nodes/edges. In this paper we have presented a Integer Linear Program (ILP) formulation that can optimally solve the survivable RPP problem for practical-sized networks within a reasonable amount of time. We have used a branch-and-cut approach to implement our algorithm, where we have intercepted the optimization process with control callbacks from the CPLEX callable library to introduce new constraints, as needed.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"6 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":"127492023","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}

{"title":"Preventive start-time optimization against network failure","authors":"E. Oki","doi":"10.1109/DRCN.2014.6816138","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816138","url":null,"abstract":"This paper reviews research on preventive start-time optimization (PSO). PSO determines a suitable set of link weights in an open shortest path network at the network operation start time that can handle any link failure scenario preventively. PSO minimizes the worst-case congestion ratio in case of failure. PSO can avoid both unexpected network congestion and network instability. We formulate the original PSO problem as a mixed integer liner programming problem by extending the starttime optimization model and describe heuristic approaches. We also introduce mathematical programming models for the PSO variations. In addition, we expand PSO into generalized preventive start-time optimization (GPSO) to find a link weight set that balances both congestion ratios under no failure and the worst-case failure.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"22 6S 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":"115943955","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}

{"title":"Path layout planning and software based fast failure detection in survivable OpenFlow networks","authors":"Steven S. W. Lee, Kuang-Yi Li, Kwan-Yee Chan, Guan-Hao Lai, Yao-Chuan Chung","doi":"10.1109/DRCN.2014.6816141","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816141","url":null,"abstract":"In an OpenFlow network, the controller is responsible to control and manage the whole network. Although such central control paradigm is easier to achieve efficient network resources usage, the controller becomes the bottleneck when the network size is large. In this paper, we propose using pre-provisioned paths to mitigate the burden on a controller. The basic idea is to setup some background paths in the network. When an ordinary flow coming into the network, the controller only needs to setups flow entries at the ingress and egress switches. An admitted flow follows a preplanned path toward its destination. Except the ingress and egress switches, the flow entries in the remaining switches on the path kept unchanged. Since routing paths for ordinary flows are pre-planned, the whole admission and connection setup process are simplified. Jointly considering load balancing, network survivability, fast failure recovery, and flow entry consumption are the major challenges in this problem. The contribution of this paper includes two parts. First, we propose a path preplanning scheme that takes advantage of interface specific forwarding (ISF) to resolve the problem. We formulate the path preplanning problem as an integer linear programming problem. Optimization based heuristic algorithms are proposed to obtain a near optimal solution. In the second contribution, we propose a software based failure detection and failure location identification scheme. Since some existing switches take longer time to detect a network failure, a reliable lightweight software based failure detection scheme that can fast pinpoint the failure location is needed. We have performed simulations and experiments to evaluate the performance of the proposed schemes. The experimental results indicate that the proposed software failure detection scheme generates very limited overhead on the OpenFlow controller. It can be used to achieve fast failure recovery even when the network is in heavy load state. The simulation results also show that the proposed ISF based path preplanning scheme can reduce controller load and is able to achieve 100% survivability against any single link failure with low bandwidth consumption.","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":"116779250","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}

{"title":"An enhanced ILP design model for node-encircling p-cycle networks","authors":"A. Kasem, Roberto Gallardo, J. Doucette","doi":"10.1109/DRCN.2014.6816143","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816143","url":null,"abstract":"We develop a new enhanced ILP design model that optimally designs a node-encircling p-cycle network. The new model takes advantage of the observation that NEPCs assigned solely for node-failure protection will inherently protect all two-hop segments of every multi-hop working lightpath. As a result, only single-hop working lightpaths need explicit span-failure protection in the conventional manner. The new ILP shows a significant reduction in capacity requirements.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"303 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":"123453528","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}

{"title":"Protecting PONs: A failure impact, availability and cost perspective based on a geometric model","authors":"Alvaro Fernández, N. Stol","doi":"10.1109/DRCN.2014.6816148","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816148","url":null,"abstract":"Passive Optical Networks (PONs) are regarded as the preferred technology for broadband access networks. PONs provide high capacity and low-power consumption at a low-cost deployment. Besides, the dependability of PONs is becoming more important as end-users also expect access networks to be highly reliable. Operators, on the other hand, are more concerned about reducing the number of clients affected by failures (i.e. failure impact) while keeping the costs at reasonable values. This paper identifies the best suited protection schemes for PONs, and gives a deep insight into how the access network layout and design decisions affect the performance of these schemes. To achieve this goal, the PON deployment area is described by means of a network geometric model. Then, different protection mechanisms are deployed following this model and evaluated in terms of failure impact, availability and cost. In this manner, the performance of the protection schemes is assessed, taking into account the effects of the network layout on these three parameters. Moreover, the trade-offs between failure impact, availability and cost caused by design decisions are also pinpointed.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"43 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":"123196099","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}

{"title":"Reliable delivery route computation for threshold secret shared content","authors":"N. Ogino, H. Yokota","doi":"10.1109/DRCN.2014.6816151","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816151","url":null,"abstract":"A threshold secret sharing scheme can protect content by dividing it into many pieces and distributing them over different servers. This scheme can also be utilized for reliable delivery of the content. Thanks to this scheme, the receiver can still reconstruct the original content even if several pieces are lost on their delivery routes due to the occurrence of a multiple-link failure. This paper aims to obtain reliable delivery routes for the pieces, as this will minimize the probability that the receiver cannot reconstruct the original content. Although such a route optimization problem can be formulated using an ILP (Integer Linear Programming) model, optimum route computation based on the ILP model requires large amounts of computational resources. Thus, this paper proposes a lightweight method for computing suboptimum delivery routes. The proposed greedy method computes each of the delivery routes successively by using the conventional shortest route algorithm repeatedly. The distance of the links is adjusted iteratively on the basis of the given probability of failure on each link and utilized for the calculation of each shortest route. The results of a performance evaluation show that the proposed method based on the strict adjustment of the link distance can compute sufficiently optimum delivery routes at less than 100 seconds, even in backbone networks of a practical scale.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"44 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":"123159633","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}

{"title":"On the influence of the underlying network topology on optical telecommunication network availability under shared risk link group failures","authors":"V. Miletić, Dimitris Maniadakis, B. Mikac, D. Varoutas","doi":"10.1109/DRCN.2014.6816135","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816135","url":null,"abstract":"Network availability is of paramount importance in optical telecommunication networks. Their rising connectivity and consequently their availability is compromised by link and node failures, usually due to physical force (e.g. digging, earthquake or fire). Single link failures can in turn cause multiple failures in case a failure hits a shared risk link group (SRLG), which is a group of logically distinct links sharing a common physical resource, be it a cable or a conduit. The number and length of SRLGs, as well as the characteristics of the underlying physical topology can significantly affect network availability. Especially, the physical topology can be represented by realistic synthetic graphs which are created by numerous geographic graph generators. This work describes the implementation and usage of six different physical topology models (Random Geometric, Gabriel, Relative Neighborhood, K-Nearest Neighbor, Waxman and Spatial Barabási-Albert) for investigation of the influence of the underlying topology on the optical telecommunication network availability. Network availability is estimated using Monte Carlo simulations based on a model of optical telecommunication network implemented by network simulator ns-3. Scenarios utilizing six topology models both in absence and presence of SRLGs are studied, and the optical network availability sensitivity to the underlying physical network topology is presented as the main result.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"71 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":"116441504","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}

{"title":"A novel approach for ensuring high end-to-end availability: The spine concept","authors":"Teresa Gomes, D. Tipper, Abdulaziz S. Alashaikh","doi":"10.1109/DRCN.2014.6816142","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816142","url":null,"abstract":"Telecommunications networks need to guarantee that all node pairs involved in critical service communications are highly available. Typically only a small fraction of traffic and users needs high levels of availability but this traffic often drives the network design to over engineering. In this paper we adopt a novel approach to the problem of how to provide high levels of availability in an efficient manner. The basic idea is to embed a high availability set of links and nodes (termed the spine) in the network topology and leverage protection and routing to provide differentiated classes of resilience with varying levels of availability. In this paper we first explore the spine concept through a simple example illustrating the potential benefits of the approach. Then we study how the structural properties of a network topology can be used to determine heuristics to select a suitable spine and compare this with the case where all network components have the same availability. This is followed by a numerical based study comparing the heuristics with all possible spanning tree based spines for sample topologies. Our results are a step along the path of how to best design a physical network to support protection methods in achieving high levels of availability cost efficiently.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"18 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":"131024826","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}

{"title":"Impact of optical access topologies onto availability, power and QoS","authors":"Á. Ladányi, T. Cinkler, A. Mitcsenkov","doi":"10.1109/DRCN.2014.6816149","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816149","url":null,"abstract":"Access networks are responsible for a significant part of overall telecom network energy consumption. Furthermore their demand for energy also increases rapidly with the ever-growing traffic volume they carry. Sustainability necessitates energy conserving solutions which also carefully limit the negative effects on other system qualities. It is expected that future access networks are based on a converged wireless-optical architecture. This paper examines such a hybrid small cell LTE and PON network. We analyze the impact of serving the user population with a reduced number of active cells, either due to failure or selective switch-off of chosen cells. Multiple optical topologies are considered for connecting the cells of the wireless network. We use extensive simulations to quantify the interdependence of energy consumption, network availability and the QoS experienced by the consumer.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"103 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":"127334849","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}

{"title":"Does network coding improve the throughput of a survivable multicast network ?","authors":"S. Elloumi, É. Gourdin, Thibaut Lefebvre","doi":"10.1109/DRCN.2014.6816152","DOIUrl":"https://doi.org/10.1109/DRCN.2014.6816152","url":null,"abstract":"We address survivability considerations for telecommunication networks where a part of the network may fail. We focus on single arc failures in multicast networks, with or without network coding. The problem is to compute a routing such that, if any single arc failure occurs, the remaining throughput is as large as possible. In the case of multicast routing without network coding, two ways for computing the impact of an arc failure are considered. Either the throughput of entire Steiner trees containing that arc vanishes, or only the throughput of subtrees, starting from that arc to terminals, is discarded. In the case of multicast with network coding, since the total throughput is computed as the minimum of single max-flow values from the source to any terminal, we consider that a failure of an arc implies that the throughput of all paths containing that arc vanishes. The three obtained models are formulated as linear problems. We solve these problems either directly or by use of column generation. Further, the survivable network coding gain is defined as the ratio of maximal throughput with - over without - network coding, when arc failures can occur. We show that this ratio is unbounded for unitary combination digraphs and hence for any directed networks. We also show that this ratio is equal to one for bidirected graphs with uniform capacities. Finally, some numerical results are carried out on randomly generated networks showing that the gain ratio is equal to one for almost 98 percent of the instances. However, we observe that routing with network coding requires much less redundancy in order to achieve the optimal throughput.","PeriodicalId":307488,"journal":{"name":"2014 10th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"76 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":"115842027","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}