### Abstract

We consider structured peer-to-peer (P2P) networks for distributing streaming data such as real-time video. In such P2P networks, each chunk of data is transferred from the server to all the peers using a data distribution tree. The number of trees and the number of children in each tree contribute to the overhead in the data distribution process. In this paper, we show that the maximum streaming rate can be achieved using O(log N) trees in a network of N peers with homogeneous upload capacities, where each peer has O(1) children in each tree. It is further shown that O(1) trees suffice to achieve a near-maximum streaming rate with heterogeneous upload capacities. The solution involves mapping the tree construction problem to a novel Block Packing problem where two-dimensional blocks are packed into a two-dimensional bin subject to some packing constraints. The block packing problem allows us to visualize network bandwidth usage, thus facilitating a particular way to construct trees which establish the above bounds.

Original language | English (US) |
---|---|

Title of host publication | 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings |

DOIs | |

State | Published - Sep 26 2011 |

Event | 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Maui, HI, United States Duration: Jul 31 2011 → Aug 4 2011 |

### Publication series

Name | Proceedings - International Conference on Computer Communications and Networks, ICCCN |
---|---|

ISSN (Print) | 1095-2055 |

### Other

Other | 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 |
---|---|

Country | United States |

City | Maui, HI |

Period | 7/31/11 → 8/4/11 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Networks and Communications
- Hardware and Architecture
- Software

### Cite this

*2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings*[6005902] (Proceedings - International Conference on Computer Communications and Networks, ICCCN). https://doi.org/10.1109/ICCCN.2011.6005902

**Achieving the maximum P2P streaming rate using a small number of trees.** / Kim, Joohwan; Srikant, R.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings.*, 6005902, Proceedings - International Conference on Computer Communications and Networks, ICCCN, 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011, Maui, HI, United States, 7/31/11. https://doi.org/10.1109/ICCCN.2011.6005902

}

TY - GEN

T1 - Achieving the maximum P2P streaming rate using a small number of trees

AU - Kim, Joohwan

AU - Srikant, R.

PY - 2011/9/26

Y1 - 2011/9/26

N2 - We consider structured peer-to-peer (P2P) networks for distributing streaming data such as real-time video. In such P2P networks, each chunk of data is transferred from the server to all the peers using a data distribution tree. The number of trees and the number of children in each tree contribute to the overhead in the data distribution process. In this paper, we show that the maximum streaming rate can be achieved using O(log N) trees in a network of N peers with homogeneous upload capacities, where each peer has O(1) children in each tree. It is further shown that O(1) trees suffice to achieve a near-maximum streaming rate with heterogeneous upload capacities. The solution involves mapping the tree construction problem to a novel Block Packing problem where two-dimensional blocks are packed into a two-dimensional bin subject to some packing constraints. The block packing problem allows us to visualize network bandwidth usage, thus facilitating a particular way to construct trees which establish the above bounds.

AB - We consider structured peer-to-peer (P2P) networks for distributing streaming data such as real-time video. In such P2P networks, each chunk of data is transferred from the server to all the peers using a data distribution tree. The number of trees and the number of children in each tree contribute to the overhead in the data distribution process. In this paper, we show that the maximum streaming rate can be achieved using O(log N) trees in a network of N peers with homogeneous upload capacities, where each peer has O(1) children in each tree. It is further shown that O(1) trees suffice to achieve a near-maximum streaming rate with heterogeneous upload capacities. The solution involves mapping the tree construction problem to a novel Block Packing problem where two-dimensional blocks are packed into a two-dimensional bin subject to some packing constraints. The block packing problem allows us to visualize network bandwidth usage, thus facilitating a particular way to construct trees which establish the above bounds.

UR - http://www.scopus.com/inward/record.url?scp=80053049821&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053049821&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.2011.6005902

DO - 10.1109/ICCCN.2011.6005902

M3 - Conference contribution

AN - SCOPUS:80053049821

SN - 9781457706387

T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN

BT - 2011 20th International Conference on Computer Communications and Networks, ICCCN 2011 - Proceedings

ER -