For Project Enquiry +91 9791 044 044

The Client Assignment Problem for Continuous

Distributed Interactive Applications: Analysis,

Algorithms and Evaluation

ABSTRACT

In this paper, we investigate the problem of effectively assigning clients to servers for maximizing the interactivity of DIAs. We focus on continuous DIAs that changes their states not only in response to user operations but also due to the passing of time. We analyze the minimum achievable interaction time for DIAs to preserve consistency and provide fairness among clients, and formulate the client assignment problem as a combinatorial optimization problem. We prove that this problem is NP-complete. Three heuristic assignment algorithms are proposed and their approximation ratios are theoretically analyzed. The performance of the algorithms is also experimentally evaluated using real Internet latency data. The experimental results show that our proposed Greedy Assignment and Distributed-Modify Assignment algorithms generally produce near optimal interactivity and significantly reduce the interaction time between clients compared to the intuitive algorithm that assigns each client to its nearest server.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING CONCEPT: - In existing system distributed server architecture, the interactivity performance depends on not only client-to-server network latencies but also inter server network latencies. Synchronization delays to meet the consistency and fairness requirements of DIAs. All of these factors are directly affected by how the clients are assigned to the servers.	PROPOSED SYSTEM: - We prove that this problem is NP-complete. Three heuristic assignment algorithms are performance of the algorithms is also experimentally evaluated using real Internet latency data. Greedy Assignment and Distributed-Modify Assignment algorithms generally produce near optimal interactivity and significantly reduce the interaction time between clients compared to the intuitive algorithm that assigns each client to its nearest server.
EXISTING TECHNIQUE:- Dynamic Nearest-Server Algorithm (D-Nearest)	PROPOSED TECHNIQUE: -       Greedy Assignment
TECHNIQUE DEFINITION:- We analyze the minimum achievable interaction time for DIAs to preserve consistency and provide fairness among clients, and formulate.  The client assignment problem as a combinatorial optimization problem.	TECHNIQUE DEFINITION:- They produce near optimal interactivity and significantly reduce the interaction time between clients.  The intuitive algorithm that assigns each client to its nearest server.
DRAWBACK:- Low latency and high traffic throughput on individual packets   The high path quality of data delivery.	ADVANTAGE:- High latency and low traffic throughput on individual packets   The low path quality of data delivery.