Sciweavers

334 search results - page 30 / 67
» Inapproximability of Survivable Networks
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
BIOCOMP
2006
13 years 10 months ago
An Artificial Neural Network based Model to Analyze Malarial Data and Predict Organ Failure
Health Care Management is one of the most important and most important research areas of the new millennium. The main purpose of this work was to analyze the data on malaria patie...
Dinesh P. Mital, Shankar Srinivasan, Syed Haque, R...
NETWORKS
2007
13 years 8 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
NETWORK
2006
113views more  NETWORK 2006»
13 years 8 months ago
Recovery of the control plane after failures in ASON/GMPLS networks
A reliable control plane plays a crucial role in creating high-level services in the next-generation transport network based on the Generalized Multiprotocol Label Switching (GMPL...
Andrzej Jajszczyk, Pawel Rózycki
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 6 months ago
Designing Demand-Wise Shared Protection Networks with Specified Minimum Dual-Failure Restorability
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...
Jude Akpuh, John Doucette