On algorithm for the delay-and delay variation-bounded multicast trees based on estimation
Y Ahn, M Kim, YC Bang, H Choo - … 2005, Sorrento, Italy, September 21-23 …, 2005 - Springer
With the multicast technology, demands for the real-time group applications through
multicasting is getting more important. An essential factor of these real-time strategy is to …
multicasting is getting more important. An essential factor of these real-time strategy is to …
Efficient algorithm for reducing delay variation on bounded multicast trees
M Kim, YC Bang, H Choo - … ICOIN 2004, Busan, Korea, February 18-20 …, 2004 - Springer
With the proliferation of multimedia group applications, the construction of multicast trees
satisfying QoS requirements is becoming a problem of prime importance. In this paper, we …
satisfying QoS requirements is becoming a problem of prime importance. In this paper, we …
Advanced multicasting for DVBMT solution
M Kim, YC Bang, H Choo - … Conference, Kraków, Poland, June 6-9, 2004 …, 2004 - Springer
Our research subject in the present paper is concerned with the minimization of multicast
delay variation under the multicast end-to-end delay constraint. The delay-and delay …
delay variation under the multicast end-to-end delay constraint. The delay-and delay …
ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints
M Kim, MW Mutka, HY Kim - International Journal of …, 2011 - Wiley Online Library
With the spread of multimedia group applications, the construction of multicast trees
satisfying the Quality of Service (QoS) requirements becomes a problem of prime …
satisfying the Quality of Service (QoS) requirements becomes a problem of prime …
Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation
C Hyun-Seung - The KIPS Transactions: PartC, 2005 - koreascience.kr
With the proliferation of multimedia group applications, the construction of multicast trees
satisfying QoS requirements is becoming a problem of prime importance. In this paper, we …
satisfying QoS requirements is becoming a problem of prime importance. In this paper, we …
A fast and efficient heuristic algorithm for the delay-and delay variation-bounded multicast tree problem
PR Sheu, ST Chen - Computer Communications, 2002 - Elsevier
More and more multicast communications are becoming real-time. In real-time
communications, messages must be transmitted to their destination nodes within a certain …
communications, messages must be transmitted to their destination nodes within a certain …
Constructing delay-bounded multicast tree with optimal delay variation
H Cheng, J Cao, X Wang - 2006 IEEE International Conference …, 2006 - ieeexplore.ieee.org
Strict QoS requirements on delay and delay variation are required for many time-sensitive
applications. For real-time multicast communications, a multicast tree satisfying both end-to …
applications. For real-time multicast communications, a multicast tree satisfying both end-to …
On efficient core selection for reducing multicast delay variation under delay constraints
M Kim, YC Bang, HJ Lim, H Choo - IEICE transactions on …, 2006 - search.ieice.org
With the proliferation of multimedia group applications, the construction of multicast trees
satisfying the Quality of Service (QoS) requirements is becoming a problem of the prime …
satisfying the Quality of Service (QoS) requirements is becoming a problem of the prime …
A multicast tree algorithm considering maximum delay bound for real-time applications
S Ahn, DHC Du - Proceedings of LCN-21st Annual Conference …, 1996 - ieeexplore.ieee.org
For many multimedia multicast applications, especially those requiring real-time traffic, it is
important that the maximum delay bound requirement between any pair of group members …
important that the maximum delay bound requirement between any pair of group members …
Letter Computation of Constrained Multicast Trees Using a Genetic Algorithm
Q Sun, H Langendoerfer - European transactions on …, 1999 - Wiley Online Library
This paper shows that the genetic algorithm can be used to solve the delay‐constrained
least‐cost least‐inter‐destination‐delay‐variation multicast problem efficiently. The …
least‐cost least‐inter‐destination‐delay‐variation multicast problem efficiently. The …