In Survivable Network problems (a.k.a. Survivable Network Design Problem – SNDP) we are given a graph with costs/weights on edges and/or nodes and prescribed connectivity requirements/demands. Among the subgraphs of G that satisfy the requirements, we seek to find one of minimum cost. Formally, the problem is defined as follows. Given a graph G = (V,E) and Q ⊆ V , the Q-connectivity λQG(uv) of ...

Virtual ring is a preferable design for reliable and survivable group communication. Different implementations of virtual ring have different advantages and constraints. After studying two specific implementations of virtual ring, Virtual Ring on Embedded Tree and Virtual Ring of Traveling Salesman Tour, we propose a novel ring-based survivable architecture for group communication, called the M...

In this paper, we analyze survivability issues of Bluetooth Location Networks (BLN) for location-aware or context-driven mobile networks, such as m-commerce environments or e-museums. We assume that, in any of those scenarios, there exist service servers that need to know user location in real-time, to send context-oriented information to user handhelds when necessary. The BLN transmits positio...

Multi-Attribute Tradespace Exploration (MATE) for Survivability is introduced as a system analysis methodology to improve the generation and evaluation of survivable alternatives during conceptual design. MATE for Survivability applies decision theory to the parametric modeling of thousands of design alternatives across representative distributions of disturbance environments. To improve the ge...

The survivable network design problem is a classical problem in combinatorial optimization of constructing a minimum-cost subgraph satisfying predetermined connectivity requirements. In this paper we consider its geometric version in which the input is a complete Euclidean graph. We assume that each vertex v has been assigned a connectivity requirement rv . The output subgraph is supposed to ha...

This article studies the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability introduces a metaheuristic resolution approach based on Greedy Randomized Adaptive Search Procedure Variable Neighborhood Descent. Under hostile model, nodes links are subject to probabilistic failures. The research focuses studying relationship between optimization reliability evalua...

Survivability, the ability of a system to tolerate intentional attacks or accidental failures or errors, is becoming increasingly important with the extended use of computer systems in society. While techniques such as cryptographic methods, intrusion detection, and traditional fault tolerance are currently being used to improve the survivability of such systems, new approaches are needed to he...

We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V,E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E′ ⊂ E, covering T and r, such that the network induced by E′ is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T . ...