<?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%">João Leitão</style></author><author><style face="normal" font="default" size="100%">José Orlando Pereira</style></author><author><style face="normal" font="default" size="100%">Luis Rodrigues</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">HyParView: A membership protocol for reliable gossip-based broadcast</style></title><secondary-title><style face="normal" font="default" size="100%">The 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks - DSN</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</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.2007.56</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.190.3289.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%">Edinburgh, UK</style></pub-location><pages><style face="normal" font="default" size="100%">{419-428}</style></pages><isbn><style face="normal" font="default" size="100%">{978-0-7695-2855-7}</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives. Due to scalability reasons, each participant in a gossip protocol maintains a partial view of the system. The reliability of the gossip protocol depends upon some critical properties of these views, such as degree distribution and clustering coefficient. Several algorithms have been proposed to maintain partial views for gossip protocols. In this paper, we show that under a high number of faults, these algorithms take a long time to restore the desirable view properties. To address this problem, we present HyParView, a new membership protocol to support gossip-based broadcast that ensures high levels of reliability even in the presence of high rates of node failure. The HyParView protocol is based on a novel approach that relies in the use of two distinct partial views, which are maintained with different goals by different strategies.&lt;/p&gt;
</style></abstract><work-type><style face="normal" font="default" size="100%">{Proceedings Paper}</style></work-type></record></records></xml>