Sciweavers

58 search results - page 1 / 12
» Two Tree-Based Algorithms for Network Spare Capacity Design
Sort
View
17
Voted
PDCAT
2007
Springer
14 years 1 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
NETWORKING
2000
13 years 8 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
INFOCOM
1997
IEEE
13 years 11 months ago
Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
Yijun Xiong, Lorne Mason
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
13 years 11 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
TON
2010
118views more  TON 2010»
13 years 5 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho