On-demand multicast routing protocol with efficient route discovery

  • Authors:
  • Mohammad-Amin Kharraz;Hamid Sarbazi-Azad;Albert Y. Zomaya

  • Affiliations:
  • Faculty of Science and Technology, Sharif University of Technology-International Campus, Iran and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran;Department of Computer Engineering, Sharif University of Technology, Tehran, Iran and School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran;Centre for Distributed and High Performance Computing, School of Information Technologies, The University of Sydney, Sydney, Australia

  • Venue:
  • Journal of Network and Computer Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce an efficient route discovery mechanism to enhance the performance and multicast efficiency of On-Demand Multicast Routing Protocol (ODMRP). Our framework, called limited flooding ODMRP, improves multicasting mechanism by efficiently managing flooding mechanism based on delay characteristics of the contributing nodes. In our model, only the nodes that satisfy the delay requirements can flood the Join-Query messages. We model the contributing nodes as M/M/1 queuing systems. Our framework considers the significant parameters in delay analysis, including random packet arrival, service process, and random channel access in the relying nodes, and exhibits its best performance results under high traffic load. Simulation results reveal that limited flooding ODMRP drastically reduces the packet overhead under various simulation scenarios as compared to original ODMRP.