Abstract

This paper studies random request distribution and load balancing cache protocol (RLC) and randomly selected and limited look at neighbor (RSLL) cache algorithm based on byte access frequency factor (BAFF) for Internet services with multimedia and dynamic Web content. The RSLL cache algorithm considers reducing response time and achieving good load balance among Web servers using limitation of look at neighbor Web server's cached contents and random distribution of Web client requests. The RLC cache protocol updates cached dynamic contents completely and consistently in distributed cooperative web servers. By using this cache protocol and cache algorithm for Web servers, we can build scalable Web servers supporting very fast response times, high memory hit rate, and excellent load balancing of distributed cooperative Web servers.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.