By Topic

Maintaining consistency in distributed network games

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
$33 $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

4 Author(s)
Kyung Seob Moon ; Sch. of Inf. & Commun. Technol., Griffith Univ., Brisbane, Qld., Australia ; V. Muthukkumarasamy ; A. T. -A. Nguyen ; Hyung Soo Kim

There are basically two approaches, conservative and optimistic, to maintain consistency in distributed network games. In the former, players may experience network latency, depending on packet transfer delay, caused by the send-and-wait frame and acknowledgement packets. In the latter approaches, the processes do not wait for other players' packets and advance to their own frames, hence no network latency. However, when inconsistency happens the processes must roll back. These can cause irritation and confusion to players. Overall, the optimistic approaches may not be suitable for networked games. To overcome the network latency problem in the conservative approaches, this paper introduces a network system which can reduce network latency and bandwidth by utilizing packet-relay and shortest path algorithms. Furthermore, game efficiency comparison between lock-step and bucket-synchronization algorithms on the proposed network system is presented in this paper.

Published in:

2005 13th IEEE International Conference on Networks Jointly held with the 2005 IEEE 7th Malaysia International Conf on Communic  (Volume:1 )

Date of Conference:

16-18 Nov. 2005