IIT Real-Time Communication, WebRTC, Mobility, VoIP, NG911 Conference & Expo


Real Time Communications Conference & Expo at Illinois Tech

IEEE International Conference

  • Home
  • News
  • Sponsor & Exhibitor
    • Call for Sponsors
    • RTC Conference Prospectus 2026
    • RTC Conference 2024 Executive Summary
  • Program and Tracks – Still Under Construction
    • Conference schedule
    • Conference Speakers
    • Research Track
      • Research Track CfP
    • Programmable Real-Time Networks
    • Communications Quality and Reliability
    • VoiceTech
    • WebRTC & Real-Time Applications
    • Next Generation Emergency Communications
    • Emerging Technologies and RTC
  • Propose a talk
  • Call for Posters
  • Travel/Hotels
  • Contact
  • Register

Presentation

Track: Research Track
Optimistic Synchronization-Based Server Allocation with Preventive Start-Time Optimization for Delay-Sensitive Applications Under Server Failure
Real-time applications require low latency and strict event ordering. Distributed server processing is effective for this purpose, and there are two synchronization algorithms: a conservative synchronization algorithm (CSA) and an optimistic synchronization algorithm (OSA). OSA allows servers to process events without prior order enforcement, rolling back their status to the time of the event occurrence if an out-of-order event is detected, which improves delay performance compared to CSA. While prior studies have considered OSA, they have not incorporated the impact of server failures. This paper proposes an OSA-based server allocation model for delay-sensitive applications with preventive start-time optimization (PSO) under single-server failures. The proposed model minimizes the largest total delay across all failure scenarios while satisfying the maximum status holding time constraints with PSO under single-server failures. PSO proactively assigns users to servers to minimize the maximum delay across all failure scenarios, while ensuring that users connected to operational servers are not unnecessarily reassigned. We formulate the proposed model as an integer linear programming (ILP) problem. We prove that the decision version of the server allocation problem is NP-complete. Numerical results show that the proposed OSA-based model reduces the delay compared to the conventional CSA-based model by effectively utilizing server memory resources. We observe that the proposed model achieves a lower largest total delay than start-time optimization and provides greater stability by preventing unnecessary user reassignments compared to run-time optimization.
  • Masaki Oda - Speaker
Presentation Video
Presentation Notes
Oda-Optimistic-Synchronization-Based-Server-Allocation-with-Preventive-Start-Time-Optimization-for-Delay-Sensitive-Applications-Under-Server-Failure.pdf

Follow Us

FacebooktwitterlinkedinFacebooktwitterlinkedin

Share This

FacebooktwitterlinkedinmailFacebooktwitterlinkedinmail

News

Call for Posters

Early Bird Registration Open!

Call for Speakers

More Info:

  • Contact

© 2012-2013 llinois Institute of Technology School of Applied Technology 201 East Loop Road, Wheaton IL 60189 630.682.6000
3424 South State, Chicago IL 60616 312.567.5280 Emergency Information

© Copyright 2026 RTC-Conference · All Rights Reserved

7ads6x98y