الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 104 |  |  |
| | | from | 104 | | |
Abstract
Increasing of the network computer demand becomes one of the most important research fields in the computer engineering and science. So it is benefit if any client required a page (object) to obtain it as fast as possible. But this requires increases network traffic and need more bandwidth to satisfy all requests of the clients without more latency time. Increasing the network bandwidth is expensive .Reducing the network traffic can be achieved by using web caching. Web Caching is a technique used to solve the network traffic by keeping the most popular object in cache and replace rarely used ones. So when the client request any page again it will access it from the cache, this will be faster and reduce the network traffic. But due to the limited size of the cache, it may be not able to store a new page (object) when it is full size or no free space enough to store it, so it must be select one or more pages (objects) from the cache to place the new page (object), this selection will be achieved by using web cache algorithms. There are many algorithms used to select the victim object such as Least Recently Used ,Least Frequency ,Size ,Greedy Dual Size , Least Recently Used Min and Least Access Time [LRU , LFU , SIZE , GDS , LRUMIN , LAT] each one of these algorithms take one or more parameters value of the object as evidence to select the victim . This work introduces two algorithms and these are: The Least Frequency Used <U+2013>MinGreedy Dual Size (LFUMinGDS). and The Greedy Dual Size Frequency Least Recently Used (GDSFRU). Both algorithms are resulted from effective modifications on GDS algorithm in order to improve the victim selection process.