ACM Home Page
Please provide us with feedback. Feedback
Multistep-ahead neural-network predictors for network traffic reduction in distributed interactive applications
Full text PdfPdf (571 KB)
Source
ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 17 ,  Issue 4  (September 2007) table of contents
Article No. 16  
Year of Publication: 2007
ISSN:1049-3301
Authors
Aaron Mccoy  National University of Ireland Maynooth, Kildare, Republic of Ireland
Tomas Ward  National University of Ireland Maynooth, Kildare, Republic of Ireland
Seamus Mcloone  National University of Ireland Maynooth, Kildare, Republic of Ireland
Declan Delaney  Eni, Milan, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 120,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276927.1276929
What is a DOI?

ABSTRACT

Predictive contract mechanisms such as dead reckoning are widely employed to support scalable remote entity modeling in distributed interactive applications (DIAs). By employing a form of controlled inconsistency, a reduction in network traffic is achieved. However, by relying on the distribution of instantaneous derivative information, dead reckoning trades remote extrapolation accuracy for low computational complexity and ease-of-implementation. In this article, we present a novel extension of dead reckoning, termed neuro-reckoning, that seeks to replace the use of instantaneous velocity information with predictive velocity information in order to improve the accuracy of entity position extrapolation at remote hosts. Under our proposed neuro-reckoning approach, each controlling host employs a bank of neural network predictors trained to estimate future changes in entity velocity up to and including some maximum prediction horizon. The effect of each estimated change in velocity on the current entity position is simulated to produce an estimate for the likely position of the entity over some short time-span. Upon detecting an error threshold violation, the controlling host transmits a predictive velocity vector that extrapolates through the estimated position, as opposed to transmitting the instantaneous velocity vector. Such an approach succeeds in reducing the spatial error associated with remote extrapolation of entity state. Consequently, a further reduction in network traffic can be achieved. Simulation results conducted using several human users in a highly interactive DIA indicate significant potential for improved scalability when compared to the use of IEEE DIS standard dead reckoning. Our proposed neuro-reckoning framework exhibits low computational resource overhead for real-time use and can be seamlessly integrated into many existing dead reckoning mechanisms.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Battaglia, G. J. 1996. Mean square error. AMP J. Technol. 5, 31--36.
 
2
Behnke, S., Egorova, A., Gloye, A., Rojas, R., and Simon, M. 2003. Predicting away robot control latency. In Proceedings of the 7th Robocup International Symposium (Padua, Italy, Jul.). 712--719.
3
 
4
Boné, R. and Crucianu, M. 2002. Multistep-Ahead prediction with neural networks: A review. Approches Connexionnistes en Sciences Économiques et en Gestion 2, 97--106.
 
5
 
6
 
7
Chen, L. and Chen, G. 2005. A fuzzy dead reckoning algorithm for distributed interactive applications. In Proceedings of the 2nd International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) (Changsha, China, Aug.). 961--971.
 
8
 
9
 
10
 
11
 
12
Delaney, D., Ward, T., and McLoone, S. 2003. Reducing update packets in distributed interactive applications using a hybrid model. In Proceedings of the 16th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS) (Reno, NV, Aug.). 417--422.
 
13
14
 
15
Hagan, M. T. and Menhaj, M. B. 1994. Training feedforward networks with the marquardt algorithm. IEEE Trans. Neural Netw. 5, 6, 989--993.
 
16
Harrington, P. B. 1993. Sigmoid transfer functions in backpropagation neural networks. Analyt. Chem. 65, 15, 2167--2168.
 
17
 
18
IEEE 1995. Standard for Distributed Interactive Simulation---Application Protocols. IEEE Standard 1278.1--1995. Institute of Electrical and Electronics Engineers, Piscataway, NJ.
 
19
Lee, B.-S., Cai, W., Turner, S. J., and Chen, L. 2000. Adaptive dead reckoning algorithms for distributed interactive simulation. Int. J. Simul. Syst. Sci. Technol. 1, 1-2, 21--34.
 
20
Lin, K.-C., Wang, M., Wang, J., and Schab, D. E. 1995. The smoothing of dead reckoning image in distributed interactive simulation. In Proceedings of the AIAA Flight Simulation Technologies Conference (Baltimore, MD, Aug.). 83--87.
 
