Sciweavers

451 search results - page 1 / 91
» A New Approach to Survivability of Connection Oriented Netwo...
Sort
View
ICCS
2003
Springer
13 years 8 months ago
A New Approach to Survivability of Connection Oriented Networks
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
Krzysztof Walkowiak
ISCIS
2005
Springer
13 years 9 months ago
A Unified Approach to Survivability of Connection-Oriented Networks
This paper deals with problems of computer networks survivability. We present and discuss survivability aspects of Content Delivery Networks (CDNs) and other services based on the ...
Krzysztof Walkowiak
ENDM
2010
101views more  ENDM 2010»
13 years 3 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
13 years 9 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
JNW
2006
98views more  JNW 2006»
13 years 3 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen