Efficient Client-Server Assignment for Internet Distributed Systems

Abstract

The World Wide Web is used by millions of people every day for various purposes including email, reading news, downloading music, online shopping or simply accessing information about anything. Using a standard web browser, the user can access information stored on Web servers situated anywhere on the globe. This gives the illusion that all this information is situated locally on the user’s computer. In reality, Internet is a collection of several distributed systems consisting of various clients and servers. These clients communicate with each other with the help of transitional servers. As this field is the most useful area of the computer science, optimizing on the whole performance of such a system then can be formulated as a client server assignment problem whose aim is to allocate the clients to the servers in such a way to satisfy some pre-specified necessities on the communication cost and load balancing. Servers recover from failures and get back information needed. It provides fault tolerance by doing work in the background and during client operations that are rare. I propose an approach based on an algorithm which obtains better efficiency than the exis ting client server assignment and load balancing.