Delay constraint supported overlay multicast routing protocol

The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed. Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize in...

Full description

Saved in:
Bibliographic Details
Main Authors: WU Jia-gao, YANG Yin-ying, CHEN Yi-xin, YE Xiao-guo
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2005-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/74667755/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841537279811649536
author WU Jia-gao
YANG Yin-ying
CHEN Yi-xin
YE Xiao-guo
author_facet WU Jia-gao
YANG Yin-ying
CHEN Yi-xin
YE Xiao-guo
author_sort WU Jia-gao
collection DOAJ
description The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed. Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize into a sourced-based overlay multicast tree. DBTP used a new heuristic local optimum algorithm, which could make trade-off between delay and cost of the multicast tree by adjusting a heuristic parameter. The simulation result shows that DBTP can both achieve the admission rate of members highly under whether static or dynamic node model through choosing a proper value of the heuristic parameter.
format Article
id doaj-art-82232f47162c4bfa938ad15e874c1035
institution Kabale University
issn 1000-436X
language zho
publishDate 2005-01-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-82232f47162c4bfa938ad15e874c10352025-01-14T08:41:44ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2005-01-01132074667755Delay constraint supported overlay multicast routing protocolWU Jia-gaoYANG Yin-yingCHEN Yi-xinYE Xiao-guoThe degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed. Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize into a sourced-based overlay multicast tree. DBTP used a new heuristic local optimum algorithm, which could make trade-off between delay and cost of the multicast tree by adjusting a heuristic parameter. The simulation result shows that DBTP can both achieve the admission rate of members highly under whether static or dynamic node model through choosing a proper value of the heuristic parameter.http://www.joconline.com.cn/zh/article/74667755/overlay multicastrouting protocolheuristic algorithmdelay constraint
spellingShingle WU Jia-gao
YANG Yin-ying
CHEN Yi-xin
YE Xiao-guo
Delay constraint supported overlay multicast routing protocol
Tongxin xuebao
overlay multicast
routing protocol
heuristic algorithm
delay constraint
title Delay constraint supported overlay multicast routing protocol
title_full Delay constraint supported overlay multicast routing protocol
title_fullStr Delay constraint supported overlay multicast routing protocol
title_full_unstemmed Delay constraint supported overlay multicast routing protocol
title_short Delay constraint supported overlay multicast routing protocol
title_sort delay constraint supported overlay multicast routing protocol
topic overlay multicast
routing protocol
heuristic algorithm
delay constraint
url http://www.joconline.com.cn/zh/article/74667755/
work_keys_str_mv AT wujiagao delayconstraintsupportedoverlaymulticastroutingprotocol
AT yangyinying delayconstraintsupportedoverlaymulticastroutingprotocol
AT chenyixin delayconstraintsupportedoverlaymulticastroutingprotocol
AT yexiaoguo delayconstraintsupportedoverlaymulticastroutingprotocol