DVBMN-l: delay variation bounded multicast network with multiple paths

  • Authors:
  • Abhishek Bhattacharya;Zhenyu Yang

  • Affiliations:
  • School of Computing and Information Sciences, Florida International University, Miami, Florida;School of Computing and Information Sciences, Florida International University, Miami, Florida

  • Venue:
  • ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reach each destination node at almost the same time within a certain specified time limit. In addition, certain multi-stream systems also demand that different streams for each different destination node should reach with minimum delay variation. So, we propose the problem of minimizing both inter-destination and intra-destination delay variation along with the maximum delay bound and present efficient heuristic solution that achieves the tightest possible combined bound. This problem is NP-complete as shown in the literature. Computer simulation results approve that our heuristic is efficient with a low running time and the tightest combined delay variation.