Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2009-06-01
Proc. of the 17th Intl. Conf. on Control Systems and Computer Science (CSCS), vol. 2, pp. 445-452, 2009 (3rd Intl. Workshop on
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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.
Andreica Mugurel Ionut
Tapus Nicolae
Tirsa Eliana-Dina
No associations
LandOfFree
Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data Distribution Optimization using Offline Algorithms and a Peer-to-Peer Small Diameter Tree Architecture with Bounded Node Degrees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234254