Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees

Mugurel Ionut Andreica (1) , Eliana-Dina Tirsa (1) , Nicolae Tapus (1)

1 Parallel and Distributed Systems Laboratory [Bucarest]

Multicast data transfers occur in many distributed systems and applications (e.g. IPTV, Grids, content delivery networks). Because of this, efficient multicast data distribution optimization techniques are required. In the first part of this paper we present a small diameter, bounded degree, collaborative peer-to-peer multicast tree architecture, which supports dynamic node arrivals and departures making local decisions only. The architecture is fault tolerant and, at low arrival and departure rates, converges towards a theoretically optimal structure. In the second part of the paper we consider several offline data distribution optimization problems, for which we present novel and time-efficient algorithmic solutions.

Mots clés: Peer-to-Peer; Multicast; Data distribution

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Algorithme et structure de données [cs.DS]

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Nicolae Tapus. Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees. Proceedings of the 17th International Conference on Control Systems and Computer Science (CSCS) (ISSN: 2066-4451), May 2009, Bucharest, Romania. pp.445-452. ⟨hal-00467813⟩