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

{"title":"Software-based fast failure recovery for resilient OpenFlow networks","authors":"Steven S. W. Lee, Kuang-Yi Li, Kwan-Yee Chan, Guan-Hao Lai, Yao-Chuan Chung","doi":"10.1109/RNDM.2015.7325229","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325229","url":null,"abstract":"In this paper, we tackle the failure detection problem in OpenFlow networks. We have examined several commercial OpenFlow switches and found that the long failure detection time makes an OpenFlow network unable to realize fast failure recovery. To resolve this problem, we propose a software based failure detection and fault location identification scheme. Our design can be applied to both in-band controlled and out-of-band controlled OpenFlow networks. In the network, the OpenFlow controller periodically uses monitoring packets to probe network status. Through provisioning monitoring cycles to cover all links in a given network, the OpenFlow controller can detect and pinpoint a failed link within a short time. An algorithm based on the solution of min-max k-Chinese postman problem is proposed to determine the routing of the monitoring cycles. For an in-band controlled network, besides the monitoring cycles, a survivable in-band control tree (ICT) is provisioned to protect in-band control channels. We have conducted experiments to evaluate the performance of the proposed scheme. The results indicate that our approach generates very limited overhead on the OpenFlow controller. It enables an OpenFlow network to achieve fast failure recovery even when the network is in a heavy load state.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"15 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":"114357415","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 two-stage QoT-aware protection procedure for dependable connection establishment in survivable SRLG-constrained WDM translucent networks","authors":"Maroua Bakri, M. Koubàa, A. Bouallègue, M. Gagnaire","doi":"10.1109/RNDM.2015.7325215","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325215","url":null,"abstract":"In this paper, we address, for the first time as far as we know, the problem of provisioning connection requests with fault-tolerant requirements - referred to as Dependable connections (D-connections) - in survivable translucent wavelength-routed optical networks impaired with physical-layer effects taking into consideration Shared Risk Link Group (SRLG) constraints. Due to the complexity of the investigated problem, we, here, propose a practical heuristic algorithm that computes in a reasonable computational time a near-optimal routing solution, for a given set of D-connections to be set up, with the objective of maximizing the number of accommodated requests whilst guaranteeing an admissible Quality of Transmission (QoT) for all set up primary and backup lightpaths, given a limited amount of available network resources. The proposed heuristic integrates an original Two-Stage Protection (TSP) procedure which ensures fast recovery to all established D-connections from any possible SRLG-failure based on a combination of the Path Protection (PP) scheme broadly known for its resource utilization efficiency, and the Partial Path Protection (PPP) scheme widely recognized for its effectiveness in avoiding topology traps. The integrated protection procedure relies on a generic purpose-built auxiliary graph model that may support various factors of network heterogeneity through the manipulation of different edges in the constructed auxiliary graph. During the primary and backup computation processes, TSP procedure attempts to minimize network resource consumption by allowing the simultaneous use of two efficient resource sharing techniques combined, to the best of our knowledge, for the first time under a static traffic pattern, and performed in such a way that the 100% fault-recoverability is still guaranteed for all set up connections. The effectiveness of the adopted protection procedure is demonstrated through extensive numerical experiments carried out on different network topologies. The obtained simulation results prove that thanks to such an approach our heuristic algorithm achieves better performance either in terms of network blocking performance or in terms of resource utilization efficiency when compared to conventional protection approaches.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"159 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":"116740972","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":"Enhancing fault tolerance capabilities in quorum-based cycle routing","authors":"C. J. Kleinheksel, Arun Kumar Somani","doi":"10.1109/RNDM.2015.7324305","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324305","url":null,"abstract":"In this paper we propose a generalized R redundancy cycle technique that provides optical networks almost fault-tolerant communications. More importantly, when applied using only single cycles rather than the standard paired cycles, the generalized R redundancy technique is shown to almost halve the necessary light-trail resources in the network while maintaining the fault-tolerance and dependability expected from cycle-based routing. For efficiency and distributed control, it is common in distributed systems and algorithms to group nodes into intersecting sets referred to as quorum sets. Optimal communication quorum sets forming optical cycles based on light-trails have been shown to flexibly and efficiently route both point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle routing techniques will use pairs of cycles to achieve both routing and fault-tolerance, which uses substantial resources and creates the potential for underutilization. Instead, we intentionally utilize R redundancy within the quorum cycles for fault-tolerance such that every point-to-point communication pairs occur in at least R cycles. The result is a set of R = 3 redundant cycles with 93.23-99.34% fault coverage even with two simultaneous faults all while using 38.85-42.39% fewer resources.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"165 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":"133713139","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":"Out of vehicle channel sounding in 5.8 GHz band","authors":"Pavel Kukolev, A. Chandra, T. Mikulášek, A. Prokeš","doi":"10.1109/RNDM.2015.7325250","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325250","url":null,"abstract":"The article presents out-of-vehicle channel measurement results in the 5.8 GHz frequency band which is used in the IEEE 802.11p standard. Experiments for two different distances and three different angles around the parked car are carried out. It is found that a two-term exponential decay model can satisfactorily describe the mean measured power delay profiles. For each measurement, this large scale variation is used to calculate the corresponding channel impulse response and to construct a Rician tap-delay multipath channel model. Bit error rate (BER) performance for each measured location is then evaluated through MATLAB based simulation. The simulation results indicate that the error performances do not vary much and it is possible to determine an average BER curve for the whole set of data.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"12 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":"129284523","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":"Measuring the resilience of mobile ad hoc networks with human walk patterns","authors":"Dongsheng Zhang, J. Sterbenz","doi":"10.1109/RNDM.2015.7325224","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325224","url":null,"abstract":"MANET (mobile ad hoc network) technology has become increasingly attractive for real-world applications in the past decade. Dynamic and intermittent connectivity caused by node mobility poses a huge challenge to the operation of MANETs that require end-to-end paths for communication. The attacks against critical nodes could result in a more degraded network service. In this paper, we evaluate the network resilience of real-world humans' walking traces under different malicious attacks. We propose a new flexible attack strategy by selecting different centrality metrics to measure node significance according to network topological properties. We employ a resilience quantification approach to evaluate the node pair communication ability spanning a range of network operational states. Resilience of topological robustness is evaluated for different combinations of network parameters, and resilience of application layer service using different routing protocols are compared given a range of states of topological flow robustness. Our results show that flexible attacks impact overall network resilience more than attacks based on any single centrality metric with varying network connectivities.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"132 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":"115754111","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":"GLOSA for adaptive traffic lights: Methods and evaluation","authors":"B. Bodenheimer, D. Eckhoff, R. German","doi":"10.1109/RNDM.2015.7325247","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325247","url":null,"abstract":"Green Light Optimized Speed Advisory (GLOSA) systems have been shown to be able to reduce both CO2 emissions and fuel consumption by giving drivers speed recommendations when approaching a traffic light. For the system to reach its maximum potential, is is necessary to properly predict all different types of traffic lights, that is, also adaptive traffic lights where signals may change with lead times as short as 1 s. In previous work we presented an approach to predict these adaptive traffic lights using graph transformation. In this paper we demonstrate how to adequately parametrize such a graph based prediction approach and evaluate the accuracy of the signal prognosis. In a first step, we find feasible values for the proper creation of the prediction graph. This graph is the basis for all predictions and therefore directly influences the quality of the prognosis. We then assess the forecast in terms of correctness and deviation to measure the accuracy of the predictions. We were able to show a prognosis system with an accuracy of 95% and a deviation of less than 2 s. Lastly, we discuss some criteria to compare different approaches of prognosis systems for adaptive traffic lights.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"1 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":"130918918","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 segment routing","authors":"A. Giorgetti, A. Sgambelluri, F. Paolucci, P. Castoldi","doi":"10.1109/RNDM.2015.7325227","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7325227","url":null,"abstract":"Segment Routing (SR) is a novel traffic engineering technique compatible with traditional MPLS data plane. SR relies on label stacking to steer traffic flows throughout the network. Signaling protocol is not required, thus control plane operation is greatly simplified. SR can also be exploited upon network failures to promptly perform traffic recovery and, subsequently, to optimize the recovered traffic for avoiding network congestion. This study proposes a procedure to dynamically recover the traffic flows disrupted by a single failure in segment routing networks. The proposed procedure is evaluated in several network topologies to estimate the complexity of the required operations.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"4 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":"115480322","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":"Delay aware survivable routing with network coding in Software Defined Networks","authors":"Alija Pašić, P. Babarczi","doi":"10.1109/RNDM.2015.7324307","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324307","url":null,"abstract":"It was demonstrated in transport networks that network (diversity) coding can provide sufficient redundancy to ensure instantaneous single link failure recovery, while near-optimal bandwidth efficiency can be reached. However, in the resulting multi-path routing problem the end-to-end delays were not considered. On the other hand, even in a European-scale network the delay difference of the paths has severe effect on the Quality-of-Service of application scenarios, such as video streaming. Thus, in this paper we thoroughly investigate survivable routing in Software Defined Networks (SDNs) with several additional delay bounds to the bandwidth cost minimization problem. We build on the fact that, if the user data is split into at most two parts, then the minimum cost coding solution has a well-defined acyclic structure of subsequent paths and disjoint path-pairs between the communication end-points. Complexity analysis and integer linear programs are provided to solve these delay aware survivable routing problems in SDNs.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"14 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":"117253795","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":"Critical region identification and geodiverse routing protocol under massive challenges","authors":"Yufei Cheng, J. Sterbenz","doi":"10.1109/RNDM.2015.7324303","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324303","url":null,"abstract":"Regionally-correlated failures or attacks pose a great challenge to the normal network communication for physical backbone networks. When the same intensity of challenges occur at different physical locations, the damage to the network connectivity varies greatly. In this paper, we propose a critical region identification model and demonstrate its effectiveness in finding critical regions for fiber-level networks under regionally-correlated failures or attacks. We apply the model on several real-world backbone networks to demonstrate its efficiency using both unweighted and weighted topologies. Furthermore, the identified critical region result is used to improve the routing performance using GeoDivRP, a resilient routing protocol with geodiversity considered.","PeriodicalId":248916,"journal":{"name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","volume":"231 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":"116309149","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":"Computing distance-bounded node-disjoint paths for all pairs of nodes — An application to optical core network design","authors":"D. Mehta, B. O’Sullivan, Cemalletin Ozturk, L. Quesada","doi":"10.1109/RNDM.2015.7324311","DOIUrl":"https://doi.org/10.1109/RNDM.2015.7324311","url":null,"abstract":"Core optical networks require connectivity between all pairs of nodes. If the optical core network is transparent then the length of fibre between each pair of core nodes must be within a given threshold. A failure in the network could affect hundreds of thousands of customers. Therefore, it is important to ensure multiple connectivity between all pairs of nodes through at least two node-disjoint paths while respecting the path-length constraints. Node-disjointness allows switching to an alternative path whenever a link or a node fails. Minimising the cost associated with the fibre while maximising the disjointness for a given network is a very challenging task. We model this problem and develop an approach that is scalable both in terms of time and space for solving very large-sized problem instances.","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":"115486622","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}