SPIRO, Spiro, project for student, student projects
A RESEARCH & DEVELOPMENT ORGANIZATION

For Project Enquiry +91 9962 067 067

Slideshow Image 1
The Client Assignment Problem for ContinuousDistributed Interactive Applications: Analysis,Algorithms, and Evaluation.
Post Your concept Get Project
Guidance
It is purposely dedicated for innovative students. Here we encourage students who have new concepts and projects in various domains.

For Project Title


Project Zone > Software > Network Security

Social share: Facebook SPIRO Google Plus

The Client Assignment Problem for ContinuousDistributed Interactive Applications: Analysis,Algorithms, and Evaluation.

Category : Network Security


Sub Category : JAVA


Project Code : ITJNS12


Project Abstract

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.

 
 
MILE STONES
GUARANTEES
CONTACT US
 
Training and Developemet, Engg Projects
So far we have provided R&D training for more than 1,00,000 engineering Students.
Latest Projects 2012, Latest Technologiy Project
Had conducted seminars in the recent trends of technology at various colleges.
Our research projects had been presented in various National & International Conferences.
Most of our projects were identified by the industries as suitable for their needs.
Our n-number of students got research scholarship to extend our assisted projects for further development.
   
   
Training and Developemt, Project Development in Chennai
SPIRO guarantees small class sizes.
Final Year Projects
SPIRO guarantees quality instructors.
Student Projects, Stupros
SPIRO guarantees competence.
Projects, student projects
SPIRO guarantees that training from SPIRO will be more cost-effective than training from any other source.
Final Year Projects, Projects, student projects
SPIRO guarantees that students in open-enrollment classes are protected against cancellations and will be able to receive desired training at the cost they expect and in the time frame they have planned.
Projects for student
SPIRO guarantees overall quality with a 100% money-back guarantee. If you're not totally satisfied for any reason, simply withdraw before the second day of any class. Notify the instructor and return all course materials and you will receive a 100% refund.
SPIRO SOLUTIONS PRIVATE LIMITED
For ECE,EEE,E&I, E&C & Mechanical,Civil, Bio-Medical
#1, C.V.R Complex, Singaravelu St, T.Nagar, Chennai - 17,
(Behind BIG BAZAAR)Tamilnadu,India
Mobile : +91-9962 067 067, +91-9176 499 499
Landline : 044-4264 1213
Email: info@spiroprojects.com

For IT, CSE, MSC, MCA, BSC(CS)B.COM(cs)
#78, 3rd Floor, Usman Road, T.Nagar, Chennai-17.
(Upstair Hotel Saravana Bhavan) Tamilnadu,India
Mobile: +91-9791 044 044, +91-9176 644 044
E-Mail: info1@spiroprojects.com
About Us | Project Training | Privacy policy | Disclaimer | Contact Us

Copyright © 2015-2016 Stupros All rights reserved.