ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints |
| |
Authors: | Moonseong Kim Matt W. Mutka Hye‐Young Kim |
| |
Affiliation: | 1. Information and Communications Examination Bureau, Korean Intellectual Property Office, Korea;2. Department of Computer Science and Engineering, Michigan State University, U.S.A.;3. School of Games/Game Software, Hongik University, Korea |
| |
Abstract: | With the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real‐time applications is to optimize the delay‐ and delay variation‐bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end‐to‐end delay within an upper bound. The DVBMT problem is known as an NP‐complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn2), which is comparable to the well‐known DDVCA. Copyright © 2010 John Wiley & Sons, Ltd. |
| |
Keywords: | multicast routing algorithm delay‐ and delay variation‐bounded multicast tree (DVBMT) problem Steiner trees |
|
|