%0 Journal Article
%T A Method for Any-Source Capacity-Constrained Overlay Multicast<br>一种具有能力约束性能的任意源覆盖多播方法
%A CHEN Shi-Ping
%A SHI Bai-Le
%A <br>陈世平
%A 施伯乐
%J 软件学报
%D 2006
%I 
%X Many overlay multicast systems proposed in recent years focus on designing an optimized tree for a single data source. They cannot be extended to any-source multicasting because one tree per source is too costly. The existing P2P (peer-to-peer) systems that allow many data sources have high maintenance overhead and lack the flexibility in supporting host diversity. This paper proposes an any-source capacity-constrained overlay multicast service based on a non-DHT (distributed hash table) overlay network specifically suitable for the purpose of multicast. The nodes have different capacities in supporting different numbers of direct children during a multicast session. No explicit multicast trees are maintained on top of the overlay. This paper presents two distributed multicast algorithms that are able to deliver a multicast message from any source to all nodes in the expected O(logcn) hops, which is asymptotically optimal, where c is the average node capacity and n is the number of members in a multicast group.
%K overlay multicast
%K capacity
%K non-DHT (distributed hash table) ring
%K hop complexity
%K communication complexity<br>覆盖多播
%K 能力
%K 非DHT(distributed
%K hash
%K table)环
%K 跳数复杂性
%K 通信复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0E83A72AF2507F3F&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=F3090AE9B60B7ED1&sid=7B2D57A5EE0FC8C7&eid=7ABC4D8D4954AF61&journal_id=1000-9825&journal_name=软件学报&referenced_num=4&reference_num=17