Presentation 2007-09-28
On the construction of the minimum depth tree for P2P system
Naoki MIWA, Liang ZHAO, Hiroshi NAGAMOCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is necessary to minimize delay from a sender with considering the ability of each broadcast node when we design P2P system for real time streaming. In this paper, to solve this problem, we aim at constructing the minimum depth tree satisfying outdegree constraint in a directed graph. This problem is generally NP-hard, so we propose an centering model algprithm and an distributing model algorithm. As a result of having experimented by using these algorithms, we have confirmed that these algorithms give a high quality solution compared with exact algorithm by using CPLEX.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) P2P system / minimum depth tree
Paper # CQ2007-54,OIS2007-44,IE2007-51
Date of Issue

Conference Information
Committee CQ
Conference Date 2007/9/20(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Communication Quality (CQ)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the construction of the minimum depth tree for P2P system
Sub Title (in English)
Keyword(1) P2P system
Keyword(2) minimum depth tree
1st Author's Name Naoki MIWA
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Liang ZHAO
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
3rd Author's Name Hiroshi NAGAMOCHI
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2007-09-28
Paper # CQ2007-54,OIS2007-44,IE2007-51
Volume (vol) vol.107
Number (no) 229
Page pp.pp.-
#Pages 6
Date of Issue