169 research outputs found
Risk based resilient network design
This paper presents a risk-based approach to resilient network design. The basic design problem considered is that given a working network and a fixed budget, how best to allocate the budget for deploying a survivability technique in different parts of the network based on managing the risk. The term risk measures two related quantities: the likelihood of failure or attack, and the amount of damage caused by the failure or attack. Various designs with different risk-based design objectives are considered, for example, minimizing the expected damage, minimizing the maximum damage, and minimizing a measure of the variability of damage that could occur in the network. A design methodology for the proposed risk-based survivable network design approach is presented within an optimization model framework. Numerical results and analysis illustrating the different risk based designs and the tradeoffs among the schemes are presented. © 2011 Springer Science+Business Media, LLC
Fast optical layer mesh protection using pre-cross-connected trails
Conventional optical networks are based on SONET rings, but since rings are
known to use bandwidth inefficiently, there has been much research into shared
mesh protection, which promises significant bandwidth savings. Unfortunately,
most shared mesh protection schemes cannot guarantee that failed traffic will
be restored within the 50 ms timeframe that SONET standards specify. A notable
exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however,
that p-cycles have certain limitations, e.g., there is no easy way to adapt
p-cycles to a path-based protection scheme, and p-cycles seem more suited to
static traffic than to dynamic traffic. In this paper we show that the key to
fast restoration times is not a ring-like topology per se, but rather the
ability to pre-cross-connect protection paths. This leads to the concept of a
pre-cross-connected trail or PXT, which is a structure that is more flexible
than rings and that adapts readily to both path-based and link-based schemes
and to both static and dynamic traffic. The PXT protection scheme achieves fast
restoration speeds, and our simulations, which have been carefully chosen using
ideas from experimental design theory, show that the bandwidth efficiency of
the PXT protection scheme is comparable to that of conventional shared mesh
protection schemes.Comment: Article has appeared in IEEE/ACM Trans. Networkin
Towards Autonomic Computing: Effective Event Management
Autonomic Computing is emerging as a significant new approach for the design of computing systems. Its goal is the production of systems that are self-managing, self-healing, self-protecting and self-optimizing. Achieving this goal will involve techniques from both Software Engineering and Artificial Intelligence. This paper discusses one particular aspect of Autonomic Computing: event management. It considers the range of event handling techniques in use, particularly in relation to distributed systems. Intelligent approaches are illustrated using the example of event handling in telecommunication systems. In particular, the telecom survivable network architecture is analyzed to identify lessons and potential pitfalls for Autonomic Computing
Route recovery schemes for link and node failure and link congestion
Link/Node failure occurs frequently causing service disruption in computer networks. Hardware techniques have been developed to protect the network from Link/Node failure. These techniques work in physical layer, therefore their convergence time is very small. On the other hand, many schemes have been proposed to mitigate the failure influence on the network. These schemes work in upper layers such as the network layer. However, hardware solutions faster than other schemes, but they are expensive. Link/Node failure causes all flows which were using the failed link/node are temporarily interrupted till a new path reestablished.
Three recovery algorithms have been proposed that mitigate the changes occur in the network. These changes are link/node failure and link congestion. The algorithms mainly pre-compute a backup next hop for each destination in the network. This path is feasible to accommodate re-routed traffic when a failure occurs without causing congestion or loops. Simulations have been conducted to show the performance of the proposed algorithms using ns2 network simulation tool. The results show fast recovery for all flows were using the link/node failure. Furthermore, the throughput per node also increases due to decrease interruption service time
Scatter search based met heuristic for robust optimization of the deploying of "DWDM" technology on optical networks with survivability
In this paper we discuss the application of a met heuristic approach based on the Scatter Search to deal with robust optimization of the planning problem in the deploying of the Dense Wavelength Division Multiplexing (DWDM) technology on an existing optical fiber network taking into account, in addition to the forecasted demands, the uncertainty in the survivability requirements
LOGICAL TOPOLOGY DESIGN FOR SURVIVABILITY IN IP-OVER-WDM NETWORKS
IP-over-WDM networks integrate Wavelength Division Multiplexing (WDM) technology with Internet Protocol (IP) and are widely regarded as the architecture for the next generation high-speed Internet. The problem of designing an IP-over-WDM network can be modeled as an embedding problem in which an IP network is embedded in a WDM network by establishing all optical paths between IP routers in the WDM network. Survivability is considered a vital requirement in such networks, which can be achieved by embedding the IP network in the WDM network in such a way that the IP network stays connected in the presence of failure or failures in the WDM network. Otherwise, some of the IP routers may not be reachable.The problem can be formulated as an Integer Linear Program (ILP), which can be solved optimally but is NP-complete. In this thesis, we have studied and proposed various efficient algorithms that can be used to make IP-over-WDM networks survivable in the presence of a single WDM link (optical fiber cable or cables) failure.First we evaluate an existing approach, named Survivable Mapping Algorithm by Ring Trimming (SMART), which provides survivability for an entire network by successively considering pieces of the network. The evaluation provides much insight into the approach, which allowed us to propose several enhancements. The modified approach with enhancements leads to better performance than the original SMART.We have also proposed a hybrid algorithm that guarantees survivability, if the IP and the WDM networks are at least 2-edge connected. The algorithm uses a combination of proactive (protection) and reactive (restoration) mechanisms to obtain a survivable embedding for any given IP network in any given WDM network.Circuits and cutsets are dual concepts. SMART approach is based on circuits. The question then arises whether there exists a dual methodology based on cutsets. We investigate this question and provide much needed insight. We provide a unified algorithmic framework based on circuits and cutsets. We also provide new methodologies based on cutsets and give a new proof of correctnessof SMART. We also develop a method based on incidence sets that are a special case of cutsets. Noting that for some IP networks a survivable embedding may not exist, the option of adding new IP links is pursued. Comparative evaluations of all the algorithms through extensive simulations are also given in this dissertation
Optimized Design of Survivable MPLS over Optical Transport Networks. Optical Switching and Networking
In this paper we study different options for the survivability implementation
in MPLS over Optical Transport Networks in terms of network resource usage and
configuration cost. We investigate two approaches to the survivability
deployment: single layer and multilayer survivability and present various
methods for spare capacity allocation (SCA) to reroute disrupted traffic. The
comparative analysis shows the influence of the traffic granularity on the
survivability cost: for high bandwidth LSPs, close to the optical channel
capacity, the multilayer survivability outperforms the single layer one,
whereas for low bandwidth LSPs the single layer survivability is more
cost-efficient. For the multilayer survivability we demonstrate that by mapping
efficiently the spare capacity of the MPLS layer onto the resources of the
optical layer one can achieve up to 22% savings in the total configuration cost
and up to 37% in the optical layer cost. Further savings (up to 9 %) in the
wavelength use can be obtained with the integrated approach to network
configuration over the sequential one, however, at the increase in the
optimization problem complexity. These results are based on a cost model with
actual technology pricing and were obtained for networks targeted to a
nationwide coverage
Recommended from our members
Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks
Optical transport networks based on wavelength division multiplexing (WDM) are considered to be the most appropriate choice for future Internet backbone. On the other hand, future DOE networks are expected to have the ability to dynamically provision on-demand survivable services to suit the needs of various high performance scientific applications and remote collaboration. Since a failure in aWDMnetwork such as a cable cut may result in a tremendous amount of data loss, efficient protection of data transport in WDM networks is therefore essential. As the backbone network is moving towards GMPLS/WDM optical networks, the unique requirement to support DOE’s science mission results in challenging issues that are not directly addressed by existing networking techniques and methodologies. The objectives of this project were to develop cost effective protection and restoration mechanisms based on dedicated path, shared path, preconfigured cycle (p-cycle), and so on, to deal with single failure, dual failure, and shared risk link group (SRLG) failure, under different traffic and resource requirement models; to devise efficient service provisioning algorithms that deal with application specific network resource requirements for both unicast and multicast; to study various aspects of traffic grooming in WDM ring and mesh networks to derive cost effective solutions while meeting application resource and QoS requirements; to design various diverse routing and multi-constrained routing algorithms, considering different traffic models and failure models, for protection and restoration, as well as for service provisioning; to propose and study new optical burst switched architectures and mechanisms for effectively supporting dynamic services; and to integrate research with graduate and undergraduate education. All objectives have been successfully met. This report summarizes the major accomplishments of this project. The impact of the project manifests in many aspects: First, the project addressed many essential problems that arisen in current and future WDM optical networks, and provided a host of innovative solutions though there was no invention or patent filing. This project resulted in more than 2 dozens publications in major journals and conferences (including papers in IEEE Transactions and journals, as well as a book chapter). Our publications have been cited by many peer researchers. In particular, one of our conference papers was nominated for the best paper award of IEEE/Create-Net Broadnets (International Conference on Broadband Communications, Networks, and Systems) 2006. Second, the results and solutions of this project were well received by DOE Labs where presentations were given by the PI. We hope to continue the collaboration with DOE Labs in the future. Third, the project was the first to propose and extensively study multicast traffic grooming, new traffic models such as sliding scheduled traffic model and scheduled traffic model. Our research has sparkled a flurry of recent studies and publications by the research community in these areas. Fourth, the project has benefited a diverse population of students by motivating, engaging, enhancing their learning and skills. The project has been conducted in a manner conducive to the training of students both at graduate and undergraduate levels. As a result, one Ph.D., Dr. Abdur Billah, was graduated. Another Ph.D. student, Tianjian Li, will graduate in January 2007. In addition, four MS students were graduated. One undergraduate student, Jeffrey Alan Shininger, completed his university honors project. Fifth, thanks to the support of this ECPI project, the PI has obtained additional funding from the National Science Foundation, the Air Force Research Lab, and other sources. A few other proposals are pending. Finally, this project has also significantly impacted the curricula and resulted in the enhancement of courses at the graduate and undergraduate levels, therefore strengthening the bond between research and education
- …