一种考虑延迟和丢包率的最小代价应用层组播树

姜山; 郑庆华; 南宏朕

您当前的位置：

首页 >

文章列表页 >

一种考虑延迟和丢包率的最小代价应用层组播树

更新时间：2025-07-09

- 一种考虑延迟和丢包率的最小代价应用层组播树
- A Minimum Cost Application-Level Multicast Tree for Concerning Delay and Loss Rate
- 西安交通大学学报 2011年45卷第2期页码：1-5
- 作者机构：
  
  西安交通大学电子与信息工程学院,西安,710049
- 作者简介：
- 基金信息：
  
  : 2010-07-28. 作者简介: 姜山(1979-),男,博士生;郑庆华(联系人),男,教授,博士生导师. 基金项目:国家科技支撑计划资助项目(2006BAJ07B06);国家杰出青年科学基金资助项目(60825202);国家自然科学基金资助项目(60633020);国家高技术研究发展计划资助项目(2008AA01Z131)
- DOI：
  中图分类号： TP393
- 网络首发：2011-02-10，
  
  纸质出版：2011
- 稿件说明：
移动端阅览
姜山, 郑庆华, 南宏朕. 一种考虑延迟和丢包率的最小代价应用层组播树[J]. 西安交通大学学报, 2011,45(2):1-5.

A Minimum Cost Application-Level Multicast Tree for Concerning Delay and Loss Rate[J]. 2011, 45(2): 1-5.
姜山, 郑庆华, 南宏朕. 一种考虑延迟和丢包率的最小代价应用层组播树[J]. 西安交通大学学报, 2011,45(2):1-5. DOI：

A Minimum Cost Application-Level Multicast Tree for Concerning Delay and Loss Rate[J]. 2011, 45(2): 1-5. DOI：

摘要

针对度约束方式难以减少应用层组播树的延迟和丢包率的问题

提出了一种延迟和丢包率综合代价最小的应用层组播树构树算法.为避免度约束的局限性

给出一个包含延迟和丢包率的复合代价函数

以此来计算传输代价

进而构建了一种最小复合代价组播树的问题模型.为了求解该问题模型

提出了一种基于最大延迟路径贪婪算法的变异算法

同时在构树时对总传输代价进行优化.通过实验

给出复合代价函数的具体参数建议.对比相关算法

文中的构树算法在总传输代价方面有更好的性能.

Abstract

It is not efficient for the approach of constraining outdegree to enhance delay and loss rate synthetically for an application-level multicast tree. This paper proposes an application-level multicast tree which achieves minimum cost in terms of delay and loss rate. A cost function which consists of delay and loss rate is given to compute transmission cost of the multicast tree

and the problem model about how to construct the minimum multiplex-cost multicast tree is also given. Unlike existing problem models

this model abandons the approach of constraining outdegree. Furthermore

a variation of the maximal delay path greed algorithm is proposed to address the problem model. This variation algorithm optimizes total cost of a multicast tree. Finally

our extensive experimental results help to give the concrete suggestion about the parameters which the cost function involves

and demonstrate that the proposed application-level multicast tree construction algorithm has higher efficiency in total cost of the multicast tree than another related algorithm has.

关键词

Keywords

references

HOSSEINI M, AHMED D, SHIRMOHAMMADI S, et al. A survey of application-layer multicast protocols[J]. IEEE Communications Surveys and Tutorials, 2007, 9(3): 58-74.

GUO Deke, CHEN Honghui, LIU Yunhao, et al. Bake: a balanced kautz tree structure for peer-to-peer networks[C]∥ Proceedings of INFOCOM. Piscataway, NJ, USA: IEEE, 2008: 2450-2457.

DAN G, FODOR V, CHATZIDROSSOS I. On the performance of multiple-tree-based peer-to-peer live streaming[C]∥Proceedings of INFOCOM. Piscataway, NJ, USA: IEEE, 2007: 2556-2560.

POMPILI D, SCOGLIO C, LOPEZ L. Multicast algorithms in service overlay networks[J]. Computer Communications, 2008, 31(3): 489-505.

TAN Suwei, WATERS G, CRAWFORD J, et al. A survey and performance evaluation of scalable tree-based application layer multicast protocol, Technical Report No.9-03[R]. Kent, UK: University of Kent, 2003:1-35.

BOLOT J C, CEDEX S A. The case for FEC-based error control for packet audio in the Internet[J].ACM Multimedia Systems, 1997.

曹佳, 鲁士文. 应用层组播的最小延迟生成树算法[J]. 软件学报, 2005, 16(10): 1766-1773.

CAO Jia, LU Shiwen. A minimum delay spanning tree algorithm for the application-layer multicast[J].Journal of Software, 2005, 16(10): 1766-1773.

HOSSEINI M, GEORGANAS N D. End system multicast routing for multi-party videoconferencing applications[J]. Computer Communications, 2006,29(11): 2046-2065.

BROASH E, SHAVITT Y. Approximation and heuristic algorithms for minimum delay application-layer multicast trees[C]∥Proceedings of INFOCOM. Piscataway,NJ,USA: IEEE, 2004:2697-2707.

SHI S Y, TUMER J S. Multicast routing and bandwidth dimensioning in overlay networks[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(8):1444-1455.

LUO Chong, WANG Wei, TANG Jian, et al. A multiparty videoconferencing system over an application-level multicast protocol [J]. IEEE Transactions on Multimedia, 2007, 9(8):1621-1632.

BLANCHARD B S, FABRYCKY W J. Systems engineering and analysis [M]. 2nd ed, Englewood Cliffs, NJ, USA: Prentice Hall, 1990.

NS, the network simulator [EB/OL].(2008-06-17)[2010-07-01].http:∥www.isi.edu/nsnam/ns/.

ZEGURA E W, CALVERT K L, BHATTACHARJEE S. How to model an internet work[C]∥ Proceedings of INFOCOM. Piscataway, NJ, USA: IEEE, 1996:594-602.

可演化网络中移动代理的性能分析及优化方法. 西安交通大学学报,2010, 44(12):5-9.

移动Ad Hoc网络中提高路由稳定性的动态备份多径路由. 西安交通大学学报,2010, 44(12):16-21.

一种高吞吐量的无线传感器网络多信道MAC协议. 西安交通大学学报,2010, 44(12):32-37.

网络生存适应性的多目标评估. 西安交通大学学报,2010, 44(10):1-7.

传感器数据中事件样本与错误样本的系统化区分框架. 西安交通大学学报,2010, 44(10):30-35.

一种改进的加权质心定位算法. 西安交通大学学报,2010, 44(8):1-4.

面向目标覆盖的无线传感器网络确定性部署方法. 西安交通大学学报,2010, 44(6):6-9.

使用交叉熵检测和分类网络异常流量. 西安交通大学学报,2010, 44(6):10-15.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

一种支持大规模应用层组播的混合拓扑覆盖网络

不同板叠材料热声热机能量转换过程数值模拟研究

超临界水异常区域热力学特性研究

采用机器学习的大规模并行程序I/O性能建模与预测方法

水蒸气掺混对氨裂解气旋流燃烧与排放特性的影响研究