Efficient Range Querying in Distributed Games

  • Sergey Legtchenko | UPMC-LIP6 in Paris

In the last few years Massively Multiplayer Online Games (MMOGs) have become a popular class of distributed applications with millions of users. Such applications need to be highly scalable to support the colossal number of players and to be reactive with almost realtime constraints to provide a satisfying gaming experience.

A range query is an operation that allows to retrieve/update all the objects located in a specified zone of the virtual environment. Efficient range querying is a key requirement for MMOG systems, because players moving through the game constantly need to display surrounding objects. This talk presents novel techniques to improve the efficiency of range queries in MMOG systems.

Speaker Details

Sergey Legtchenko is a Ph.D. student in a joint LIP6/INRIA team in Paris.
He obtained his Master’s degree from the UPMC University in 2009. Sergey is working on
distributed system design. His current field of research is Massively Multiplayer Online Games.

    • Portrait of Jeff Running

      Jeff Running

Watch Next