loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
An Interest Management Mechanism Based on N-Tree
August 06-August 08
ISBN: 978-0-7695-3263-9
ASCII Text
x 
 
Shi Xiang-bin, Wang Yue, Li Qiang, Du Ling, Liu Fang, "An Interest Management Mechanism Based on N-Tree," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, pp. 917-922, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2008.33,
author = {Shi Xiang-bin and Wang Yue and Li Qiang and Du Ling and Liu Fang},
title = {An Interest Management Mechanism Based on N-Tree},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3263-9},
pages = {917-922},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.33},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - An Interest Management Mechanism Based on N-Tree
SN - 978-0-7695-3263-9
SP917
EP922
A1 - Shi Xiang-bin,
A1 - Wang Yue,
A1 - Li Qiang,
A1 - Du Ling,
A1 - Liu Fang,
PY - 2008
KW - MMOG
KW - Interest Management
KW - N-Tree
KW - AOI
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
This paper proposes a method for game space partitioning with N-Tree, and a predictive interest management algorithm based on the partition. This mechanism sets the player’s awareness area based on the awareness model, and sets different DR thresholds for entities on the basis of the players’ awareness level, and reduces bandwidth cost by employing transferring different messages with different frequencies. The simulation results show that the algorithm reduces computation resource and bandwidth usage greatly compared with other kinds of interest management mechanisms, and is more suitable for scalable requirements of P2P MMOG.
Index Terms:
MMOG, Interest Management, N-Tree, AOI
Citation:
Shi Xiang-bin, Wang Yue, Li Qiang, Du Ling, Liu Fang, "An Interest Management Mechanism Based on N-Tree," snpd, pp.917-922, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.