Abstract:Inter server communication is most common word for the distributed system, it provide an interactive performance among the system. With the modern internet facility connection of server or interconnected networks is used for share the resources. An ideal system in the distributed architecture provide equal responsibility and computational power but an engaged system it fails to provide that facility among the distributed network and it also provide a load balancing problem when two or more packet send at the same time and some of the data were loosed because of collusion. For this issue many researchers try to balance the load of the server, but it improved in slight level only and if sequence of data occurred it may cause congestion problem. To recover the problem here we propose a Heuristic Algorithm (HA) to fully solve the load balancing and traffic avoidance problem and we also focus on security problem with the help of DSA Algorithm.Keywords: Distributed System, DIA, CAP, Heuristic Algorithm, Load Balancing, Traffic Control and Security.
INTRODUCTIONIn this modern world people were connected with the internet with the connection of network for the sharing resources. A network is a connection of nodes interconnected with each other to distribute the resource and computational power among the nodes, typically called Distributed System (DS) [1]. This system contains servers and clients, hence servers are more computational and resource powerful than clients. Examples of DS are EMail, e-commerce, instant messaging, social networks etc. With this distribution of the networks, it shares the resources among the nodes [2]. While users communication, it have many difficulties which includes overhead of transmission among the nodes which leads to lower performance. Communication patterns among the client and server with congestion less is a major factor among the users, which is related to Client Server assignment problem [3,4]. It is relevant one for the host of applications from above said DS. Continuous sharing of resources, Exchanging of resources will reduces the interserver communication lead a congestion problem and have to balance the communication load. It is the example of optimal client server assignment problem. For this reason distributed interactive applications (DIAs) were user [5]. DIAs is networked systems that allow multiple participants at different locations to interact with each other. DIAs often requires geographical distribution of servers to meet the latency requirements of the applications [6]. Wide spread of client locations in large-scale DIAs often requires geographical distribution of servers to meet the latency requirements of the applications. In the distributed server architecture, client assignment to servers directly affects the network latency involved in the interactions between clients [7]. Many researchers were focuses on client assignment problem (CAP) for enhancing the interactivity performance of DIAs.