Managing the Communication between different Node Randomly

Abstract

Due to the exponentially increase popularity of the services provided over the public use, problem with current mechanisms for control and management of the internet and other networks built on the internet protocol do not provide sufficient support for the efficient control management of traffic. Increasing demands of services from terminal users. Developers to offer more and more sophisticated traffic engineering methods for network control and to provide congestion free network. Distributed peer-to-peer and overlay network, including several that the authors wish to build, often require that a random graph be constructed, and that some form of random node selection take place over that graph. A main component of both of these requirements is the random walk, which can be used to select random nodes when building a graph, and can be used to select random nodes over the created graph. While there are numerous studies that look at specific aspects of random walks, the literature ultimately did not provide a comprehensive and satisfactory approach that would work with results over a range of applications. Using survey, this paper compares a number of techniques some novel and some variations on known approaches for building random techniques and doing random node selection over those techniques. These criteria include simplicity of operation, support for node heterogeneity, quality of random selection, scalability, efficiency and robustness. We show that all these criteria can be met, and that while no approach is superior against all criteria, our main approach broadly stands out as the best approach. Various method have been used to solve the problem and from the data packets point of view to reach to the destination avoiding to travel to the congested path or the path which had been failed due to network congestion but if we apply Dijkstra's Algorithm for load Balancing then we will be getting appropriate path that to at a minimum cost.