A SIMPLE PROOF OF: L=LAMBDA W

Abstract

A simple proof of the fundamental queueing formula L=lambda W is given which is based on renewal theory. The basic assumptions which are needed are: (1) the event (system is empty) is recurrent, and (2) the arrival and waiting-time mechanisms are reset by the next arrival after this event occurs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1966
Accession Number
AD0647462

Entities

People

  • William S. Jewell

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • California
  • Classification
  • Contractors
  • Contracts
  • Governments
  • Intervals
  • Military Research
  • Operations Research
  • Probability
  • Queueing Theory
  • Random Variables
  • Security
  • Theorems
  • United States
  • United States Government
  • Universities

Readers

  • Mathematical Modeling and Probability Theory.