Search

Load redistribution algorithm is a critical element in distributed system. We propose a new load redistribution algorithm based on genetic information to obtain high response time in distributed systems. Under sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Because of these unnecessary request messages, it results in inefficient communications, low cpu utilization, and low system throughput. This algorithm decreases response time and increases acceptance rate.

In sender-initiated load balancing algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is low. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic based approach for improved sender-initiated and receiver-initiated load balancing in distributed systems.

Content Distribution Network(CDN) is one of the key components of the Internet nowadays. Many users, served by same ISP/node, request same data resulting in higher Internet traffic. Caching of data has been popular mechanism to avoid fetching the same data repeatedly from a source. There exist different caching algorithms and strategies and much of work has been done to measure their performance for general data. Although both CDN and cache replacement policies have been actively looked into by the research community, the interplay of them is still less well-understood. Moreover, performance comparison for the data as a video content has not been done much in depth. In this paper, we investigate the interaction between CDN and cache replacement algorithms for video/movie distribution in a CDN. Issues covered include 1)comparative impact of different cache replacement policies on a CDN and 2) the effect of cooperative caching versus hierarchical caching schemes. By extensive simulations, we observed that LFU is the most efficient cache-replacement algorithm and cooperative caching is better than hierarchical caching in terms of user experienced latency and CDN system cost.