An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems

  title={An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems},
  author={John C.S. Lui and M. F. Chan},
  journal={IEEE Trans. Parallel Distributed Syst.},
Distributed virtual environment (DVE) systems model and simulate the activities of thousands of entities interacting in a virtual world over a wide area network. Possible applications for DVE systems are multiplayer video games, military and industrial trainings, and collaborative engineering. In general, a DVE system is composed of many servers and each server is responsible to manage multiple clients who want to participate in the virtual world. Each server receives updates from different… 
An allocation management algorithm for DVE system
This paper presents an object driven partitioning algorithm to improve the performance of Distributed Virtual Environment.
Performance evaluation of a dynamic approach for networked servers distributed virtual environments
A dynamic approach for DVEs is presented, which exploits the nature of these systems for the optimal resource management and extended scalability support and on the other hand, evaluates its performance through a series of experiments and under various settings of the virtual world, using Simul8 simulation tool.
Efficient client-to-server assignments for distributed virtual environments
  • T. DuongSuiping Zhou
  • Computer Science
    Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006
A two-phase approach, consisting of an initial assignment phase and a refined assignment phase to address the client assignment problem, is proposed, both of which are shown to be NP-hard.
Client Assignment Problem in Distributed Virtual Environments
The client assignment problem is formulated and two algorithms to assign clients to servers in a more efficient way are proposed based on the heuristics developed for the well-known terminal assignment problem.
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
This paper presents in a unified manner a partitioning approach for providing a latency below a threshold to the maximum number of users as possible in DVE systems and searches the assignment of avatars for the best trade-off among system latency, system throughput, and partitioning efficiency when solving the partitioning problem.
Performance Analysis of Distributed Virtual Environments
This thesis develops a general network model and develops an efficient heuristic algorithm that can be used to determine the best locations for the basic systems in a network and proposes a novel technique to achieve weak consistency among copies of the virtual environment at the various basic systems.
ATLAS: A Scalable Network Framework for Distributed Virtual Environments
A scalable network framework for DVEs, ATLAS is proposed, which meets the scalability of a system as a whole and integration experiences of ATLAS with several virtual reality systems ensure the versatility of the proposed solution.
Client Allocation for Enhancing Interactivity in Distributed Virtual Environments
The client allocation problem is formulated, and some allocation algorithms to assign clients to servers in DVEs in a more efficient way are proposed, taking into account both the virtual locations of clients and the network delays between clients and servers.
A Grid Representation for Distributed Virtual Environments
Performance evaluation results show that heuristic methods can greatly improve the performance of the partitioning method, particularly for large DVE systems, and efficiency and scalability of DVE Systems can be significantly improved.


Balancing Workload and Communication Cost for a Distributed Virtual Environment
It is shown that the problem of partitioning servers in a DVE system is NP-complete and several algorithms are proposed so as to find the partitioning policy efficiently.
Deriving communication sub-graph and optimal synchronizing interval for a distributed virtual environment system
This work presents a methodology for deriving an optimal synchronizing interval based on the proposed communication sub-graph using Markov chain theory and the fundamental matrix, and is divided into two parts.
Exploiting reality with multicast groups: a network architecture for large-scale virtual environments
The design and construction of the AOIM is begun for use with the NPSNET 3D vehicle simulator, the only distributed interactive simulation (DIS) protocol compliant simulator using IP multicast communications and is suitable for operation over the Internet.
Constructing Communication Subgraphs and Deriving an Optimal Synchronization Interval for Distributed Virtual Environment Systems
The article addresses two important design issues, namely: how to construct a communication subgraph which can efficiently carry traffic generated by all clients in a DVE system, and how to guarantee that each participating client has the same consistent view of the virtual world.
A parallel disk storage system for real-time multimedia applications
The design and implementation of the RIO (Randomized I/O) multimedia object server which manages a set of parallel disks and supports real-time throughput and statistical delay guarantees is described and experimental performance results measured on a prototype implementation are presented.
RIO: a real-time multimedia object server
The RIO multimedia object server provides applications a guaranteed rate of storage access with bounded delay even at very high (> 90%) disk utilization, and introduces limited redundancy and asynchronous scheduling for short term load balancing.
Multicast routing in datagram internetworks and extended LANs
Extensions to two common internetwork routing algorithms are specified to support low-delay datagram multicasting beyond a single LAN and how the use of multicast scope control and hierarchical multicast routing allows the multicast service to scale up to large internetworks is discussed.
Call admission and resource reservation for multicast sessions
  • V. FiroiuD. Towsley
  • Computer Science
    Proceedings of IEEE INFOCOM '96. Conference on Computer Communications
  • 1996
A general framework for admission control and resource reservation for multicast sessions is presented and efficient and practical algorithms that aim to efficiently utilize network resources are developed.
A Taxonomy for Networked Virtual Environments
We discuss virtual environments in the context of how to distribute network communications, views, data, and processes while emphasizing those aspects critical to scaling environments. Systems that
Parallel Incremental Graph Partitioning
A linear programming-based method is used to solve the incremental graph-partitioning problem and the quality of the partitioning achieved is comparable to that achieved by applying recursive spectral bisection to the incremental graphs from scratch.