Log in

Relevant bibliographies by topics / Byte-hit-ratio

Contents

Journal articles

Academic literature on the topic 'Byte-hit-ratio'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Byte-hit-ratio.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Byte-hit-ratio"

1

Kuttuva, Baskaran Rajendran, and Kalaiarasan Chellan. "Improving Hit Ratio and Byte Hit Ratio Using Combined Pre-Fetching and Web Caching." International Review on Computers and Software (IRECOS) 9, no. 8 (2014): 1426. http://dx.doi.org/10.15866/irecos.v9i8.2594.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Luthfianza, Muhammad, and Dimas Febriawan. "Analisa Perbandingan Web Proxy Sebagai Filtering Antara Mikrotik dan Suid Berdasarkan Hit Ratio dan Byte Hit Ratio." Jurnal Teknik Informatika dan Komputer 1, no. 1 (2022): 1–7. http://dx.doi.org/10.22236/jutikom.v1i1.8737.

Full text

Abstract:

Pada saat internet menjadi salah satu kebutuhan setiap orang yang digunakan untuk berkomunikaasi, belajar dan lain-lain. Akan tetapi internet juga memiliki dampak negatif, seperti penyebarna berita hoax, situs-situs ilegal dan lainya. Salah satu yang dapat menjadi solusi yaitu dengan memanfaatkan teknologi proxy server dengan menggunakan suatu proxy server berguna untuk memblokir situs-situs tertentu. Oleh karena itu penulis melakukan sebuah analisa proxy server yaitu MikroTik dan Squid untuk mendapatkan Hit Ratio dan Byte Hit Ratio dalam memblokir website-website tertentu. Penelitian ini bert

APA, Harvard, Vancouver, ISO, and other styles

3

Ghofir, Abdul, and Rikip Ginanjar. "Distributed Cache with Utilizing Squid Proxy Server and LRU Algorithm." Indonesian Journal of Electrical Engineering and Computer Science 7, no. 2 (2017): 474. http://dx.doi.org/10.11591/ijeecs.v7.i2.pp474-482.

Full text

Abstract:

<p>In relation to the dissemination of information, the Internet is one of the fastest media to do so. The internet’s presence is growing very swiftly and rapidly, so it has become recognized by people from all walks of life. For that, the people need the appropriate way to maintain effectiveness in the use of the Internet. The following paper describes a study of the distribution of the cache, which is performed by the squid proxy server by creating a storage network design on Linux. Cache documents that are stored in the proxy server will be distributed to another over a network storag

APA, Harvard, Vancouver, ISO, and other styles

4

Liang, Zheng You, Yi Xuan Tang, and Shuai Chang. "Smallest Cache Utility Algorithm Based on Popularity." Advanced Materials Research 171-172 (December 2010): 358–63. http://dx.doi.org/10.4028/www.scientific.net/amr.171-172.358.

Full text

Abstract:

Streaming media is an important research direction in internet applications. In this paper, A Smallest Cache Utility algorithm based on Popularity in future (SCU-PK) is proposed. It comprehensively considered the merit of media time popularity and the smallest cache utility algorithm, using the entire file byte usefulness instead of the file segment bytes usefulness, so that a more effective byte usefulness calculation method and a more rational file segment popularity calculation method was designed and implement. The experiments show that the SCU-PK algorithm has better performance in increa

APA, Harvard, Vancouver, ISO, and other styles

5

Rajendran Baskaran, Kuttuva, and Chellan Kalaiarasan. "Improved Performance by Combining Web Pre-Fetching Using Clustering with Web Caching Based on SVM Learning Method." International Journal of Computers Communications & Control 11, no. 2 (2016): 67. http://dx.doi.org/10.15837/ijccc.2016.2.897.

Full text

Abstract:

Combining Web caching and Web pre-fetching results in improving the bandwidth utilization, reducing the load on the origin server and reducing the delay incurred in accessing information. Web pre-fetching is the process of fetching the Web objects from the origin server which has more likelihood of being used in future. The fetched contents are stored in the cache. Web caching is the process of storing the popular objects ”closer” to the user so that they can be retrieved faster. In the literature many interesting works have been carried out separately for Web caching and Web pre-fetching. In

APA, Harvard, Vancouver, ISO, and other styles

6

