Accession Number:

AD0647462

Title:

A SIMPLE PROOF OF: L=LAMBDA W

Descriptive Note:

Research rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1966-12-01

Pagination or Media Count:

15.0

Abstract:

A simple proof of the fundamental queueing formula Llambda 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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE