SlideShare a Scribd company logo
The Client Assignment Problem for Continuous Distributed 
Interactive Applications: Analysis,Algorithms, and 
Evaluation 
ABSTRACT: 
Interactivity is a primary performance measure for distributed interactive 
applications (DIAs) that enable participants at different locations to interact with 
each other in real time. Wide geographical spreads of participants in large-scale 
DIAs necessitate distributed deployment of servers to improve interactivity. In 
distributed server architecture, the interactivity performance depends on not only 
client-to-server network latencies but also inter-server network latencies, as well as 
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. 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: 
Distributed interactive applications (DIAs), such as multiplayer online games and 
distributed interactive simulations, allow participants at different locations to 
interact with one another through networks. Thus, the interactivity of DIAs is 
important for participants to have enjoyable interaction experiences. Normally, 
interactivity is characterized by the duration from the time when a participant 
issues an operation to the time when the effect of the operation is presented to the 
same participant or other participants . We refer to this duration as the interaction 
time between participants. Network latency is known as a major barrier to provide 
good interactivity in DIAs . It cannot be eliminated from the interactions among 
participants and has a lower theoretical limit imposed by the speed of light.
DISADVANTAGES OF EXISTING SYSTEM: 
1. Interaction between the client and server not much effective. 
2. It has more Network latency which barries interactive of DIA. 
PROPOSED SYSTEM: 
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 
change their states not only in response to user-initiated operations but also due to 
the passing of time 
Several heuristic assignment algorithms are then proposed. Their approximation 
ratios are theoretically analyzed. The performance of the algorithms is also 
experimentally evaluated using real Internet latency data. The 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 Nearest-Server Assignment 
algorithm that assigns each client to its nearest server. Distributed-Modify
Assignment also has good adaptivity to dynamics in client participation and 
network latency. 
ADVANTAGES OF PROPOSED SYSTEM: 
1. Reducing network latency for improving interactivity in DIAs. 
2. Server calculation more effective than existing system. 
SYSTEM REQUIREMENTS: 
HARDWARE REQUIREMENTS: 
 System : Pentium IV 2.4 GHz. 
 Hard Disk : 40 GB. 
 Floppy Drive : 1.44 Mb. 
 Monitor : 15 VGA Colour. 
 Mouse : Logitech. 
 Ram : 512 Mb. 
SOFTWARE REQUIREMENTS: 
 Operating system : Windows XP/7. 
 Coding Language : JAVA/J2EE
 IDE : Netbeans 7.4 
 Database : MYSQL 
REFERENCE: 
Lu Zhang and Xueyan Tang, “The Client Assignment Problem for Continuous 
Distributed Interactive Applications: Analysis, Algorithms, and Evaluation” IEEE 
TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,VOL. 
25,NO.3,MARCH 2014.

More Related Content

Similar to JPJ1443 The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation (20)

DOCX
the client assignment problem for continuous distributed interactive applicat...
swathi78
 
DOCX
2014 IEEE JAVA PARALLEL DISTRIBUTED PROJECT The client assignment problem for...
IEEEGLOBALSOFTSTUDENTSPROJECTS
 
DOCX
Final Year Project IEEE 2015
TTA_TNagar
 
DOCX
Final Year IEEE Project Titles 2015
TTA_TNagar
 
DOCX
16 & 2 marks in i unit for PG PAWSN
Dhaya kanthavel
 
PDF
Client server computing
StudsPlanet.com
 
PDF
J017367075
IOSR Journals
 
PDF
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
iosrjce
 
PDF
NEW APPROACH TO DEVELOP THE MESSENGER APPLICATION: FROM CLIENTSERVER DESIGN T...
cscpconf
 
PPTX
Latency equalization as a new network service primitive.ppt
Shankar Murthy
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
PDF
Mca & diplamo java titles
tema_solution
 
the client assignment problem for continuous distributed interactive applicat...
swathi78
 
2014 IEEE JAVA PARALLEL DISTRIBUTED PROJECT The client assignment problem for...
IEEEGLOBALSOFTSTUDENTSPROJECTS
 
Final Year Project IEEE 2015
TTA_TNagar
 
Final Year IEEE Project Titles 2015
TTA_TNagar
 
16 & 2 marks in i unit for PG PAWSN
Dhaya kanthavel
 
Client server computing
StudsPlanet.com
 
J017367075
IOSR Journals
 
The Grouping of Files in Allocation of Job Using Server Scheduling In Load Ba...
iosrjce
 
NEW APPROACH TO DEVELOP THE MESSENGER APPLICATION: FROM CLIENTSERVER DESIGN T...
cscpconf
 
Latency equalization as a new network service primitive.ppt
Shankar Murthy
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 
Mca & diplamo java titles
tema_solution
 

More from chennaijp (20)

DOCX
JPEEE1440 Cascaded Two-Level Inverter-Based Multilevel STATCOM for High-Pow...
chennaijp
 
