| 摘要: |
| 近年来提出的许多面向单个数据源设计的多播树并不能简单扩展到任意源多播系统中,因为针对每个源建立一个树代价高昂.而已存在的一些允许多数据源的P2P(peer-to-peer)系统的维护量大,在体现结点能力差异等方面缺少灵活性.提出一个任意源覆盖多播服务方案,并具有结点能力约束性能.它建立在非DHT(distributed hash table)覆盖网络上,无须建立显式的多播树.设计了两种分布式多播算法,它们将任意源的多播信息传送到所有结点的期望跳数是O(logcn),其中,c是平均结点能力,n是多播组中的结点个数. |
| 关键词: 覆盖多播 能力 非DHT(distributed hash table)环 跳数复杂性 通信复杂性 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Natural Science Foundation of China under Grant No.60573142(国家自然科学基金);the Shanghai Natural Science Foundation of China under Grant No.02ZD14066(上海自然科学基金) |
|
| A Method for Any-Source Capacity-Constrained Overlay Multicast |
|
CHEN Shi-Ping,SHI Bai-Le
|
| Abstract: |
| 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. |
| Key words: overlay multicast capacity non-DHT (distributed hash table) ring hop complexity communication complexity |
