Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On algorithm for efficiently combining two independent measures in routing paths
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
On multicasting steiner trees for delay and delay variation constraints
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
An efficient multicast tree with delay and delay variation constraints
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
The core-based multicast routing protocol plays a significant role in many multimedia applications such as video-conferencing, replicated database updating and querying, and etc. However, existing core-based multicast routing protocols construct only the shortest paths between the core and the members in a multicast group without optimizing the quality of service requirements. In this paper, we propose an efficient algorithm for multicast delay variations and tree cost. The efficiency of our algorithm is verified through the performance evaluation and the enhancements are up to about 2.5% ~ 4.5% and 3.8% ~ 15.5% in terms of the multicast delay variation and the tree cost, respectively. The time complexity of our algorithm is O(m(l + n log n)).