检索结果-内蒙古大学图书馆

Performance evaluation of multisource Application Layer Multicast (ALM): Theoretical and simulative aspects

COMPUTER NETWORKS 2013年第6期57卷 1408-1424页

作者： Ke, Kai-Wei Huang, Chia-Hui Natl Taipei Univ Technol Inst Comp Sci & Informat Engn Taipei Taiwan

Multisource ALM routing protocol is an indispensable mechanism for efficient distribution of data from many sources to many receivers. The growing of Internet multimedia applications (e.g. videoconference and multiparty online game) which demand large network resources and call for multisource multicasting, has explicitly developed the necessity of an effective method to evaluate and compare the efficiency of various multisource multicast routings. We define a routing cost to be the total number of underlying hops traversed by multicast data over a multicast delivery tree. This study explores a multiplicative property to obtain the minimum cost of various multisource ALM routing protocols by simply multiplying the number of sources to the minimum cost in the single-source multicast. From theoretical and simulative studies, the multiplicative property has been proven through examining the minimum cost of multisource multicast delivery trees constructed by different multisource ALM routing protocols with source-specific tree (SST), core-based group-shared tree (GST-C) and bidirectional group-shared tree (GST-B), which are employed in the design of multisource ALM routing protocols. (C) 2013 Elsevier B.V. All rights reserved.

关键词： ALM Multisource multicast Minimum cost Multiplicative property source-specific tree Group-shared tree

来源：评论

学校读者我要写书评

暂无评论

A scalability comparison of GST and SST MANET multicast routing algorithms

引用

COMPUTER COMMUNICATIONS 2007年第18期30卷 3851-3858页

作者： Kim, Sang-Chul Kookmin Univ Sch Comp Sci Seoul 136702 South Korea

Since network resource of mobile ad hoe network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MA NET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted. (C) 2007 Elsevier B.V. All rights reserved.

关键词： ad hoc network multicasting protocols complexity group shared tree source-specific tree

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：