A Novel Approach on Client Server Assignment Problem in Distributed System
Abstract
Inter server communication within two or more servers in distributed system shows interactive performance of the system. While assigning client to server there is problem of latency and interaction time between clients. When we are deal with client assignment problem, two states are consider. In initial assignment phase the zone of virtual world are assigned to server then in next phase, a client is assigned to an appropriate (nearby) server to communicate with the server. By using many tools and algorithms distributed system try to balance the load of server and total communication cost should be less. In this paper based on the analysis of different techniques to assign the client to server, considering the parameters like Load Balancing and Total communication cost, we have proposed Pre-Emptive algorithm to balance the load and minimize the total communication cost of the network.
Key words: Client Assignment Problem (CAP), Load Balance, Total Communication Cost, Inter-latency.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Engineering Technology and Computer Research (IJETCR) by Articles is licensed under a Creative Commons Attribution 4.0 International License.