BGP-Based Clustering for Scalable and Reliable Gossip Broadcast

This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), accor...

Full description

Saved in:
Bibliographic Details
Published inGlobal Computing pp. 273 - 290
Main Authors Brahami, M., Eugster, P. Th, Guerraoui, R., Handurukande, S. B.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Broadcast streams
Content distribution
Fault-tolerance
Multicast
Peer-to-peer communications
Service overlay networks
System design
Online AccessGet full text

Cover

Abstract This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large networks like the Internet, without relying on any special infrastructure or intermediate brokers. Roughly speaking, a dissemination graph consists of “non-crossing” (independent) trees that provide multiple paths between processes for improved broadcast efficiency and reliability. Each tree is constructed using BGP routing information about process “locality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.
AbstractList This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large networks like the Internet, without relying on any special infrastructure or intermediate brokers. Roughly speaking, a dissemination graph consists of “non-crossing” (independent) trees that provide multiple paths between processes for improved broadcast efficiency and reliability. Each tree is constructed using BGP routing information about process “locality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.
Author Brahami, M.
Guerraoui, R.
Handurukande, S. B.
Eugster, P. Th
Author_xml – sequence: 1
  givenname: M.
  surname: Brahami
  fullname: Brahami, M.
  organization: Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL), Switzerland
– sequence: 2
  givenname: P. Th
  surname: Eugster
  fullname: Eugster, P. Th
  organization: Sun Microsystems, Switzerland
– sequence: 3
  givenname: R.
  surname: Guerraoui
  fullname: Guerraoui, R.
  organization: Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL), Switzerland
– sequence: 4
  givenname: S. B.
  surname: Handurukande
  fullname: Handurukande, S. B.
  organization: Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL), Switzerland
BookMark eNo9kN1OwzAMhQMMiTH6Blz0BQJ2nDTNFWITDKRJIH6uo_wVDap2asb70w6Ebyx_lq1zzjmbdX2XGLtEuEIAfW10zYkrCZxQG8mlRXXEihHTCA9MHrM5VoicSJqT_52QCAgzNgcCwY2WdMaKnD9hrOmugjm7Wa6f-dLlFMtV-533adh2H2XTD-VrcK3zbSpdF8uX1G4Pw7rPebsrl0PvYnB5f8FOG9fmVPz1BXu_v3tbPfDN0_pxdbvhWUi55z7UUEdTaVQUncOolNCGEqrgtZSyEnX0FLRQ6JUxqfEp1ElBoFjVSQMtmPj9m3eTwjRY3_df2SLYKSU7WrZkR9P2kIidUqIfjAlVpQ
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2005
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2005
DOI 10.1007/978-3-540-31794-4_15
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783540317944
3540317945
EISSN 1611-3349
Editor Quaglia, Paola
Priami, Corrado
Editor_xml – sequence: 1
  givenname: Corrado
  surname: Priami
  fullname: Priami, Corrado
  email: priami@cosbi.eu
– sequence: 2
  givenname: Paola
  surname: Quaglia
  fullname: Quaglia, Paola
  email: quaglia@dit.unitn.it
EndPage 290
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s244t-bc808d967153daa1d552793e15cb7444628db3c7251b599efbec8e50c3d68e703
ISBN 9783540241010
3540241019
ISSN 0302-9743
IngestDate Tue Jul 16 20:59:03 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s244t-bc808d967153daa1d552793e15cb7444628db3c7251b599efbec8e50c3d68e703
Notes This work was sponsored by European Project PEPITO (IST 2001 33234).
OpenAccessLink https://infoscience.epfl.ch/record/83387/files/neg--1397315590BGP-published.pdf
PageCount 18
ParticipantIDs springer_books_10_1007_978_3_540_31794_4_15
PublicationPlace Berlin, Heidelberg
PublicationPlace_xml – name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle IST/FET International Workshop, GC 2004 Rovereto, Italy, March 9-12, 2004 Revised Selected Papers
PublicationTitle Global Computing
Publisher Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Tygar, Dough
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, CA, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, MA, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: New York University, NY, USA
– sequence: 13
  givenname: Dough
  surname: Tygar
  fullname: Tygar, Dough
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbruecken, Germany
SSID ssj0000317960
ssj0002792
Score 1.6711847
Snippet This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory...
SourceID springer
SourceType Publisher
StartPage 273
SubjectTerms Broadcast streams
Content distribution
Fault-tolerance
Multicast
Peer-to-peer communications
Service overlay networks
System design
Title BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
URI http://link.springer.com/10.1007/978-3-540-31794-4_15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9tAEF0Vql44QEsRVAXtoTfLlsN6_XFAFUGQKKIRagPiZq29a4iApErsC7-emf1wAkGV0osVWyvbmWfPjGf2vSXkR8WVqipR-kksIj-SMfezVCKTK-lknKP-iVb7HMb962hwy28X0201u6QugvL5XV7J_6AKxwBXZMmugWx7UjgAvwFf2ALCsH2T_L4usy6p9XtmWQYXgEx3_F486Sb9r6BNmJs7twTHVeCN2hpwr1GzmZg2evjvYOGPJrKZNQ9YYdb10cDrBstPV7d35XchAErv7LHBM7sJmX8Ac83GMsTHx7He6UEoHv-FB2kqZClsQwtNpOYnl7aLMZzWenKY5xaacH5npQjp_UOjy9aYIGMI7URWS9sClwwfNcbLKeOFY9RWZEbL1HnWhC0F6WOzxuiK_3875YOhv_GjHGUINpIM3N7H0_PB5U1bhgtxBH4h2uCNeoqm8WTuytKB9F1nn9pKmfkXS1TM9y650lzXOctoh2whj4UiwQSM-Zl8UJMvZNsZl1rj7pKfLZZ0gSUFLKnDkgKW1GFJDZa0xfIrub44H531fbushj-HXK72izINU5nFCQQ7KURHoghfxlSHl0USRUhWlgUrE8h8C55lqoLXPFU8LJmMUwURYo9sTqYTtU9oKDuVVKgJmbBICFlwSHAZ-AUVyiguxQHxnAVyfFHmuVPJBnvlLAd75dpeOdrr21qjv5PNetaoQ8gJ6-LI4voC3ntXcw
link.rule.ids 785,786,790,799,27958
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Global+Computing&rft.au=Brahami%2C+M.&rft.au=Eugster%2C+P.+Th&rft.au=Guerraoui%2C+R.&rft.au=Handurukande%2C+S.+B.&rft.atitle=BGP-Based+Clustering+for+Scalable+and+Reliable+Gossip+Broadcast&rft.series=Lecture+Notes+in+Computer+Science&rft.pub=Springer+Berlin+Heidelberg&rft.isbn=9783540241010&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=273&rft.epage=290&rft_id=info:doi/10.1007%2F978-3-540-31794-4_15
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon