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....
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | CONF |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_97814673_v_n_p79_Canale |
| Aporte de: |
| id |
todo:paper_97814673_v_n_p79_Canale |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_97814673_v_n_p79_Canale2023-10-03T16:43:29Z Network utility problem and easy reliability polynomials Canale, E. Romero, P. Rubino, G. Warnes, X. Papadimitriou D. Jonsson M. Rak J. Somani A. Vinel A. 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. CONF info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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 Canale, E. Romero, P. Rubino, G. Warnes, X. Papadimitriou D. Jonsson M. Rak J. Somani A. Vinel A. 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. |
| format |
CONF |
| author |
Canale, E. Romero, P. Rubino, G. Warnes, X. Papadimitriou D. Jonsson M. Rak J. Somani A. Vinel A. |
| author_facet |
Canale, E. Romero, P. Rubino, G. Warnes, X. Papadimitriou D. Jonsson M. Rak J. Somani A. Vinel A. |
| author_sort |
Canale, E. |
| 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 |
| url |
http://hdl.handle.net/20.500.12110/paper_97814673_v_n_p79_Canale |
| work_keys_str_mv |
AT canalee networkutilityproblemandeasyreliabilitypolynomials AT romerop networkutilityproblemandeasyreliabilitypolynomials AT rubinog networkutilityproblemandeasyreliabilitypolynomials AT warnesx networkutilityproblemandeasyreliabilitypolynomials AT papadimitrioud networkutilityproblemandeasyreliabilitypolynomials AT jonssonm networkutilityproblemandeasyreliabilitypolynomials AT rakj networkutilityproblemandeasyreliabilitypolynomials AT somania networkutilityproblemandeasyreliabilitypolynomials AT vinela networkutilityproblemandeasyreliabilitypolynomials |
| _version_ |
1807321886040784896 |