V., Raghunatha Reddy. "WEB PROXY CACHE REPLACEMENT POLICIES USING NAÏVE BAYES (NB) MACHINE LEARNING TECHNIQUE FOR ENHANCED PERFORMANCE OF WEB PROXY." INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY 8, no. 5 (2019): 229–39. https://doi.org/10.5281/zenodo.7027357.

Full text

Abstract:

Web cache is a mechanism for the temporary storage (caching) of web documents, such as HTML pages and images, to reduce bandwidth usage, server load, and perceived lag. A web cache stores the copies of documents passing through it and any subsequent requests may be satisfied from the cache if certain conditions are met. In this paper, Naïve Bayes (NB) a machine learning technique has been used to increase the performance of traditional Web proxy caching policies such as SIZE, and Hybrid. Naïve Bayes (NB) is used and integrated with traditional Web proxy caching techniques to form bet

APA, Harvard, Vancouver, ISO, and other styles

7

WANG, JAMES Z., and VIPUL BHULAWALA. "DESIGN AND IMPLEMENTATION OF A P2P COOPERATIVE PROXY CACHE SYSTEM." Journal of Interconnection Networks 08, no. 02 (2007): 147–62. http://dx.doi.org/10.1142/s0219265907001953.

Full text

Abstract:

In this paper, we design and implement a P2P cooperative proxy caching system based on a novel P2P cooperative proxy caching scheme. To effectively locate the cached web documents, a TTL-based routing protocol is proposed to manage the query and response messages in the P2P cooperative proxy cache system. Furthermore, we design a predict query-route algorithm to improve the TTL-based routing protocol by adding extra information in the query message packets. To select a suitable cache replacement algorithm for the P2P cooperative proxy cache system, three different cache replacement algorithms,

APA, Harvard, Vancouver, ISO, and other styles

8

Nurwarsito, Heru. "Analisis Algoritma Pergantian Cache Pada Proxy Web Server Internet Dengan Simulasi." Jurnal EECCIS (electrics, electronics, communications, controls, informatics, systems) 1, no. 1 (2016): 33. http://dx.doi.org/10.21776/jeeccis.v1i1.358.

Full text

Abstract:

<p>Pertumbuhan jumlah client internet dari waktu ke waktu terus bertambah, maka respon akses internet menjadi semakin lambat. Untuk membantu kecepatan akses tersebut maka diperlukan cache pada Proxy Server. Penelitian ini bertujuan untuk menganalisis performansi Proxy Server pada Jaringan Internet terhadap penggunaan algoritma pergantian cache-nya.</p><p>Analisis Algoritma Pergantian Cache Pada Proxy Server didesain dengan metoda pemodelan simulasi jaringan internet yang terdiri dari Web server, Proxy server dan Client. Proxy Server menggunakan model hirarki dan hubungan anta

APA, Harvard, Vancouver, ISO, and other styles

9

Ling, Qiang, Lixiang Xu, Yicheng Zhang, and Jinfeng Yan. "Estimation of the Concurrent Capacity of a Streaming Media Server Based on User Behavior Analysis." August 28, 2013. https://doi.org/10.5281/zenodo.9243.

Full text

Abstract:

With the fast development of computer and network technology, streaming media has attracted more and more attention. The concurrent capacity is a major performance index, especially for media service providers. In the current literature, the concurrent capacity of a server is usually determined through experiments, which can only be done after building a server and are timeconsuming. This paper proposes a method to estimate the concurrent capacity just with the configuration parameters of a server. Due to the fast CPU and high-speed network cards, the bottleneck of the concurrent capacity is t

APA, Harvard, Vancouver, ISO, and other styles

10

Narottam, Chand. "Cooperative Data Caching in WSN." March 27, 2012. https://doi.org/10.5281/zenodo.1077760.

Full text

Abstract:

Wireless sensor networks (WSNs) have gained tremendous attention in recent years due to their numerous applications. Due to the limited energy resource, energy efficient operation of sensor nodes is a key issue in wireless sensor networks. Cooperative caching which ensures sharing of data among various nodes reduces the number of communications over the wireless channels and thus enhances the overall lifetime of a wireless sensor network. In this paper, we propose a cooperative caching scheme called ZCS (Zone Cooperation at Sensors) for wireless sensor networks. In ZCS scheme, one-hop neighbor

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!