21
Lin, K.-C. and Schab, D. E. 1994a. Study on the network load in distributed interactive simulation. In Proceedings of the AIAA Flight Simulation Technologies Conference (Scottsdale, AZ, Aug.). 202--209.
 
22
Lin, K.-C. and Schab, D. E. 1994b. The performance assessment of the dead reckoning algorithms in DIS. Simul. 63, 5, 318--325.
 
23
Lloyd, J. 2004. The torque game engine. Game Devel. Mag. 11, 8, 8--9.
 
24
 
25
Mathy, L., Edwards, C., and Hutchinson, D. 1999. Principles of QoS in group communications. Telecommun. Syst. 11, 1-2, 59--84.
 
26
McCoy, A., Delaney, D., McLoone, S., and Ward, T. 2005. Dynamic hybrid strategy models for networked multiplayer games. In Proceedings of the 19th European Conference on Modelling and Simulation (ECMS) (Riga, Latvia, Jun.). 727--732.
 
27
28
 
29
 
30
Miller, D. C. and Thorpe, J. A. 1995. SIMNET: The advent of simulator networking. Proc. IEEE 83, 8, 1114--1123.
 
31
Mizutani, E. and Dreyfus, S. E. 2001. On complexity analysis of supervised MLP-learning for algorithmic comparisons. In Proceedings of the 14th INNS-IEEE International Joint Conference on Neural Networks (IJCNN) (Washington, DC, Jul.). 347--352.
 
32
Palant, W., Griwodz, C., and Halvorsen, P. 2006. Evaluating dead reckoning variations with a multi-player game simulator. In Proceedings of the 16th ACM International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV) (Newport, RI, May). 20--25.
33
 
34
Papadopoulos, G., Edwards, P. J., and Murray, A. F. 2001. Confidence estimation methods for neural networks: A practical comparison. IEEE Trans. Neural Netw. 12, 6, 1278--1287.
 
35
 
36
Rodgers, J. L. and Nicewander, W. A. 1988. Thirteen ways to look at the correlation coefficient. Ameri. Statis. 42, 1, 59--66.
 
37
Roehle, B. 1997. Channeling the data flood. IEEE Spectrum 34, 3, 32--38.
 
38
Ryan, P. and Oliver, W. 2006. Modelling of dead reckoning and heartbeat update mechanisms in distributed interactive simulation. In Proceedings of the European Simulation Interoperability Workshop (Stockholm, Sweden, Jun.). 06E-SIW-025.
 
39
Sas, C., O'Hare, G., and Reilly, R. 2004. A performance analysis of movement patterns. In Proceedings of the 4th International Conference on Computational Science (ICCS) (Krakow, Poland, Jun.). 954--961.
 
40
Sas, C., Reilly, R., and O'Hare, G. 2003. A connectionist model of spatial knowledge acquisition in a virtual environment. In Proceedings of the 2nd Workshop on Machine Learning, Information Retrieval and User Modelling (MLIRUM) (Johnstown, PA, Jun.). 40--48.
 
41
Shanker, M., Hu, M. Y., Hung, M. S. 1996. Effect of data standardization on neural network training. OMEGA (Int. J. Manage. Sci.) 24, 4, 385--397.
 
42
Shim, K.-H. and Kim, J.-S. 2001. A dead reckoning algorithm with variable threshold scheme in networked virtual environment. In Proceedings of the IEEE International Conference on Systems, Management and Cybernetics (SMC) (Tucson, AZ, Oct.). 1113--1118.
 
43
 
44
45
46
 
47
Thurau, C., Bauckhage, C., and Sagerer, G. 2003. Combining self organizing maps and multilayer perceptrons to learn bot-behavior for a commercial game. In Proceedings of the 4th International Conference on Intelligent Games and Simulation (GAME-ON) (London, Nov.). 119--123.
 
48
Van Hook, D. J., Calvin, J. O., and Smith, J. E. 1995. Data consistency mechanisms to support distributed simulation. In Proceedings of the 12th Workshop on Standards for the Interoperability of Distributed simulations (Orlando, FL, Mar.). 797--806.
 
49
Yu, S.-J. and Choy, Y.-C. 2001. A dynamic message filtering technique for 3D cyberspaces. Comput. Commun. 24, 18, 1745--1758.
 
50
 
51


Collaborative Colleagues:
Aaron Mccoy: colleagues
Tomas Ward: colleagues
Seamus Mcloone: colleagues
Declan Delaney: colleagues