DOCX
JPN1423 Stars a Statistical Traffic Pattern
chennaijp
 
DOCX
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
chennaijp
 
DOCX
JPN1420 Joint Routing and Medium Access Control in Fixed Random Access Wire...
chennaijp
 
DOCX
JPN1418 PSR: A Lightweight Proactive Source Routing Protocol For Mobile Ad H...
chennaijp
 
DOCX
JPN1417 AASR: An Authenticated Anonymous Secure Routing Protocol for MANETs ...
chennaijp
 
DOCX
JPN1416 Sleep Scheduling for Geographic Routing in Duty-Cycled Mobile Sensor...
chennaijp
 
DOCX
JPN1415 R3E: Reliable Reactive Routing Enhancement for Wireless Sensor Netw...
chennaijp
 
DOCX
JPN1411 Secure Continuous Aggregation in Wireless Sensor Networks
chennaijp
 
DOCX
JPN1414 Distributed Deployment Algorithms for Improved Coverage in a Networ...
chennaijp
 
DOCX
JPN1413 An Energy-Balanced Routing Method Based on Forward-Aware Factor for...
chennaijp
 
DOCX
JPN1412 Transmission-Efficient Clustering Method for Wireless Sensor Networ...
chennaijp
 
DOCX
JPN1410 Secure and Efficient Data Transmission for Cluster-Based Wireless Se...
chennaijp
 
DOCX
JPN1409 Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks
chennaijp
 
DOCX
JPN1408 Hop-by-Hop Message Authentication and Source Privacy in Wireless Sen...
chennaijp
 
DOCX
JPN1406 Snapshot and Continuous Data Collection in Probabilistic Wireless S...
chennaijp
 
DOCX
JPN1405 RBTP: Low-Power Mobile Discovery Protocol through Recursive Binary T...
chennaijp
 
DOCX
JPN1404 Optimal Multicast Capacity and Delay Tradeoffs in MANETs
chennaijp
 
DOCX
JPM1410 Images as Occlusions of Textures: A Framework for Segmentation
chennaijp
 
DOCX
JPM1407 Exposing Digital Image Forgeries by Illumination Color Classification
chennaijp
 
JPEEE1440 Cascaded Two-Level Inverter-Based Multilevel STATCOM for High-Pow...
chennaijp
 
JPN1423 Stars a Statistical Traffic Pattern
chennaijp
 
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
chennaijp
 
JPN1420 Joint Routing and Medium Access Control in Fixed Random Access Wire...
chennaijp
 
JPN1418 PSR: A Lightweight Proactive Source Routing Protocol For Mobile Ad H...
chennaijp
 
JPN1417 AASR: An Authenticated Anonymous Secure Routing Protocol for MANETs ...
chennaijp
 
JPN1416 Sleep Scheduling for Geographic Routing in Duty-Cycled Mobile Sensor...
chennaijp
 
JPN1415 R3E: Reliable Reactive Routing Enhancement for Wireless Sensor Netw...
chennaijp
 
JPN1411 Secure Continuous Aggregation in Wireless Sensor Networks
chennaijp
 
JPN1414 Distributed Deployment Algorithms for Improved Coverage in a Networ...
chennaijp
 
JPN1413 An Energy-Balanced Routing Method Based on Forward-Aware Factor for...
chennaijp
 
JPN1412 Transmission-Efficient Clustering Method for Wireless Sensor Networ...
chennaijp
 
JPN1410 Secure and Efficient Data Transmission for Cluster-Based Wireless Se...
chennaijp
 
JPN1409 Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks
chennaijp
 
JPN1408 Hop-by-Hop Message Authentication and Source Privacy in Wireless Sen...
chennaijp
 
JPN1406 Snapshot and Continuous Data Collection in Probabilistic Wireless S...
chennaijp
 
JPN1405 RBTP: Low-Power Mobile Discovery Protocol through Recursive Binary T...
chennaijp
 
JPN1404 Optimal Multicast Capacity and Delay Tradeoffs in MANETs
chennaijp
 
JPM1410 Images as Occlusions of Textures: A Framework for Segmentation
chennaijp
 
JPM1407 Exposing Digital Image Forgeries by Illumination Color Classification
chennaijp
 
Ad

Recently uploaded (20)

PDF
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
PDF
Design Thinking basics for Engineers.pdf
CMR University
 
PPTX
Introduction to Design of Machine Elements
PradeepKumarS27
 
PDF
Unified_Cloud_Comm_Presentation anil singh ppt
anilsingh298751
 
PPTX
GitOps_Repo_Structure for begeinner(Scaffolindg)
DanialHabibi2
 
PPTX
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
PPTX
Thermal runway and thermal stability.pptx
godow93766
 
PPTX
Day2 B2 Best.pptx
helenjenefa1
 
