An Optimized Link Selection Function for Solving Delay-constrained Multicast Routing Problem

DOI

10.2991/icecee-15.2015.7How to use a DOI?

Keywords

Routing Optimization; Delay-constrained; Link Selection Function

Abstract

In multicast routing messages are sent from the source node to all destination nodes. In order to meet QoS requirements an optimizing algorithm is needed. We propose an optimization algorithm based on the KPP and QDMR algorithm to do so. This algorithm uses optimized link selection function to modify the paths from the source node to the destinations, the nodes whose delay are smaller than the average achieves a new delay as big as possible and the nodes whose delay are above the average achieves a new delay as small as possible. This can give an effective optimal solution to multicast routing problem.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yuanchen Li
AU  - Weiqun Liu
PY  - 2015/06
DA  - 2015/06
TI  - An Optimized Link Selection Function for Solving Delay-constrained Multicast Routing Problem
BT  - Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics
PB  - Atlantis Press
SP  - 30
EP  - 33
SN  - 2352-538X
UR  - https://doi.org/10.2991/icecee-15.2015.7
DO  - 10.2991/icecee-15.2015.7
ID  - Li2015/06
ER  -