Sciweavers

184 search results - page 35 / 37
» Survivable routing in WDM networks
Sort
View
ICASSP
2010
IEEE
14 years 9 months ago
Automated ECG profiling and beat classification
ive CLP® ABSTRACT Ali A. Milani Broadband speech enhancement and active noise control nvironment ABSTRACT Vanishree Gopalakrishna Real-Time Implementation of Signal Processing Str...
Miad Faezipour, Adnan Saeed, Mehrdad Nourani
INFOCOM
2006
IEEE
15 years 3 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
97
Voted
ICC
2007
IEEE
146views Communications» more  ICC 2007»
15 years 3 months ago
A Delay-Constrained Shared Mesh Restoration Scheme
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...
Hassan Naser, Ming Gong
INFOCOM
2009
IEEE
15 years 4 months ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...
80
Voted
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 1 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...