CLIENT ASSIGNMENT PROBLEM IN DISTRIBUTED VIRTUAL ENVIRONMENTS

D.N.B. Ta and S. Zhou

References

  1. [1] S. Singhal & M. Zyda, Networked virtual environments (NewYork: Addison-Wesley, 1999).
  2. [2] J. Dias, R. Galli, A. Almeida, C. Belo, et al., mWorld: Amultiuser 3D virtual environment, IEEE Computer Graphics,17(2), 1997.
  3. [3] D. Miller & J. Thorpe, SIMNET: The advent of simulatornetworking, Proc. IEEE, 83 (8), 1995.
  4. [4] T. Nitta, K. Fujita, & S. Cono, An application of distributedvirtual environment to foreign language, 30th Annual Frontiersin Education Conf., Kansas City, MO, 2000.
  5. [5] J. Smed, T. Kaukoranta, & H.Hakonen, Aspects of networkingin multiplayer computer games, Proc. Int. Conf. on Applicationand Development of Computer Games in the 21st Century,Hong Kong SAR, China, 2001.
  6. [6] Zona Inc., Executive Summary Consulting Inc., State of massive multiplayer online games 2002: A new world in electronicgaming, available at http://www.zona.net, 2002.
  7. [7] S. Zhou, W. Cai, B.S. Lee, & S.J. Turner, Time–space consistency in large-scale distributed virtual environments, ACMTrans. on Modeling and Computer Simulation, 14(1), 2004,31–47. doi:10.1145/974734.974736
  8. [8] T.K. Das, G. Singh, A. Mitchell, P.S. Kumar, et al., NetEffect:A network architecture for large-scale multi-user virtual worlds,Proc. ACM VRST, Lausanne, Switzerland, 1997.
  9. [9] E. Cronin, B. Filstrup, & A. Kurc, A distributed multiplayergame server system, Technical report, University of Michigan,2001.
  10. [10] Sony Online Entertainments, Everquest, available athttp://eqlive.station.sony.com.
  11. [11] K.W. Lee, B.J. Ko, & S. Calo, Adaptive server selection forlarge scale interactive online games, Proc. NOSSDAV, CountyCork, Ireland, 2004.
  12. [12] S. Khuri & T. Chiu, Heuristic algorithms for the terminalassignment problem, Proc. ACM Applied Computing, San Jose,CA, 1997.
  13. [13] S. Salcedo-Sanz & X. Yao, A hybrid Hopfield Network-Geneticalgorithm approach for the terminal assignment problem, IEEETrans. on Systems, Man and Cybernetics, 34 (6), 2004.
  14. [14] A. Abdelkhalek, A. Bilas, & A. Moshovos, Behavior andperformance of interactive multi-player game servers, SpecialIssue of Cluster Computing: The Journal of Networks, SoftwareTools and Applications, 2002, 355–366.
  15. [15] P. Morillo, J.M. Orduna, M. Fernandez, & J. Duato, On thecharacterization of distributed virtual environment systems,Proc. Euro-Par, Klagenfurt, Austria, 2003.
  16. [16] J. Lui & M. Chan, An efficient partitioning algorithm fordistributed virtual environment systems, IEEE Trans. onParallel and Distributed Systems, 13 (3), 2002. doi:10.1109/71.993202
  17. [17] D.N.B. Ta & S. Zhou, A dynamic load sharing algorithm formassively multi-player online games, Proc. 11th IEEE Int.Conf. on Networks, Sydney, Australia, 2003.
  18. [18] W. Cai, P. Xavier, S. Turner, & B.S. Lee, A scalable architecturefor supporting interactive games on the Internet, Proc. 16thWorkshop on Parallel and Distributed Simulation, Washington,DC, 2002.
  19. [19] K. Fujikawa, M. Hori, S. Shimojo, & H. Miyahara, A serverselction method based on communication delay and communication frequency among users for networked virtual environments, Proc. ASIAN, Hanoi, Vietnam, 2002.
  20. [20] A. Kershenbaum, Telecommunications network design algorithms (New York: McGraw-Hill, 1993).
  21. [21] BRITE Topology Generator, available at htttp://www.cs.bu.edu/brite.94

Important Links:

Go Back