Sciweavers

451 search results - page 5 / 91
» A New Approach to Survivability of Connection Oriented Netwo...
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
ICCSA
2005
Springer
14 years 1 months ago
Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
Michal Przewozniczek, Krzysztof Walkowiak
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 2 months ago
Maximization of Network Survival Time in the Event of Intelligent and Malicious Attacks
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...
Po-Hao Tsang, Frank Yeong-Sung Lin, Chun-Wei Chen
NOMS
2006
IEEE
14 years 1 months ago
A Segment-based Protection Scheme for MPLS Network Survivability
—This paper proposes a new approach, segment-based path protection, which provides much more enhanced network resource utilization than the local protection scheme and achieves m...
Daniel Won-Kyu Hong, Choong Seon Hong, Woo-Sung Ki...
COCOA
2008
Springer
13 years 9 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...