Abstract
Interactivity is a primary performance measure for distributed interactive applications (DIAs). In a network supporting a DIA, interactivity performance depends on both client-to-server network latencies and inter-server network latencies. An optimization problem, which we term FCSA, is to find an optimum way how clients are assigned to servers such that the largest latency on an interactivity path between two clients (client 1 to server 1, server 1 to server 2, then server 2 to client 2) is minimized. Previous work showed that it is NP-hard to approximate this problem with a ratio better than 4 / 3 and gave a 3-approximation algorithm. In this paper, we give a (3 / 2)-approximation algorithm for FCSA, and show that it is NP-hard to obtain a better ratio. We also give a (3 / 2)-approximation algorithm when server capacity constraints are considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have