<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luis Rodrigues</style></author><author><style face="normal" font="default" size="100%">José Orlando Pereira</style></author><author><style face="normal" font="default" size="100%">S. Handurukande</style></author><author><style face="normal" font="default" size="100%">R. Guerraoui</style></author><author><style face="normal" font="default" size="100%">Anne Marie Kermarrec</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">D. Martin</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive gossip-based broadcast</style></title><secondary-title><style face="normal" font="default" size="100%">DSN - International Conference on Dependable Systems and Networks</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/DSN.2003.1209915</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jop/files/10.1.1.164.2113.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Washington, DC, USA</style></pub-location><pages><style face="normal" font="default" size="100%">{47-56}</style></pages><isbn><style face="normal" font="default" size="100%">{0-7695-1952-0}</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources available to the nodes within the same broadcast group and 2) to the global level of congestion in the system. The adaptation mechanism can be applied to all gossip-based broadcast algorithms we know of and makes their use more realistic in practical situations where nodes have limited resources whose quantity changes dynamically with time without decreasing the reliability.&lt;/p&gt;
</style></abstract><work-type><style face="normal" font="default" size="100%">{Proceedings Paper}</style></work-type></record></records></xml>