Each tree sends different fractions of data in parallel
The proportion of data sent through each tree may be optimized by linear programming ( Balanced Multicasting [†] )
Data transfer with FPFR T1: Sends the former part T2: sends the latter part [†] den Burger et al. Balanced Multicasting: High-throughput Communication for Grid Applications (SC ‘2005) V1 V2
Tree Constructions T3: Third Tree (Partial Tree) S A B C T1: First Tree (Spanning) S A B C T2: Second Tree (Partial Tree) S A B C V1 V2 V3 Throughput of T1
Algorithm that maximizes aggregate bandwidth in general graph topologies
Algorithm that changes relay schedule by detecting bandwidth fluctuations
Future work
38.
All the graphs 0 10 20 30 40 50 60 70 80 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (a) [Low Bandwidth Variance] (Symmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 5 10 15 20 25 30 35 40 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (g) [Random Bandwidth among Clusters ] (Symmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 5 10 15 20 25 30 35 10 50 100 R e l a t i v e P e r f o r a m a n c e Number of Destinations Ours Depthfirst Dijkstra Random (best) Random (avg) (h) [Random Bandwidth among Clusters ] (Asymmetric) 0 10 20 30 40 50 60 70 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (b) [Low Bandwidth Variance] (Asymmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 5 10 15 20 25 30 35 40 45 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (c) [High Bandwidth Variance] (Symmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 5 10 15 20 25 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (d) [High Bandwidth Variance] (Asymmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 5 10 15 20 25 30 35 40 45 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (e) [Mixed Fast and Slow links ] (Symmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 2 4 6 8 10 12 14 16 18 20 10 50 100 R e l a t i v e P e r f o r m a n c e Number of Destinations (f) [Mixed Fast and Slow links ] (Asymmetric) Ours Depthfirst Dijkstra Random (best) Random (avg) 0 2 4 6 8 10 12 (1,10) (2,20) (3,30) (4,40) (5,50) R e l a t i v e P e r f o r m a m Ours Depthfirst Dijkstra (# of srcs, # of dests) (i) [Mulrtiple Souces] (Low Bandwidth Variance, Symmetric) Random (best) Random (avg)
BitTorrent gradually improves the transfer schedule by adaptively choosing the parent node
Since relaying structure created by BitTorrent has many branches, these links may become bottlenecks
Broadcast with BitTorrent [†] [†] Wei et al. Scheduling Independent Tasks Sharing Large Data Distributed with BitTorrent. (In GRID ’05) Transfer tree snapshot Bottleneck Link
Add a node reachable in the maximum bandwidth one by one
Effects of slow nodes are small
Some links may be used by many transfers, may become bottlenecks
Dijkstra Algorithm [†] [†] Wang et al. A novel data grid coherence protocol using pipeline-based aggressive copy method. (GPC, pages 484–495, 2007) Bottleneck Link
Be the first to comment