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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |