DocumentCode
475873
Title
An Interest Management Mechanism Based on N-Tree
Author
Xiang-bin, Shi ; Yue, Wang ; Qiang, Li ; Ling, DU ; Fang, LIU
Author_Institution
Dept. of Comput. Sci. & Eng., Shenyang Inst. of Aeronaut. Eng., Shenyang
fYear
2008
fDate
6-8 Aug. 2008
Firstpage
917
Lastpage
922
Abstract
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 playerpsilas awareness area based on the awareness model, and sets different DR thresholds for entities on the basis of the playerspsila 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.
Keywords
computer games; peer-to-peer computing; tree data structures; DR thresholds; N-Tree; P2P MMOG; bandwidth cost reduction; game space partitioning; predictive interest management; Bandwidth; Broadcasting; Computer network management; Conference management; Distributed computing; Engineering management; Network servers; Partitioning algorithms; Peer to peer computing; Technology management; AOI; Interest Management; MMOG; N-Tree;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on
Conference_Location
Phuket
Print_ISBN
978-0-7695-3263-9
Type
conf
DOI
10.1109/SNPD.2008.33
Filename
4617486
Link To Document