Надійність в телекомунікаційних мережах

Abstract

Algorithms of optimal reservation, namely, searching algorithms of number of back-up elements for R and T-types reliability indices with preset number of limitations are investigated. The given problem is rather actual for telecommunication systems and networks. Having defined topology and "bottlenecks" we can solve the problem of usage of reserve communication channels and by-pass routes with various types of reliability index and available limitations.