Little Laws

  • Richard Serfozo
Chapter
Part of the Applications of Mathematics book series (SMAP, volume 44)

Abstract

In a Markovian, regenerative, or stationary network, the average sojourn times of customers in a sector of the network can often be obtained from a Little law. Specifically, a Little law for a service system says that the average sojourn time W of a customer in the system and the average queue length L of the system are related by L = λW, where λ is the average arrival rate of units to the system. This fundamental relation is a law of averages or law of large numbers when the quantities L, λ, W are “limits” of averages. It is also a law of expectations when the quantities are expected values. This chapter focuses on Little laws of averages, which are based on sample path analysis. The next chapter covers Little laws of expectations for stationary systems, which are based on Palm probability analysis.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Richard Serfozo
    • 1
  1. 1.School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations