Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees
Distributed, Parallel, and Cluster Computing
2009-06-03 v1 Data Structures and Algorithms
Networking and Internet Architecture
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.
Cite
@article{arxiv.0906.0379,
title = {Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees},
author = {Mugurel Ionut Andreica and Eliana-Dina Tirsa and Nicolae Tapus},
journal= {arXiv preprint arXiv:0906.0379},
year = {2009}
}