Hierarchy Proxy Cache Based On Different Level Load Sharing With Dynamic Hash

• Main Authors: Annsi Huang, 黃安賜
• Other Authors: Shyh-In Hwang
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/15670731107593626578

碩士 === 元智大學 === 資訊工程學系 === 90 === The growth of Internet has increased rapidly with the wide-spread popularity of the World-Wide Web (WWW). There are enormous amount of duplicated web objects through the network over and over again. As a consequence, user latency for accessing the web resource has become unsatisfactory. Web proxy cache is one popular approach to reduce the user latency for accessing the WWW resources. The dramatic increase of Internet users arises the network traffic overloading. The proxy cache system must face such traffic spikes. An overloaded proxy system will create more network traffic than non-proxy mode users for the sake of the queries timeout. In the case, users must try to connect original web servers again. In this thesis, we proposed a load sharing policy based on the hierarchy proxy cache structure. We take advantage of the hierarchy characteristics and make use of the system resources more efficiently at the higher level. We make the load sharing occur at different levels with dynamic hash routing policy for the overloading status of the hierarchy proxy cache system. By doing so, network traffic spikes could be reduced and keep the latency for the proxy mode users with our load balance mechanism.