TY - GEN
T1 - On a decentralized approach to tree construction in hybrid P2P networks
AU - Lu, Xukang
AU - Wu, Qishi
AU - Lin, Yunyue
AU - Li, Runzhi
PY - 2010
Y1 - 2010
N2 - The client-server architecture widely adopted on the Internet is not adequate to meet the ever-increasing user loads and bandwidth demands in live streaming systems especially for multimedia content delivery. Peer-to-peer (P2P) overlay networks provide excellent system scalability and high resource utilization, which make it an attractive solution to this problem. We consider a hybrid hierarchical P2P overlay network that consists of both super and normal peers to support live streaming applications. This architecture is built upon a tree-structured network of super peers, which organize normal peers into clusters. The tree construction process has a significant impact on the overall system performance. We formulate a specific type of problem, max-minTC, to maximize the minimum node throughput in tree construction, where the system's stream rate is optimized by constructing an efficient spanning tree among super peers. We present a decentralized approach where super peers run the same algorithm in parallel to derive a tree from an identical database describing the topology of the streaming system. This approach is able to quickly converge to a new tree upon the detection of any topological changes in super peers. The performance superiority of the proposed solution is illustrated by extensive simulations on a large set of simulated networks of various sizes from small to large scales in comparison with other methods.
AB - The client-server architecture widely adopted on the Internet is not adequate to meet the ever-increasing user loads and bandwidth demands in live streaming systems especially for multimedia content delivery. Peer-to-peer (P2P) overlay networks provide excellent system scalability and high resource utilization, which make it an attractive solution to this problem. We consider a hybrid hierarchical P2P overlay network that consists of both super and normal peers to support live streaming applications. This architecture is built upon a tree-structured network of super peers, which organize normal peers into clusters. The tree construction process has a significant impact on the overall system performance. We formulate a specific type of problem, max-minTC, to maximize the minimum node throughput in tree construction, where the system's stream rate is optimized by constructing an efficient spanning tree among super peers. We present a decentralized approach where super peers run the same algorithm in parallel to derive a tree from an identical database describing the topology of the streaming system. This approach is able to quickly converge to a new tree upon the detection of any topological changes in super peers. The performance superiority of the proposed solution is illustrated by extensive simulations on a large set of simulated networks of various sizes from small to large scales in comparison with other methods.
KW - Overlay networks
KW - P2P
KW - distributed algorithm
KW - spanning tree
UR - http://www.scopus.com/inward/record.url?scp=79955009119&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955009119&partnerID=8YFLogxK
U2 - 10.1109/LCN.2010.5735684
DO - 10.1109/LCN.2010.5735684
M3 - Conference contribution
AN - SCOPUS:79955009119
SN - 9781424483877
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 112
EP - 119
BT - 2010 IEEE 35th Conference on Local Computer Networks, LCN 2010
T2 - 35th Annual IEEE Conference on Local Computer Networks, LCN 2010
Y2 - 10 October 2010 through 14 October 2010
ER -