首页> 外文会议>International Conference on Internet Computing IC'2001 Vol.2 Jun 25-28, 2001 Las Vegas, Nevada, USA >AN ACK-TREE CREATION MECHANISM USING TOP-DOWN SCHEME FOR TREE-BASED RELIABLE MULTICAST TRANSPORT
【24h】

AN ACK-TREE CREATION MECHANISM USING TOP-DOWN SCHEME FOR TREE-BASED RELIABLE MULTICAST TRANSPORT

机译:基于自上而下的基于树的可靠多播传输的ACK树创建机制

获取原文
获取原文并翻译 | 示例

摘要

For reliable multicast service, hierarchical tree-based mechanism has been proposed and actively studied. This mechanism is known to provide high scalability, but needs to build an efficient logical ACK-tree in transport layer. Many studies have been made, and bottom-up approach has been mainly used. This approach has benefits from parallel tree construction for receivers, while it brings large message overhead. Therefore, this paper proposes a top-down based mechanism which reduce the message overhead during tree creating process and can simply guarantee loop-freeness by step-wise mannered tree building. Through experimental simulations, it shows that the proposed mechanism has less message overhead, while the bottom-up scheme has better performance on tree configuration time in a large session. So, it is recommended that the top-down and bottom-up schemes will be selectively used according to the requirements of the concerned multicast applications.
机译:为了可靠的组播服务,已经提出并积极研究了基于分层树的机制。已知该机制可提供高可伸缩性,但是需要在传输层中构建有效的逻辑ACK树。已经进行了许多研究,并且主要使用了自下而上的方法。这种方法受益于接收者的并行树结构,同时带来大量消息开销。因此,本文提出了一种基于自上而下的机制,该机制减少了树创建过程中的消息开销,并且可以通过逐步构造树来简单地保证无循环性。通过实验仿真,表明所提出的机制具有较小的消息开销,而自下而上的方案在大型会话中的树配置时间上具有更好的性能。因此,建议根据相关的多播应用程序的要求有选择地使用自顶向下和自底向上的方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号