Best Fit Algorithm for Base Tree Construction and patch server selection next up previous
Next: Best-Fit (BF) Algorithm Up: P2Cast: Peer-to-peer Patching Scheme Previous: Failure Recovery


Best Fit Algorithm for Base Tree Construction and patch server selection

In this section we first describe the Best Fit (BF) algorithm that constructs the base tree and selects the patch server in P2Cast. We then present two variations of BF algorithm, BF-delay and BF-delay-approx. All these algorithms can also be used for the base stream recovery and patch recovery.

Subsections

Yang Guo 2003-03-27