The performance of QoS-aware IP multicast routing protocols
The performance of QoS-aware IP multicast routing protocols
复制标题
QoS感知IP组播路由协议的性能
DOI：
10.1109/icoin.2001.905426
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Chyouhwa Chen
中科院分区：
文献类型：
--
作者：
Chih;Chyouhwa Chen
在支持具有动态组成员加入和QoS要求的实时IP组播应用方面，已经做了大量的研究。各种现有的贪婪QoS感知路由协议，如YAM和QoSMIC已被证明优于最短路径路由，如PIM和DVMRP。然而，它们仍然遭受由高控制开销、集中式组管理器的非鲁棒性以及比必要的加入延迟更长而导致的可扩展性差的问题。此外，大多数现有的动态加入协议执行最好的组成员是人口稠密或人口稀疏，但不是两者兼而有之。在本文中，我们介绍了一个分布式的候选人选择协议，名为DSDMR，这是能够自适应依赖于感测组密度的方式，自适应双向加入机制。我们评估我们的计划，使用广泛的模拟，发现DSDMR可以创建低成本的树接近最佳的贪婪策略，具有非常低的控制开销和连接延迟。
Much research has been done on supporting real-time IP multicast applications with dynamic group member joining and QoS requirements. Various existing greedy QoS-aware routing protocols, such as YAM and QoSMIC have been shown to outperform shortest-path heuristics, such as PIM and DVMRP. However they still suffer from the problem of poor scalability resulting from high control overhead, un-robustness for centralized group manager, and longer than necessary join latency. In addition, most existing dynamic join protocols perform best when group members are either densely populated or sparsely populated, but not both. In this paper, we introduce a distributed candidates selection protocol, named DSDMR, that is capable of self-adaptation depending on sensed group densities by ways of an adaptive two-direction join mechanism. We evaluate our scheme using extensive simulations and found that DSDMR can create low cost tree close to optimal greedy strategy with very low control overhead and join latency.