On multicasting steiner trees for delay and delay variation constraints

被引：0
作者：
Kim, Moonseong [1 ]
Bang, Young-Cheol
Choo, Hyunseung
机构：
[1] Sungkyunkwan Univ, Sch Informat & Commun Engn, Suwon 440746, South Korea
[2] Korea Polytech Univ, Dept Comp Engn, Gyeonggi Do 429793, South Korea
来源：
HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS | 2006年 / 4208卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The objective of multicasting is to find a tree that has a minimum total cost, which called the Steiner tree. Multicast routing algorithms should support the required QoS. There are two important Quality of Service (QoS) parameters that need to be guaranteed in order to support the real time and multimedia applications. Firstly, we consider the delay parameter where, the data sent from source need to reach destinations within a certain time limit (delay bound). Secondly, in addition to the delay constraint, we add the delay variation constraint. The delay variation constraint is a bound on the delay difference between any two destinations. Our research subject is Delay and delay Variation Bounded Steiner Tree (DVBST) problem. The problem has been proved to NP-complete. In this paper, we propose efficient algorithm for DVBST. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms.
引用
收藏
页码：447 / 456
页数：10
相关论文
共 50 条
[31]   Efficient algorithm for reducing delay variation on bounded multicast trees [J].
Kim, M ;
Bang, YC ;
Choo, H .
INFORMATION NETWORKING: NETWORKING TECHNOLOGIES FOR BROADBAND AND MOBILE NETWORKS, 2004, 3090 :440-450
[32]   A simulation analysis of multicasting in delay tolerant networks [J].
Abdulla, Muhammad ;
Simon, Robert .
PROCEEDINGS OF THE 2006 WINTER SIMULATION CONFERENCE, VOLS 1-5, 2006, :2234-+
[33]   Multicasting in Delay Tolerant Networks: Delegation Forwarding [J].
Wang, Yunsheng ;
Li, Xiaoguang ;
Wu, Jie .
2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
[34]   Delegation forwarding in delay tolerant networks multicasting [J].
Wang Y. ;
Li X. ;
Wu J. .
Journal of Communications, 2011, 6 (05) :384-392
[35]   Available bandwidth-based real-time multicast routing with constraints of delay and delay variation [J].
Huang, JQ ;
Yang, ZK ;
Du, X ;
Cheng, WQ .
ICT'2003: 10TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, VOLS I AND II, CONFERENCE PROCEEDINGS, 2003, :476-481
[36]   An effective algorithm for delay-constrained dynamic multicasting [J].
Xu, Zhengquan ;
Chen, Lin .
KNOWLEDGE-BASED SYSTEMS, 2006, 19 (03) :172-179
[37]   Multicasting in Delay Tolerant Networks: A Social Network Perspective [J].
Gao, Wei ;
Li, Qinghua ;
Zhao, Bo ;
Cao, Guohong .
MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2009, :299-308
[38]   Effective multicasting algorithm for dynamic membership with delay constraint [J].
Chen L. ;
Xu Z.-Q. .
Journal of Zhejiang University-SCIENCE A, 2006, 7 (2) :156-163
[39]   Controlled Epidemic Routing for Multicasting in Delay Tolerant Networks [J].
Abdulla, Muhammad ;
Simon, Robert .
2008 IEEE INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS & SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS), 2008, :1-10
[40]   Cost-constrained minimum-delay multicasting [J].
Tayu, S ;
Al-Mutairi, TG ;
Ueno, S .
SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE, 2005, 3381 :330-339
12345