Web Proxy Caching Object Replacement: Frontier Analysis to Discover the Good-Enough Algorithms

Kastaniotis, Georgios; Maragos, Elias K.; Dimitsas, V.; Douligeris, Christos; Despotis, Dimitris K.

doi:10.1109/mascots.2007.68

Cited by 4 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The commonly used indicators to measure the performance of the cache replacement algorithm [22] mainly include Hit Ratio (HR), Byte Hit Ratio (BHR) and Delay Saving Radio (DSR). In this paper, Hit Radio (HR) and Byte Hit Ratio (BHR), the most commonly used ones, are adopted.Hit rate is an indication of user perceived lag, while byte hit rate is an indication of the amount of network traffic [35].…”

Section: Performance Indicatorsmentioning

confidence: 99%

“…Therefore, in the experiment in this section, STW_SIZE is set to 13 hours. The literature [22] demonstrates that a better hit ratio can be achieved in the cache replacement algorithm with the relative capacity of the cache reaching 20%.Therefore, in this section, the relative size of the cache capacity TotalSize is set to 20% of the total amount of access. The algorithm GDSF-DST is experimented with daily log data from September 1 th , 2017 to September 10 th , 2017.When the decay factor f is respectively set to 0.94, 0.95, 0.96, 0.97, 0.98, 0.99, 0.991, 0.992, 0.993, 0.994, 0.995, 0.996, 0.997, 0.998, 0.999 and 1, the values of HR and BHR are shown in Fig.…”

Section: The Influence Of Decay Factor F On Hit Ratio and Byte Hit Ratiomentioning

confidence: 99%

“…In addition, each type of algorithms has its own advantages and disadvantages. Even if some are the ones so-called "good enough" through which better results can be obtained on the basic performance indicators [6,22], none can perform well in any application environment. The network environment is dynamic and uncertain.…”

Section: Introductionmentioning

confidence: 99%

“…No replacement strategies can well adapt to any network situation. Therefore, it has become a hot spot in the field of cache replacement which algorithm is the most appropriate replacement strategy according to varied network conditions and access characteristics [22].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Web Cache Replacement Strategy for Safety-Critical Systems

Gao

et al. 2018

Teh. vjesn.

View full text Add to dashboard Cite

A Safety-Critical System (SCS), such as a spacecraft, is usually a complex system. It produces a large amount of test data during a comprehensive testing process. The large amount of data is often managed by a comprehensive test data query system. The primary factor affecting the management experience of a comprehensive test data query system is the performance of querying the test data. It is a big challenge to manage and maintain the huge and complex testing data.To address this challenge, a web cache replacement algorithm which can effectively improve the query performance and reduce the network latency is needed. However, a general-purpose web cache replacement algorithm usually cannot be directly applied to this type of system due to the low hit rate and low byte hit rate. In order to improve the hit rate and byte hit rate, a data stream mining technology is introduced, and a new web cache algorithm GDSF-DST (Greedy Dual-Size Frequency with Data Stream Technology) for the Safety-Critical System (SCS) is proposed based on the original GDSF algorithm. The experimental results show that compared with state of the art traditional algorithms, GDSF-DST achieves competitive performance and improves the hit rate and byte hit rate by about 20%.

show abstract

Section: Performance Indicatorsmentioning

confidence: 99%

Section: The Influence Of Decay Factor F On Hit Ratio and Byte Hit Ratiomentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Web Cache Replacement Strategy for Safety-Critical Systems

Gao

et al. 2018

Teh. vjesn.

View full text Add to dashboard Cite

show abstract

“…El algoritmo básico para la toma de decisión de un proxy cache se puede observar en la Figura 21 cuando un cliente realiza una petición web. La Figura 21 también muestra la problemática asociada una vez el proxy cache ha obtenido una copia del servidor, pues debe determinar si almacenar el contenido una vez servido o no; en caso afirmativo, deberá tener en cuenta durante cuánto tiempo debe almacenarlo para que una modificación de un objeto web en el servidor no represente ningún problema, y una nueva petición por parte de un cliente suponga obtener dicho objeto web con la última modificación [Kas_07].…”

Section: Web Cachingunclassified