Network utility problem and easy reliability polynomials

We model a communication system by a network, were the terminals are perfect but links may fail randomly, with identical probability q = 1-p. This defines a partial random network. The all-terminal reliability R(p) is the probability that this random graph is connected, and it is a polynomial in p....

Descripción completa

Guardado en:

Detalles Bibliográficos
Publicado:	2016
Materias:	Polynomials All terminal reliability Counting problems Network utility Random graphs Random network Reliability polynomials Reliability
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97814673_v_n_p79_Canale http://hdl.handle.net/20.500.12110/paper_97814673_v_n_p79_Canale
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_97814673_v_n_p79_Canale
record_format	dspace
spelling	paper:paper_97814673_v_n_p79_Canale2023-06-08T16:37:39Z Network utility problem and easy reliability polynomials Polynomials All terminal reliability Counting problems Network utility Random graphs Random network Reliability polynomials Reliability We model a communication system by a network, were the terminals are perfect but links may fail randomly, with identical probability q = 1-p. This defines a partial random network. The all-terminal reliability R(p) is the probability that this random graph is connected, and it is a polynomial in p. Finding the reliability polynomial can be reduced to a hard counting problem. © 2016 IEEE. 2016 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97814673_v_n_p79_Canale http://hdl.handle.net/20.500.12110/paper_97814673_v_n_p79_Canale
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Polynomials All terminal reliability Counting problems Network utility Random graphs Random network Reliability polynomials Reliability
spellingShingle	Polynomials All terminal reliability Counting problems Network utility Random graphs Random network Reliability polynomials Reliability Network utility problem and easy reliability polynomials
topic_facet	Polynomials All terminal reliability Counting problems Network utility Random graphs Random network Reliability polynomials Reliability
description	We model a communication system by a network, were the terminals are perfect but links may fail randomly, with identical probability q = 1-p. This defines a partial random network. The all-terminal reliability R(p) is the probability that this random graph is connected, and it is a polynomial in p. Finding the reliability polynomial can be reduced to a hard counting problem. © 2016 IEEE.
title	Network utility problem and easy reliability polynomials
title_short	Network utility problem and easy reliability polynomials
title_full	Network utility problem and easy reliability polynomials
title_fullStr	Network utility problem and easy reliability polynomials
title_full_unstemmed	Network utility problem and easy reliability polynomials
title_sort	network utility problem and easy reliability polynomials
publishDate	2016
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97814673_v_n_p79_Canale http://hdl.handle.net/20.500.12110/paper_97814673_v_n_p79_Canale
_version_	1768543348392460288

Network utility problem and easy reliability polynomials

Ejemplares similares