Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies.

Abstract

Consider a finite waiting room shared by several servers. Such a system may approximate, for instance, a packet switch in a communications network or a buffer shared by producer-consumer parallel processes. It is assumed that a customer is lost if he cannot enter the waiting room. Furthermore, the waiting room is partitioned into (L+1) areas, where L is the number of servers: each of the first L areas is reserved for the exclusive use of one server, the (L+1)st is common and may be used by all servers. This allocation policy is referred to as (L+1)- sharing.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1978
Accession Number
ADA059508

Entities

People

  • Guy Latouche

Organizations

  • University of Delaware

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Coefficients
  • Computer Communications
  • Computer Networks
  • Computer Science
  • Computers
  • Consumers
  • Information Processing
  • Networks
  • Numbers
  • Probability
  • Probability Distributions
  • Random Variables
  • Square Roots
  • Steady State
  • Stochastic Processes

Readers

  • Computer Networking
  • Operations Research
  • Thermal Physics or Thermal Science.

Technology Areas

  • Space