Adaptive statistical algorithms in network reliability analysis

Authors:
J. Levendovszky;L. Jereb;Zs. Elek;Gy. Vesztergombi
Affiliations:
Department of Telecommunications, Budapest University of Technology and Economics, Pázmány P. s. 1/D, 1111 Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Pázmány P.s. 1/D, 1111 Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Pázmány P.s. 1/D, 1111 Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Pázmány P.s. 1/D, 1111 Budapest, Hungary
Venue:
Performance Evaluation
Year:
2002

Citing 4
Cited 2

Multilayer feedforward networks are universal approximators

Neural Networks
On the approximate realization of continuous mappings by neural networks

Neural Networks
Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks

Neural Networks
Approximation capabilities of multilayer feedforward networks

Neural Networks

Improved bounds for performability evaluation algorithms using state generation

Performance Evaluation
Efficient traffic loss evaluation for transport backbone networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is concerned with introducing novel algorithms, such as adaptive approximation and deterministic radial basis function (RBF) method, for calculating the average loss (AL). Different approximators are trained to approximate the loss function and, after a short learning period, AL can be evaluated analytically with fast calculations. An improvement of the Li-Silvester (LS) method is also presented which yields a sharper lower bound on AL. The efficiency of the new methods are proven by theoretical analysis as well as demonstrated by excessive simulations.