Verlagslink DOI: 10.1109/LCN.2009.5355130
Titel: BIDIR-SAM: Large-scale content distribution in structured overlay networks
Sprache: Englisch
Autorenschaft: Wählisch, Matthias 
Schmidt, Thomas C.  
Wittenburg, Georg 
Herausgeber*In: Younis, Mohamed 
Chou, Chun Tung 
Weitere beteiligte Einrichtungen: IEEE Computer Society 
IEEE Computer Society. Technical Committee on Computer Communications 
Erscheinungsdatum: 2009
Verlag: IEEE
Teil der Schriftenreihe: IEEE 34th Conference on Local Computer Networks, 2009 : LCN 2009 ; 20 - 23 Oct. 2009, Zurich, Switzerland ; [including workshops papers] 
Anfangsseite: 372
Endseite: 375
Konferenz: Annual IEEE Conference on Local Computer Networks 2009 
Zusammenfassung: 
IPTV, software replication and other large-scale distribution tasks urge the need for efficient multicast mechanisms in overlay networks. Current multicast solutions on the application layer are either efficient, structured, but inflexible, or flexible, unstructured, but of lesser efficiency. This paper introduces Scalable Adaptive Multicast on BI-DIRectional shared trees, a new structured but flexible approach to content distribution. BIDIR-SAM is the first DHT-based overlay multicast that distributes any source multicast data according to source-specific shortest path trees. Built upon bi-directional shared prefix trees, the approach distributes packets uniquely via fully redundant paths, and allows for highly flexible network adaptivity. Guided by an overlay abstraction, it operates directly on top of a prefix routing and does not rely on any kind of rendezvous point or bootstrapping.
URI: http://hdl.handle.net/20.500.12738/3200
ISBN: 978-1-4244-4488-5
978-1-4244-4487-8
1-4244-4487-X
1-4244-4488-8
Einrichtung: Department Informatik 
Fakultät Technik und Informatik 
Dokumenttyp: Konferenzveröffentlichung
Enthalten in den Sammlungen:Publications without full text

Zur Langanzeige

Seitenansichten

69
checked on 26.12.2024

Google ScholarTM

Prüfe

HAW Katalog

Prüfe

Volltext ergänzen

Feedback zu diesem Datensatz


Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.