Skip to main content
SpringerLink
Log in

A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2669))

Included in the following conference series:

Abstract

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are several key issues in these systems that should still be improved in order to design a scalable and cost-effective system. One of these key issues is the partitioning problem. This problem consists of efficiently assigning clients (3-D avatars) to the servers in the system.

In this paper, we present a comparison study of different modern heuristics for solving the partitioning problem in DVE systems, as an alternative to the adhoc heuristic proposed in the literature. Performance evaluation results show that some of the heuristic methods can greatly improve the performance of the partitioning method, particularly for large DVE systems. In this way, efficiency and scalability of DVE systems can be significantly improved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.B. Anderson, J.W. Barrus, J.H. Howard, “Building multi-user interactive multimedia environments at MERL”, in IEEE Multimedia, 2(4), pp.77–82, Winter 1995.

    Article  Google Scholar 

  2. P. Barham, T. Paul, “Exploiting Reality with Multicast Groups”, in IEEE Computer Graphics & Applications, pp.38–45, September 1995.

    Google Scholar 

  3. H. Delmaire, J.A. Daz, E. Fernndez, and M. Ortega, “Comparing new heuristics for the pure integer capacitated plant location problem”, Technical Report DR97/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Spain, 1997.

    Google Scholar 

  4. M. Dorigo and L. Gambardella, “Ant colony system: A Cooperative Learning Approach to the Traveling Salesman Problem”, in IEEE Trans. Evolut. Comput., 1997.

    Google Scholar 

  5. R. Duda, P. Hart, D. Stork, “Pattern Classification”, Ed.Wiley Intescience, 2000, pp. 567–580.

    Google Scholar 

  6. Thomas A. Feo, Mauricio G.C, “Greedy Randomized Adaptive Search Procedures”, Resende Journal of Global Optimization, 1995.

    Google Scholar 

  7. M. Fernndez, I. Coma, G. Martn and S. Bayarri, “An Architecture for Optimal Management of the Traffic Simulation Complexity in a Driving Simulator”, Lecture Notes in Control and Information Sciences, Springer-Verlag, Vol. 243, 1999. ISBN 1-85233-123-2.

    Google Scholar 

  8. Randy L. Haupt, Sue Ellen Haupt, “Practical Genetic Algorithms”, Ed. Willey, 1997.

    Google Scholar 

  9. J.C. Hu, I. Pyarali, D.C. Schmidt, “Measuring the Impact of Event Dispatching and Concurrency Models on Web Server Performance Over High-Speed Networks”, Proc. of the 2nd. IEEE Global Internet Conference, November.1997.

    Google Scholar 

  10. P.V. Laarhoven and E. Aarts, “Simulated annealing: Theory and applications”, Reidel Pub., Dordrecht, Holland, 1987.

    MATH  Google Scholar 

  11. Michael Lewis and Jeffrey Jacboson, “Game Engines in Scientific Research”, in Communications of the ACM, Vol 45.No.1, January 2002.

    Google Scholar 

  12. John C.S. Lui, M.F. Chan, Oldfield K.Y, “Dynamic Partitioning for a Distributed Virtual Environment”, Department of Computer Science, Chinese University of Hong Kong, 1998.

    Google Scholar 

  13. Jonh C.S. Lui, M.F. Chan, “An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems”, IEEE Trans. Parallel and Distributed Systems, Vol. 13, March 2002

    Google Scholar 

  14. D.C. Miller, J.A. Thorpe, “SIMNET: The advent of simulator networking”, in Proceedings of the IEEE, 83(8), pp. 1114–1123. August, 1995.

    Article  Google Scholar 

  15. Tohei Nitta, Kazuhiro Fujita, Sachio Cono, “An Application Of Distributed Virtual Environment To Foreign Language”, in IEEE Education Society, October 2000.

    Google Scholar 

  16. J.M. Salles Dias, Ricardo Galli, A. C. Almeida et al. “mWorld: A Multiuser 3D Virtual Environment”, in IEEE Computer Graphics, Vol. 17,No. 2, March-April 1997.

    Google Scholar 

  17. S. Singhal, and M. Zyda, “Networked Virtual Environments”, ACM Press, New York, 1999.

    Google Scholar 

  18. P.T. Tam, “Communication Cost Optimization and Analysis in Distributed Virtual Environment”, M. Phil second term paper, Technical report RM1026-TR98-0412. Department of Computer Science & Engineering. The Chinese University of Hong Kong. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Robótica, Universidad de Valencia, SPAIN

    P. Morillo, M. Fernández & J. M. Orduña

  2. Departamento de Informática, Universidad de Valencia, SPAIN

    P. Morillo, M. Fernández & J. M. Orduña

Authors
  1. P. Morillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. M. Orduña
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morillo, P., Fernández, M., Orduña, J.M. (2003). A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-44842-X_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40156-8

  • Online ISBN: 978-3-540-44842-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation