Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: fault-tolerant networks

Sortuj według:

Ogranicz wyniki do:

Fault Tolerant Dense Wavelength Division Multiplexing Optical Transport Networks

Ren W., Naderi M., Leeson M., Hines E.

Journal of Telecommunications and Information Technology

2009

nr 1

63-67

Design of fault tolerant dense wavelength division multiplexing (DWDM) backbones is a major issue for service provision in the presence of failures. The problem is an NP-hard problem. This paper presents a genetic algorithm based approach for designing fault tolerant DWDM optical networks in the presence of a single link failure. The working and spare lightpaths are encoded into variable length chromosomes. Then the best lightpaths are found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints using first-fit (FF) algorithm. The proposed approach has been evaluated for dedicated path protection architecture. The results, obtained from the ARPA2 test bench network, show that the method is well suited to tackling this complex and multi-constraint problem.

Reliable minimum finding comparator networks

Denejko P., Diks K., Pelc A., Piotrów M.

Fundamenta Informaticae

2000

Vol. 42, nr 3,4

235-249

We consider the problem of constructing reliable comparator networks built from unreliable comparators. In case of a faulty comparator inputs are directly output without comparison. A trivial lower bound of W(logn +k) on the depth of n-input k-fault tolerant sorting network is well known. We are interested in establishing exact lower bounds on the depth of such networks. To this end we consider fairly simple minimum-finding networks. Our main result is the first nontrivial lower bound on depths of networks computing minimum among n > 2 items in the presence of k > 0 faulty comparators. We prove that the depth of any such network is at least max(élogn u+ 2k, logn + klog[logn/( k+1)]). We also describe a network whose depth nearly matches the lower bound.