Sciweavers

334 search results - page 1 / 67
» Inapproximability of Survivable Networks
Sort
View
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
13 years 5 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
TEI
2012
ACM
247views Hardware» more  TEI 2012»
11 years 11 months ago
LSP
This document presents a discussion about the Avaya S8300 and S8500 Media Server configured as a Local Survivable Processor (LSP). This discussion is intended to describe how the ...
Edwin van der Heide
IPCCC
2007
IEEE
13 years 10 months ago
Towards Survivable and Secure Wireless Sensor Networks
– In this paper, we present a comprehensive study on the design of secure and survivable wireless sensor networks (WSNs). Our goal is to develop a framework that provides both se...
Yi Qian, Kejie Lu, David Tipper
CORR
1998
Springer
184views Education» more  CORR 1998»
13 years 3 months ago
Case Study in Survivable Network System Analysis
This paper presents a method for analyzing the survivability of distributed network systems and an example of its application. Survivability is the capability of a system to fulfi...
Robert J. Ellison, Richard C. Linger, Thomas A. Lo...
ICRE
1998
IEEE
13 years 8 months ago
Requirements Definition for Survivable Network Systems
Pervasive societal dependency on large-scale, unbounded network systems, the substantial risks of such dependency, and the growing sophistication of system intruders, have focused...
Richard C. Linger, Nancy R. Mead, Howard F. Lipson