مؤتمر
Reliability Analysis of Tree Networks Applied to Balanced Content Replication
| العنوان: | Reliability Analysis of Tree Networks Applied to Balanced Content Replication |
|---|---|
| المؤلفون: | Andreica, Mugurel Ionut, Tapus, Nicolae |
| المساهمون: | Parallel and Distributed Systems Laboratory Bucarest, University Politehnica of Bucarest |
| المصدر: | Proceedings of the IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 16) (AQTR) (ISBN: 978-1-4244-2576-1) ; IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 16) (AQTR) ; https://hal.archives-ouvertes.fr/hal-00793908Test ; IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 16) (AQTR), May 2008, Cluj-Napoca, Romania. pp.79-84, ⟨10.1109/AQTR.2008.4588711⟩ |
| بيانات النشر: | HAL CCSD IEEE |
| سنة النشر: | 2008 |
| المجموعة: | Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
| مصطلحات موضوعية: | balanced content replication, fault tolerance, optimal linear time algorithm, reliability analysis, tree networks, tree topologies, unrestricted vertex multicut problem, ACM E.1, F.2, G.2, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] |
| جغرافية الموضوع: | Cluj-Napoca, Romania |
| الوصف: | The participation of the first author in multiple algorithmic contests (both as a contestant and as a member of the scientific committee) influenced many of the results presented in this paper. The attached ZIP archive contains a few sample tasks and solutions (of the first author or of others) which are related to the algorithms presented in this paper. The final version of the paper can be found in the IEEE Xplore database: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=4588711&contentType=Conference+Publications&queryText%3DReliability+Analysis+of+Tree+Networks+Applied+to+Balanced+Content+ReplicationTest ; International audience ; The fault tolerance of the communication topology of a distributed system is a very important feature which needs to be analyzed carefully. In this paper we propose a new reliability metric for tree topologies, based on the unrestricted vertex multicut problem on trees, for which we present the first optimal linear time algorithm. We present evaluation results of the reliability metric on tree networks used for balanced content replication. For this problem, we also developed a new O(V*k) algorithm solving the k-equitable coloring problem on trees with V vertices, based on a hierarchy of color relabeling permutations. |
| نوع الوثيقة: | conference object |
| اللغة: | English |
| العلاقة: | hal-00793908; https://hal.archives-ouvertes.fr/hal-00793908Test; https://hal.archives-ouvertes.fr/hal-00793908/documentTest; https://hal.archives-ouvertes.fr/hal-00793908/file/Andreica_Tapus-Vertex_Multicut_Balanced_Content_Replication_Trees.pdfTest |
| DOI: | 10.1109/AQTR.2008.4588711 |
| الإتاحة: | https://doi.org/10.1109/AQTR.2008.4588711Test https://hal.archives-ouvertes.fr/hal-00793908Test https://hal.archives-ouvertes.fr/hal-00793908/documentTest https://hal.archives-ouvertes.fr/hal-00793908/file/Andreica_Tapus-Vertex_Multicut_Balanced_Content_Replication_Trees.pdfTest |
| حقوق: | info:eu-repo/semantics/OpenAccess |
| رقم الانضمام: | edsbas.37E60E7C |
| قاعدة البيانات: | BASE |
| DOI: | 10.1109/AQTR.2008.4588711 |
|---|