DCADH: A GENERATING ALGORITHM OF DELAY-CONSTRAINED MULTICAST ROUTING TREE

Yu-xi Zhu, Ling Zhou

Abstract

Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different location. With the development of Internet, Multicast is widely applied in all kinds of multimedia real-time application: distributed multimedia systems, collaborative computing, video-conferencing, distance education, etc. In order to construct a delay-constrained multicast routing tree, average distance heuristic (ADH) algorithm is analyzed firstly, then by using which a delay-constrained algorithm called DCADH is presented.By using ADH a least-cost multicast tree can be constructed; if the path delay can’t meet the delay upper bound,a shortest delay path which is computed by Dijkstra’s algorithm will be merged into the existing multicast tree to meet the delay upper bound. Simulation experiments show that DCADH has a good performance in achieving a low-cost multicast tree.

References

  1. Salama H. F., 1997. Evaluation of Multicast Routing Algorithm for Real-Time Communication on High-Speed Networks[J].IEEE Journal on Selected Areas in Communication.
  2. Feng G., Douligers C., 2001. A Neural Network Method for Minimum Delay Routing in Packet Switched Networks[J]. Computer Communication.
  3. Yu Y. P., Qiu P. L., 2002. An improved algorithm for Steiner trees. Journal of China Institute of Communications.
  4. Zhou L., Sun Y. M., 2008. A Delay-Constrained Steiner Tree Algorithm Using MPH. Journal of Computer Research and Development.
  5. Waxman B. M., 1988. Routing of Multipoint Connections[J]. IEEE Journal on Selected Areas in Communications.
  6. Sahasrabuddhe L. H., Mukherjee B., 2000. Multicast Routing Algorithms and Protocols: A Tutorial. IEEE Network.
  7. Kompella V. P., Pasquale J. C., and Polyzos G. C., 2000. Multicasting for multimedia applications [C]. Proc. IEEE INFOCOM'9.
Download


Paper Citation


in Harvard Style

Zhu Y. and Zhou L. (2009). DCADH: A GENERATING ALGORITHM OF DELAY-CONSTRAINED MULTICAST ROUTING TREE . In Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2009) ISBN 978-989-674-007-8, pages 181-184. DOI: 10.5220/0002182501810184


in Bibtex Style

@conference{sigmap09,
author={Yu-xi Zhu and Ling Zhou},
title={DCADH: A GENERATING ALGORITHM OF DELAY-CONSTRAINED MULTICAST ROUTING TREE},
booktitle={Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2009)},
year={2009},
pages={181-184},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002182501810184},
isbn={978-989-674-007-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Signal Processing and Multimedia Applications - Volume 1: SIGMAP, (ICETE 2009)
TI - DCADH: A GENERATING ALGORITHM OF DELAY-CONSTRAINED MULTICAST ROUTING TREE
SN - 978-989-674-007-8
AU - Zhu Y.
AU - Zhou L.
PY - 2009
SP - 181
EP - 184
DO - 10.5220/0002182501810184