A Research Project Submitted In Partial Fulfillment Of The Requirements For The Award Of Degree Master Of Science In Data Communication Of Faculty Of Computing And Information Management At KCA University.
Recently there has been a tremendous increase in network traffic caused by several reasons amongst them being an increase of internet users. The increasednetwork traffic has really affected many other network bandwidth factorssuch daily up rise latency, very high response time for users and of course very low network bandwidth. This leads to a quick need of designing techniques that will help in optimizing available network bandwidth, ease latency, and reduce the response time for users.Therefore; there is an importance to understand various characteristics web traffic. Majority of researchers who have invested in this area of research mostly have been focusing on the problem of content aliasing in the proxy servercaches. Aliasing in proxy server caches is said to have occurred when the similar content iscached and deposited in a cache repeatedly. This storing of similar content in cache repeatedly occurs when several requests are made to several different websites but contains the same content. These websites that has the same content are referred to as mirrors. Mirroringhelps in increasing efficiencywhose in return optimally increases cost of storage space in cache.In most cases, content aliasing in a proxy server consumes an enormous storage in cache.Several techniques such as abstracting common content from various websites across different domainsand websitemirrors can be used to optimally used to partially solve the problem of content aliasing in favor of proxy server caches. In contrast to other techniques I will not only devise a technique tocheck the cache contents for redundancyto reduce network latency and traffic,but also, to indirectly completely enhance the optimization of the network bandwidth. My technique shall find a solution to the problem of redundancy in content aliasing in proxy server caches and shall make a contribution to the open source community.
