By Topic

Predict-and-Quantize Priority in Application-Level Multicast for Distributed Interactive Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ren Chen ; Dept. of Comput. Eng., Chonnam Nat. Univ., Gwangju ; Hamad, O.F. ; Jin-Han Jeon ; Mi-Young Kang
more authors

In distributed interactive applications (DIAs) embedded priority, the sender node forwards data to receivers due to their respective priorities. One application level multicast protocol: the priority-based directed minimum spanning tree (PST) was designed for these DIAs. However, the existing PST has no efficient priority selection mechanism and the system consumes a tremendous amount of resource and becomes unstable and unscalable when its size increases. In this paper we propose a novel application level multicast algorithm: predict-and-quantize for priority with directed minimum spanning tree (PQPST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree. Furthermore, PQPST can easily integrate the quantized priority into game environment and simplify priority deployment. The simulation results show that PQPST is able to efficiently make priority selection and keep system stable with reasonable scalability.

Published in:

Advanced Computer Control, 2009. ICACC '09. International Conference on

Date of Conference:

22-24 Jan. 2009