Priority-based Application Level Multicast for Distributed Interactive Applications Based on Distance

Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority. The PST algorithm was designed for these DIAs based on distance. However, the PST lacks efficient priority selection and filtering mechanism resulted in system unstable and inextensible. In this paper, we first propose PQPST algorithm which can predict every efficient priority and quantize the predicted efficient priorities into different groups for constructing the multicast trees. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction, and it can efficiently decrease the repeated distribution tree construction. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.