Treffer: Brief Announcement: Decentralized Construction of Multicast Trees Embedded into P2P Overlay Networks based on Virtual Geometric Coordinates
Title:
Brief Announcement: Decentralized Construction of Multicast Trees Embedded into P2P Overlay Networks based on Virtual Geometric Coordinates
Contributors:
Parallel and Distributed Systems Laboratory [Bucarest], Polytechnic University of Bucharest [Romania] = Université Politehnica de Bucarest [Roumanie] = Universitatea Națională de Știință și Tehnologie Politehnica București [România] (UPB), CLUSTER-BASED WEB SERVERS BUILT ON MULTI-CORE ARCHITECTURES (project number PN II - IDEI ID_1679/2008, contract number 736/2009, financed by CNCSIS-UEFISCSU), European Project: 216217,EC:FP7:ICT,FP7-ICT-2007-1,P2P-NEXT(2008)
Source:
Proceedings of the 29th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) (ISBN: 978-1-60558-888-9). :283-284
Publisher Information:
CCSD, 2010.
Publication Year:
2010
Subject Terms:
Subject Geographic:
Original Identifier:
HAL: hal-00511730
Document Type:
Konferenz
conferenceObject<br />Conference papers
Language:
English
Relation:
info:eu-repo/grantAgreement/EC/FP7/216217/EU/Next Generation Peer-to-Peer Content Delivery Platform/P2P-NEXT
Access URL:
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.hal.00511730v1
Database:
HAL
Weitere Informationen
The attached archives contain: 1) simulation scripts (written in Python) 2) presentation slides 3) related algorithmic contest tasks (some of the distributed techniques presented in the paper are inspired from geometric algorithms and data structures)
In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known.