Affordable Access

On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Communication
  • Computer Science
  • Mathematics


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 importance. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that our proposed scheme outperforms that of DDVCA [18] that is known to be most effective so far in any network topology. The enhancement is up to about 11.1% in terms of normalized surcharge for DDVCA. The time complexity of our algorithm is ( ).Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.