Re: [Diffserv] Model - queues - replacement text

[awduche@xxxxxx (Daniel Awduche)]

More precisely, a queue is a representation of a dynamic 
data set which depicts an ordered relation between 
set elements. 

The "representation" of the set and the "storage" 
of set elements are separable. The "queue" may be ordered, 
but the "storage" of set elements need not necessarily 
be ordered. The representation (e.g. a data structure
with keys and pointers) may support some elementary 
functions (insert/discard/etc) which may be activated 
by engines external to the representation. The queuing
system consists of the dynamic data set, the 
representation, storage, and activating engine(s).

Cheers,
/Dan

Grenville Armitage said:
> 
> Noted that we're attempting to converge terminology use here.
> I have no problem with the notion that an ordered store
> plus add/discard/schedule engines is a queuing system.
> Based on what you say above, I believe the MIB draft is
> being over-inclusive. We should keep queues as ordered
> stores.
> 
> cheers,
> gja
> 



_______________________________________________
diffserv mailing list
diffserv@ietf.org
http://www.ietf.org/mailman/listinfo/diffserv
Archive: http://www-nrg.ee.lbl.gov/diff-serv-arch/