Internationale Zeitschrift für Fortschritte in der Technologie
Offener Zugang

Abstrakt

Estimation of Data Base (DB) Server Cache Size using GI/G/n/k Queuing Model

Dr Riktesh Srivastava

Continuous boost in the number of Internet users has taken an exponential escalation over the years. It is becoming thorny to endow with services to all the Internet users because of infrastructural precincts of WWW. Caching data base objects at DB servers has proven to be one of the preeminent alternatives for fast services. Caching DB server improves the performance of overall web access. Since the introduction of DB servers, most of the evaluations studies are performed either on Web-replacement algorithms or methodologies of maintaining the data in cache. Only few of studies have been done assuring DB server cache size. This paper describes the methodology of estimating the cache size under high busty traffic situation. An investigational evaluation study applying M/M/1 Queuing Theory methodology is first appraised and then experimented. The study uses a trace-driven simulation framework, real traces containing approximately 1010 number of user's requests per unit time, and then evaluates the Optimal DB Cache Size (DBoptimal) using GI/G/n/k Queue Analysis.