On Consistency and Network Latency in Distributed Interactive Applications: A Survey—Part I

Delaney, Declan; Ward, Tomás E.; McLoone, Séamus

doi:10.1162/pres.2006.15.2.218

Cited by 72 publications

(49 citation statements)

References 76 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The interactive services include many kinds of applications (for example, virtual/augmented reality, voice interaction, interactive groupware, etc. ), and a maximum one-way delay of 100 [ms] is required by the interactive application with the highest sensitivity [18].…”

Section: Performance Measuresmentioning

confidence: 99%

Location-Aware Optimal Resource Selection Method for P2P-Based Contents Management and Real-Time Distribution

Yamamoto

Yamazaki

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWith the wide-spread use of high-speed network connections and high performance mobile/sensor terminals available, new interactive services based on real-time contents have become available over the Internet. In these services, end-nodes (e.g, smart phone, sensors), which are dispersed over the Internet, generates the real-time contents (e.g, live video, sensor data about human activity), and those contents are utilized to support many kinds of human activities seen in the real world. For the services, a new decentralized contents distribution system which can accommodate a large number of content distributions and which can minimize the end-toend streaming delay between the content publisher and the subscribers is proposed. In order to satisfy the requirements, the proposed content distribution system is equipped with utilizing two distributed resource selection methods. The first method, distributed hash table (DHT)-based contents management, makes it possible for the system to efficiently decide and locate the server managing content distributions in completely decentralized manner. And, the second one, location-aware server selection, is utilized to quickly select the appropriate servers that distribute the streamed contents to all subscribers in real time. This paper considers the performance of the proposed resource selection methods using a realistic computer simulation and shows that the system with the proposed methods has scalability for a large-scale distributed system that attracts a very large number of users, and achieves real-time locating of the contents without degrading end-toend streaming delay of content.

show abstract

Section: Performance Measuresmentioning

confidence: 99%

Location-Aware Optimal Resource Selection Method for P2P-Based Contents Management and Real-Time Distribution

Yamamoto

Yamazaki

2013

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…They offer the realization of simulated virtual worlds that embody a modern extension of communication, encompassing the concepts of shared time, space and presence [2]. The definition of DIAs includes a wide range of applications that have seen rapid advances in technology and global popularity due to the widespread availability and ease-ofuse of the Internet [3,4].…”

Section: Introductionmentioning

confidence: 99%

“…High latency and low network bandwidth capacity represent the largest contributors to the difficulties faced by DIAs in supporting dynamic shared state consistency, potential scalability and real-time interactivity. A wide variety of techniques exist that aim to reduce the amount of network traffic transmitted during the execution of a DIA [2][3][4]. One of the most commonly used techniques is the predictive contract mechanism known as dead reckoning.…”

Section: Introductionmentioning

confidence: 99%

Using Neural-Networks to Reduce Entity State Updates in Distributed Interactive Applications

McCoy

Ward

McLoone

et al. 2006

2006 16th IEEE Signal Processing Society Workshop on Machine Learning for Signal Processing

Self Cite

View full text Add to dashboard Cite

Dead reckoning is the most commonly used predictive contract mechanism for the reduction of network traffic in Distributed Interactive Applications (DIAs). However, this technique often ignores available contextual information that may be influential to the state of an entity, sacrificing remote predictive accuracy in favour of low computational complexity. In this paper, we present a novel extension of dead reckoning by employing neuralnetworks to take into account expected future entity behaviour during the transmission of entity state updates (ESUs) for remote entity modeling in DIAs. This proposed method succeeds in reducing network traffic through a decrease in the frequency of ESU transmission required to maintain consistency. Validation is achieved through simulation in a highly interactive DIA, and results indicate significant potential for improved scalability when compared to the use of the IEEE DIS Standard dead reckoning technique. The new method exhibits relatively low computational overhead and seamless integration with current dead reckoning schemes.

show abstract

“…INTRODUCTION A Distributed Interactive Application (DIA) is a computer program which enables geographically dispersed users to act in real-time in a simulated environment to perform interactive tasks [1,2]. Over the past three decades, three distinctive classes of DIAs have come to the fore, namely military simulations, networked virtual environments and online multiplayer computer games (MCGs) [2].…”

mentioning

confidence: 99%

“…Over the past three decades, three distinctive classes of DIAs have come to the fore, namely military simulations, networked virtual environments and online multiplayer computer games (MCGs) [2].…”

mentioning

confidence: 99%

A Consistency Regulation Algorithm for Client-Server-based Multiplayer Computer Games

McLoone

Wynne

McCoy

et al. 2012

IET Irish Signals and Systems Conference (ISSC 2012)

View full text Add to dashboard Cite

Abstract-Consistency is one of the most important aspects to be considered when designing a Distributed Interactive Application, and particularly in networked Multiplayer Computer Games (MCGs). Several techniques exist which aim to reduce network traffic in an attempt to maintain an acceptable level of consistency. However, these techniques are static in nature, as they do not adapt to the varying network conditions. This paper presents an algorithm which aims to maintain an acceptable level of consistency by adapting to changes in the network. The algorithm is a rate-based approach which monitors the remote inconsistency of all players participating in a client-server-based MCG. It operates on the premise that as the network conditions across the links between the server and the clients vary, so too will the remote inconsistency. In response, the rate at which the updates are transmitted from the server to all the remote clients is adapted, ensuring that an acceptable level of consistency is maintained. Simulation results for the proposed algorithm are also presented.

show abstract

On Consistency and Network Latency in Distributed Interactive Applications: A Survey—Part I

Abstract: -This paper is the first part of a two-part paper that documents a detailed survey of the research carried out on consistency and latency in distributed interactive applications

Cited by 72 publications

References 76 publications

Location-Aware Optimal Resource Selection Method for P2P-Based Contents Management and Real-Time Distribution

Location-Aware Optimal Resource Selection Method for P2P-Based Contents Management and Real-Time Distribution

Using Neural-Networks to Reduce Entity State Updates in Distributed Interactive Applications

A Consistency Regulation Algorithm for Client-Server-based Multiplayer Computer Games

Contact Info

Product

Resources

About