A generalized queueing network model to study Proxy Cache Servers, Prof. Tamas Berczes

  • N. N. (Organiser)

Activity: Participating in or organising an event › Organising a conference, workshop, ...

Description

In this talk we treat a modification of the performance model of Proxy Cache Servers to a more powerful case when the inter-arrival times and the service times are generally distributed. First we describe the original Proxy Cache Server model where the arrival process is a Poisson process and the service times are supposed to be exponentially distributed random variables. Then we calculate the basic performance parameters of the modified performance model using the well known Queueing Network Analysis (QNA) approximation method. The accuracy of the new model is validated by means of a simulation study over an extended range of test cases.
Period20 Jun 2012
Event typeGuest talk
LocationAustriaShow on map

Fields of science

  • 101002 Analysis
  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 102 Computer Sciences
  • 101 Mathematics
  • 101009 Geometry
  • 102011 Formal languages
  • 101006 Differential geometry
  • 101005 Computer algebra
  • 101025 Number theory
  • 101003 Applied geometry
  • 102025 Distributed systems

JKU Focus areas

  • Computation in Informatics and Mathematics