Location of Repository

The Optimal Buffer Allocation Problem

By Venkat Anantharam

Abstract

We have available a fixed number of btfffer spaces to be allocated among the nodes of an open network of exponential servers with Bernoulli routing and Poisson arrivals. The goal is to optimize a perfor- mance criterion associated with the time to buffer overflow, such as maximizing its mean or maximizing the probabili that it exceeds .some value. We argue that for any such criterion the assignment should be done roughly in inverse proportion to the logarithms of the effective service rales at the nodes. Here, by effective service rate we mean the ratio of the service rate no the stationary arrival rate at the node in the network with infinite buffers

Year: 1989
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.7025
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.eecs.berkeley.edu/~... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.