 |
|
|
|
| HAL : hal-00412058, version 1 |
| DOI : 10.1016/j.jcss.2009.07.002 |
| Fiche détaillée |  Récupérer au format |
|
|
| Journal of Computer and System Sciences 76, 3-4 (2010) 222-232 |
|
|
|
|
| Communication algorithms with advice |
|
|
| Pierre Fraigniaud 1David Ilcinkas 2, 3 |
|
|
| (2010) |
|
|
|
| We study the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. Our approach is {\em quantitative}: we investigate the minimum total number of bits of information (minimum size of advice) that has to be available to nodes, regardless of the type of information provided. We compare the size of advice needed to perform broadcast and wakeup (the latter is a broadcast in which nodes can transmit only after getting the source information), both using a linear number of messages (which is optimal). We show that the minimum size of advice permitting the {\em wakeup} with a linear number of messages in a $n$-node network, is $\Theta (n \log n)$, while the {\em broadcast} with a linear number of messages can be achieved with advice of size $O(n)$. We also show that the latter size of advice is almost optimal: no advice of size $o(n)$ can permit to broadcast with a linear number of messages. Thus an efficient wakeup requires strictly more information about the network than an efficient broadcast. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) |
|
|
|
CNRS : UMR7089 – Université Paris VII - Paris Diderot |
|
|
| 2 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 3 : | CEPAGE (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
| 4 : | Département d'Informatique et d'Ingénierie (DII) |
|
|
|
Université du Québec en Outaouais |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Calcul parallèle, distribué et partagé |
|
|
| Algorithm – Broadcasting – Wakeup – Size of advice – Message complexity – Network – Graph |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00412058, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00412058 | |
| oai:hal.archives-ouvertes.fr:hal-00412058 | |
| Contributeur : David Ilcinkas | |
| Soumis le : Lundi 31 Août 2009, 15:52:56 | |
| Dernière modification le : Jeudi 8 Avril 2010, 09:34:04 | |
