Return-Path: william@bourbon.usc.edu
Delivery-Date: Fri Apr 27 07:44:18 2007
X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on merlot.usc.edu
X-Spam-Level: 
X-Spam-Status: No, score=-3.3 required=5.0 tests=ALL_TRUSTED,AWL,BAYES_00,
	NO_REAL_NAME autolearn=ham version=3.1.3
Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75])
	by merlot.usc.edu (8.13.5/8.13.5) with ESMTP id l3REiITV024618
	for <cs551@merlot.usc.edu>; Fri, 27 Apr 2007 07:44:18 -0700
Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1])
	by bourbon.usc.edu (8.13.5/8.13.5) with ESMTP id l3REhjGU017347
	for <cs551@merlot>; Fri, 27 Apr 2007 07:43:45 -0700
Message-Id: <200704271443.l3REhjGU017347@bourbon.usc.edu>
To: cs551@merlot.usc.edu
Subject: Re: Steady-state queuing 
Date: Fri, 27 Apr 2007 07:43:45 -0700
From: william@bourbon.usc.edu

Someone wrote:

  > On p. 31 of the DEC-bit slide, we have:
  > 
  > Full queues problem:
  > 
  > Drop tail maintains full or nearly-full queues
  > during congestion; but queue limits should reflect
  > the size of bursts we want to absorb, not steady-state
  > queuing.
  > 
  > I do not quite understand "steady-state queuing",
  > can you elaborate?

Steady-state means "long-term equilibrium".  (Of course, in
networking, "long-term" could just mean seconds or minutes.)
Queueing means queue built up, which implies there is a
congestion of some sort (not congestion collapse).  So,
"steady-state queueing" can be think of as related to
"long-term congestion".
--
Bill Cheng // bill.cheng@usc.edu <URL:http://merlot.usc.edu/william/usc/>