A cheat-proofing model for DVE based on single proxy computing
Xufa Wang · 2009
Local states are controlled,computed and distributed in P2P-based distributed virtual environment(DVE) by means of ordinary nodes,thus the improper selection of such ordinary nodes may give rise to cheating.With regard to the problem,a single proxy computing(SPC) model was proposed,by which interest-irrelative proxy computing nodes were selected to compute and distribute the local state of nodes,and cheating at the application level could thus be prevented.In SPC model,only three application layer hops are needed for the computation and distribution of the state during the interaction,and only O(1) traffic and O(1) application level hops are required for each node joining or leaving the system,while the traffic in SPC model is between three and four times as much as that in C/S architecture.