Adaptive Gossip-Based Broadcast

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by L. Rodrigues Articles by S. Handurukande Articles by J. Pereira Articles by R. Guerraoui Articles by A.-M. Kermarrec

2003 International Conference on Dependable Systems and Networks (DSN'03)

San Francisco, California

June 22-June 25

ISBN: 0-7695-1952-0

	ASCII Text	x
	L. Rodrigues, S. Handurukande, J. Pereira, R. Guerraoui, A.-M. Kermarrec, "Adaptive Gossip-Based Broadcast," Dependable Systems and Networks, International Conference on, pp. 47, 2003 International Conference on Dependable Systems and Networks (DSN'03), 2003.

	BibTex	x
	@article{ 10.1109/DSN.2003.1209915, author = {L. Rodrigues and S. Handurukande and J. Pereira and R. Guerraoui and A.-M. Kermarrec}, title = {Adaptive Gossip-Based Broadcast}, journal ={Dependable Systems and Networks, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1952-0}, pages = {47}, doi = {http://doi.ieeecomputersociety.org/10.1109/DSN.2003.1209915}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Dependable Systems and Networks, International Conference on TI - Adaptive Gossip-Based Broadcast SN - 0-7695-1952-0 SP EP A1 - L. Rodrigues, A1 - S. Handurukande, A1 - J. Pereira, A1 - R. Guerraoui, A1 - A.-M. Kermarrec, PY - 2003 KW - null VL - 0 JA - Dependable Systems and Networks, International Conference on ER -

L. Rodrigues, U. de Lisboa

S. Handurukande, EPFL

J. Pereira, U. do Minho

R. Guerraoui, EPFL

A.-M. Kermarrec, Microsoft Research

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DSN.2003.1209915

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.

Citation:

L. Rodrigues, S. Handurukande, J. Pereira, R. Guerraoui, A.-M. Kermarrec, "Adaptive Gossip-Based Broadcast," dsn, pp.47, 2003 International Conference on Dependable Systems and Networks (DSN'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.