Sciweavers

18 search results - page 1 / 4
» Efficient algorithms for shared backup allocation in network...
Sort
View
JCO
2006
150views more  JCO 2006»
13 years 4 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson
EDCC
2008
Springer
13 years 6 months ago
Targeted Distribution of Resource Allocation for Backup LSP Computation
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
ICNP
2002
IEEE
13 years 9 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
ICC
2007
IEEE
141views Communications» more  ICC 2007»
13 years 11 months ago
Availability-Constrained Shared Backup Path Protection (SBPP) for GMPLS-Based Spare Capacity Reprovisioning
– Shared-backup path protection (SBPP) has been widely studied in the GMPLS networks due to its efficient spare capacity sharing and flexibility in service provisioning. This pap...
Qi Guo, Pin-Han Ho, Anwar Haque, Hussein T. Moufta...
CN
2004
108views more  CN 2004»
13 years 4 months ago
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
Samphel Norden, Milind M. Buddhikot, Marcel Waldvo...