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

TL;DR

This paper introduces a peer-to-peer multicast tree architecture supporting dynamic, fault-tolerant data distribution with bounded node degrees, and presents efficient algorithms for offline data distribution optimization problems.

Contribution

It proposes a small diameter, bounded degree peer-to-peer multicast architecture and develops novel, efficient algorithms for offline data distribution optimization.

Findings

Supports dynamic node arrivals and departures with local decisions.

Converges towards a theoretically optimal structure under low churn.

Provides time-efficient solutions for complex offline data distribution problems.

Abstract

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.