PPTX
GitOps_Without_K8s_Training_detailed git repository
DanialHabibi2
 
PPTX
Solar Thermal Energy System Seminar.pptx
Gpc Purapuza
 
PPTX
Types of Bearing_Specifications_PPT.pptx
PranjulAgrahariAkash
 
PPTX
The Role of Information Technology in Environmental Protectio....pptx
nallamillisriram
 
PPTX
GitOps_Without_K8s_Training simple one without k8s
DanialHabibi2
 
PPTX
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
PDF
Ethics and Trustworthy AI in Healthcare – Governing Sensitive Data, Profiling...
AlqualsaDIResearchGr
 
PDF
Basic_Concepts_in_Clinical_Biochemistry_2018كيمياء_عملي.pdf
AdelLoin
 
DOCX
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
PPTX
Product Development & DevelopmentLecture02.pptx
zeeshanwazir2
 
PPTX
Hashing Introduction , hash functions and techniques
sailajam21
 
PPT
PPT2_Metal formingMECHANICALENGINEEIRNG .ppt
Praveen Kumar
 
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
Design Thinking basics for Engineers.pdf
CMR University
 
Introduction to Design of Machine Elements
PradeepKumarS27
 
Unified_Cloud_Comm_Presentation anil singh ppt
anilsingh298751
 
GitOps_Repo_Structure for begeinner(Scaffolindg)
DanialHabibi2
 
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
Thermal runway and thermal stability.pptx
godow93766
 
Day2 B2 Best.pptx
helenjenefa1
 
GitOps_Without_K8s_Training_detailed git repository
DanialHabibi2
 
Solar Thermal Energy System Seminar.pptx
Gpc Purapuza
 
Types of Bearing_Specifications_PPT.pptx
PranjulAgrahariAkash
 
The Role of Information Technology in Environmental Protectio....pptx
nallamillisriram
 
GitOps_Without_K8s_Training simple one without k8s
DanialHabibi2
 
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
Ethics and Trustworthy AI in Healthcare – Governing Sensitive Data, Profiling...
AlqualsaDIResearchGr
 
Basic_Concepts_in_Clinical_Biochemistry_2018كيمياء_عملي.pdf
AdelLoin
 
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
Product Development & DevelopmentLecture02.pptx
zeeshanwazir2
 
Hashing Introduction , hash functions and techniques
sailajam21
 
PPT2_Metal formingMECHANICALENGINEEIRNG .ppt
Praveen Kumar
 
Ad

JPJ1443 The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation

  • 1. The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis,Algorithms, and Evaluation ABSTRACT: Interactivity is a primary performance measure for distributed interactive applications (DIAs) that enable participants at different locations to interact with each other in real time. Wide geographical spreads of participants in large-scale DIAs necessitate distributed deployment of servers to improve interactivity. In distributed server architecture, the interactivity performance depends on not only client-to-server network latencies but also inter-server network latencies, as well as 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. 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
  • 2. 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: Distributed interactive applications (DIAs), such as multiplayer online games and distributed interactive simulations, allow participants at different locations to interact with one another through networks. Thus, the interactivity of DIAs is important for participants to have enjoyable interaction experiences. Normally, interactivity is characterized by the duration from the time when a participant issues an operation to the time when the effect of the operation is presented to the same participant or other participants . We refer to this duration as the interaction time between participants. Network latency is known as a major barrier to provide good interactivity in DIAs . It cannot be eliminated from the interactions among participants and has a lower theoretical limit imposed by the speed of light.
  • 3. DISADVANTAGES OF EXISTING SYSTEM: 1. Interaction between the client and server not much effective. 2. It has more Network latency which barries interactive of DIA. PROPOSED SYSTEM: 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 change their states not only in response to user-initiated operations but also due to the passing of time Several heuristic assignment algorithms are then proposed. Their approximation ratios are theoretically analyzed. The performance of the algorithms is also experimentally evaluated using real Internet latency data. The 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 Nearest-Server Assignment algorithm that assigns each client to its nearest server. Distributed-Modify
  • 4. Assignment also has good adaptivity to dynamics in client participation and network latency. ADVANTAGES OF PROPOSED SYSTEM: 1. Reducing network latency for improving interactivity in DIAs. 2. Server calculation more effective than existing system. SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS:  System : Pentium IV 2.4 GHz.  Hard Disk : 40 GB.  Floppy Drive : 1.44 Mb.  Monitor : 15 VGA Colour.  Mouse : Logitech.  Ram : 512 Mb. SOFTWARE REQUIREMENTS:  Operating system : Windows XP/7.  Coding Language : JAVA/J2EE
  • 5.  IDE : Netbeans 7.4  Database : MYSQL REFERENCE: Lu Zhang and Xueyan Tang, “The Client Assignment Problem for Continuous Distributed Interactive Applications: Analysis, Algorithms, and Evaluation” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,VOL. 25,NO.3,MARCH 2014.