A Saturation Avoidance Technique for Peer-to-Peer Distributed Virtual Environments

Grimaldo, Francisco; Lozano, Miguel; Barber, Fernando; Vigueras, Guillermo

doi:10.1109/cw.2007.15

Cited by 11 publications

(3 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate the performance of the proposed techniques, the MNB, M2T, M3T and HMT algorithms were implemented along with the flooding scheme of Gnutella [23][24][25][26][27]. The average results of 100 random tests for each algorithm are reported on.…”

Section: Performance Evaluationmentioning

confidence: 99%

Message transmission techniques for low traffic P2P services

Hsu

Chen

et al. 2009

Int J Communication

View full text Add to dashboard Cite

SUMMARYWith the advance of network technology peer-to-peer (P2P) has become a new network application model for state-of-the-art-distributed computing bringing about a lot of research. Message transmission is the most important fundamental operation in the accomplishing of scalable and reliable service in P2P networks. In this paper, different message transmission strategies aimed at reducing the amount of querying and thus increasing resource utilization are presented. The advantages of these techniques are that they are simple, have low complexity and are easy to implement. The experimental results show that the proposed methods were successful in reducing network traffic under different unstructured P2P overlay networks. The detailed analysis points out the properties and also suggests an improved message transmission mechanism for different P2P environments.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

Message transmission techniques for low traffic P2P services

Hsu

Chen

et al. 2009

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Avatars in his evaluation are simulated using a combination group and waypoint model, where groups of simulated avatars agree on a next point to visit, and move there together. Several other frameworks (Lui & Chan, 2002) (Matsumoto, Kawahara, Morikawa, & Aoyama, 2004) (Morillo, Orduna, Fernandez, & Duato, 2005) (Rueda, Morillo, & Orduna, 2007) assume movement and arrival / departure properties of participants without any obvious experimental basis. The assumptions used in all these cases are logical, but without firm experimental grounding.…”

Section: Avatar Behavior and Traffic Classificationmentioning

confidence: 99%

Group movement in World of Warcraft Battlegrounds

Miller

Crowcroft

2010

IJAMC

View full text Add to dashboard Cite

Distributed Virtual Environment (DVE) topology management and message propagation schemes have been proposed for many years. Evaluating DVE message propagation schemes requires a variety of assumptions whose verity significantly affects results, such as details about avatar movement characteristics. We implemented two schemes for waypoint and hotspot detection, and examined their applicability for characterizing avatar movement. We confirmed that waypoint detection doesn't yield good results for characterizing human avatar movement, and gained new insight into why by rendering avatar movement as point clouds. We implemented an existing hotspot detection model, and proposed an enhancement to help overcome one limitation of cell-based hotspot detection. We were able to immediately apply this hotspot detection technique to help analyze group movement. We discovered that although a third of movement time in the battlegrounds is spent in inter-node journeys, less than a quarter of these journeys are made in groups.

show abstract

“…Different architectures have been proposed in order to efficiently support multiplayer online games: centralizedserver architectures [28,22], networked server architectures [12,3,19,20] and peer-to-peer architectures [17,10,7,24,23]. Figure 1 shows an example of a centralizedserver architecture.…”

Section: Introductionmentioning

confidence: 99%

Analyzing the Network Traffic Requirements of Multiplayer Online Games

Asensio

Ordua

Morillo

2008

2008 the Second International Conference on Advanced Engineering Computing and Applications in Sciences

Self Cite

View full text Add to dashboard Cite

In recent years, Distributed Virtual Environments (DVEs) have become one of the major network applications, mainly due to the enormous popularity of multiplayer online games in the entertainment industry. Although the workload generated by avatars in a DVE system has already been characterized, the actual network traffic requirements of multiplayer online games are usually limited (hidden) by the available network bandwidth.In this paper, we propose the measurement of the network traffic requirements of the most popular MOGs by monitoring the network traffic generated by different game tournaments in a LAN Party. The network infrastructure was explicitely designed and implemented for that event by a Network Service Provider, achieving a sustained bandwidth of 100 Mbps for each network interface. Therefore, the potential bandwidth bottleneck was moved from the network to another element of the system or application. The results show that the aggregated bandwidth required by these applications is not higher than 1600 Kbps. Also, the results show identical variations in the network traffic sent to some of the clients by the game server. These results can be used as a basis for an efficient design of MOGs infrastructure.

show abstract

A Saturation Avoidance Technique for Peer-to-Peer Distributed Virtual Environments

Abstract: The current expansion of multi-player online games has promoted the growth of large scale distributed virtual environments (DVEs)

Cited by 11 publications

References 32 publications

Message transmission techniques for low traffic P2P services

Message transmission techniques for low traffic P2P services

Group movement in World of Warcraft Battlegrounds

Analyzing the Network Traffic Requirements of Multiplayer Online Games

Contact Info

Product

Resources

About