CMCostas Michaelides

Costas Michaelides

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Costas Michaelides has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Demystifying the Peeker's Advantage in Multiplayer First-Person Shooter Games

    by Costas Michaelides, Boris Bellalta

    We study the peeker's advantage in first-person shooters, a classic problem in multiplayer games. A player, the peeker, who first observes another player, the defender, has a strategic advantage. The peeker has the opportunity to aim and shoot first, as the defender is not aware of the peeker's presence for a short amount of time. Formally, the peeker's advantage is the length of time that the peeker sees the defender without being seen. This is an inherent problem of multiplayer games, where each player runs their own instance of the game and relies on updates from an authoritative game server to get informed about the global game state. In this article, we explore the peeker's advantage with extensive simulations, by varying the system delays, the network delays, and the reaction times of the players. First, we present our multiplayer abstraction that captures the essence of first-person shooters, including client and server logic as well as the exchanged messages. Next, we show that the game frame rate is the most influential factor, while the game server tick rate and network delays have minimal impact. Specifically, we show that by using 120 fps in the game and 60 ticks/s on the game server, the peeker's advantage can be dropped below 100 ms. Finally, using realistic, standards-compliant simulations, we show that this advantage is consistent across multiple configurations, both in local area networks and over the Internet.

  • Open Access

    Demystifying the Peeker's Advantage in Multiplayer First-Person Shooter Games

    by Costas Michaelides, Boris Bellalta

    We study the peeker's advantage in first-person shooters, a classic problem in multiplayer games. A player, the peeker, who first observes another player, the defender, has a strategic advantage. The peeker has the opportunity to aim and shoot first, as the defender is not aware of the peeker's presence for a short amount of time. Formally, the peeker's advantage is the length of time that the peeker sees the defender without being seen. This is an inherent problem of multiplayer games, where each player runs their own instance of the game and relies on updates from an authoritative game server to get informed about the global game state. In this article, we explore the peeker's advantage with extensive simulations, by varying the system delays, the network delays, and the reaction times of the players. First, we present our multiplayer abstraction that captures the essence of first-person shooters, including client and server logic as well as the exchanged messages. Next, we show that the game frame rate is the most influential factor, while the game server tick rate and network delays have minimal impact. Specifically, we show that by using 120 fps in the game and 60 ticks/s on the game server, the peeker's advantage can be dropped below 100 ms. Finally, using realistic, standards-compliant simulations, we show that this advantage is consistent across multiple configurations, both in local area networks and over the Internet.


  • Open Access

    On the Communication Problems of Virtual Reality: Responsiveness, Timeliness, and Effectiveness

    by Costas Michaelides, Boris Bellalta

    In this article, we explore communication problems in virtual reality (VR) systems from the perspective of wireless networking. Our starting point is that the dynamics of real-time interaction between the physical and virtual worlds cannot be fully captured by the frame rate. Particularly, the frame rate can be very high, but the actual user experience can be disappointing. We argue that the key idea is to think of VR as the mediator of the senses, especially vision, rather than a conventional video streaming application. This is indeed a remarkable opportunity to recall Weaver's classification and define three fundamental problems in VR systems: i) responsiveness, ii) timeliness, and iii) effectiveness. Responsiveness refers to the delay between an action in the physical world and its display in the virtual world. Timeliness is related to the frequency of updates imposed by the frame rate. Effectiveness considers the visual content of a video frame and its likelihood of extrapolation. Our framework offers a concise and objective description of VR systems, that allows us to evaluate performance, identify potential issues, and design impactful solutions.

  • Open Access

    On the Communication Problems of Virtual Reality: Responsiveness, Timeliness, and Effectiveness

    by Costas Michaelides, Boris Bellalta

    In this article, we explore communication problems in virtual reality (VR) systems from the perspective of wireless networking. Our starting point is that the dynamics of real-time interaction between the physical and virtual worlds cannot be fully captured by the frame rate. Particularly, the frame rate can be very high, but the actual user experience can be disappointing. We argue that the key idea is to think of VR as the mediator of the senses, especially vision, rather than a conventional video streaming application. This is indeed a remarkable opportunity to recall Weaver's classification and define three fundamental problems in VR systems: i) responsiveness, ii) timeliness, and iii) effectiveness. Responsiveness refers to the delay between an action in the physical world and its display in the virtual world. Timeliness is related to the frequency of updates imposed by the frame rate. Effectiveness considers the visual content of a video frame and its likelihood of extrapolation. Our framework offers a concise and objective description of VR systems, that allows us to evaluate performance, identify potential issues, and design impactful solutions.


  • Open Access

    Lessons Learned From a Large-Scale Virtual Reality Experience Over Wi-Fi

    by Costas Michaelides, Miguel Casasnovas, David Nunez, Boris Bellalta

    Large-scale virtual reality (VR) enables novel art forms in large physical environments. A key technical solution in such cases is to split the rendering process between a client and a streamer. In this article, we focused on the peculiarities of VR split rendering and particularly on the performance of Wi-Fi. First, we calculated the network delay budget and then conducted a set of experiments to evaluate the single-user and multi-user performance of VR split rendering systems over Wi-Fi in terms of latency. Our findings were summarized as recommendations on: i) the frame rate, ii) the encoding bitrate, iii) the signal strength, iv) the channel bandwidth, and v) the multiple access techniques. In particular, our multi-user tests highlighted cases where using the highest settings or latest features of Wi-Fi can compromise performance. Finally, we applied our recommendations to a large-scale multi-user case study that took place physically in the multi-purpose hall of our university campus and virtually in the Turret Singers environment of SteamVR Home. This article serves as a reference to the critical aspects of VR split rendering systems over Wi-Fi.


  • Open Access

    Lessons Learned From a Large-Scale Virtual Reality Experience Over Wi-Fi

    by Costas Michaelides, Miguel Casasnovas, David Nunez, Boris Bellalta

    Large-scale virtual reality (VR) enables novel art forms in large physical environments. A key technical solution in such cases is to split the rendering process between a client and a streamer. In this article, we focused on the peculiarities of VR split rendering and particularly on the performance of Wi-Fi. First, we calculated the network delay budget and then conducted a set of experiments to evaluate the single-user and multi-user performance of VR split rendering systems over Wi-Fi in terms of latency. Our findings were summarized as recommendations on: i) the frame rate, ii) the encoding bitrate, iii) the signal strength, iv) the channel bandwidth, and v) the multiple access techniques. In particular, our multi-user tests highlighted cases where using the highest settings or latest features of Wi-Fi can compromise performance. Finally, we applied our recommendations to a large-scale multi-user case study that took place physically in the multi-purpose hall of our university campus and virtually in the Turret Singers environment of SteamVR Home. This article serves as a reference to the critical aspects of VR split rendering systems over Wi-Fi.

  • Open Access

    Experimental evaluation of interactive Edge/Cloud Virtual Reality gaming over Wi-Fi using unity render streaming

    by Miguel Casasnovas, Costas Michaelides, Marc Carrascosa-Zamacois, Boris Bellalta


  • Open Access

    Responsive and Timely Virtual Reality Gaming: Which Frame Rate Should One Choose?

    by Costas Michaelides, Boris Bellalta

    Hitting a high frame rate is the holy grail of virtual reality (VR). Indeed, a high frame rate offers an amazing experience, but also pushes current technology to its limits. This is particularly true for networked VR gaming systems which rely on split rendering between a client and a server. In this paper, we investigate the impact of frame rate on such systems in terms of responsiveness and timeliness, using both experiments and simulations. Responsiveness refers to how quickly the information is exchanged, while timeliness refers to the frequency of updates. In terms of responsiveness, we show that 90 fps and 120 fps may tolerate up to 6 ms network delay. In terms of timeliness, we show that the best choices are 120 fps when network delay is low and 60 fps when network delay is high.

  • Open Access

    Buffer Resets: A Packet Discarding Policy for Timely Physiological Data Collection in Virtual Reality Gaming Systems

    by Costas Michaelides, Boris Bellalta

    Affective virtual reality (VR) gaming systems rely on timely physiological data collection, in order to generate personalized responses that enhance the emotional impact of a video game on its user. In this context, we propose a simple policy for timely data collection from wireless sensor nodes placed on the human body. Our policy is applied at each sensor node. Upon each packet arrival we check whether the buffer is full or not. If the buffer is full, then we empty it before adding the packet. In this very simple way, we avoid buffer congestion and impose timeliness. We simulated this aggressive buffer reset policy using a body area network (BAN) model in OMNeT++. By varying the packet generation rate of each node, we showed that our policy outperforms first come first served (FCFS) and last come first served (LCFS) queueing policies in terms of peak age, while packet reception is barely affected. Buffer resets can be easily integrated into existing random access protocols to support timely data collection.

  • Buffer Resets: A Packet-Discarding Policy for Timely Physiological Data Collection in Virtual Reality Gaming Systems

    by Costas Michaelides, Boris Bellalta

    Affective virtual reality (VR) gaming systems rely on timely physiological data collection, in order to generate personalized responses that enhance the emotional impact of a video game on its user. In this context, we propose a simple policy for timely data collection from wireless sensor nodes placed on the human body. Our policy is applied at each sensor node. Upon each packet arrival we check whether the buffer is full or not. If the buffer is full, then we empty it before adding the packet. In this very simple way, we avoid buffer congestion and impose timeliness. We simulated this aggressive buffer reset policy using a body area network (BAN) model in OMNeT++. By varying the packet generation rate of each node, we showed that our policy outperforms first come first served (FCFS) and last come first served (LCFS) queueing policies in terms of peak age, while packet reception is barely affected. Buffer resets can be easily integrated into existing random access protocols to support timely data collection.