In this brief note we provide a new analysis of the transient behavior of the clear-a-fraction policy of Perkins and Kumar. In addition, we show that a new "clear-average-oldest-buffer" policy and a "random part selection" policy (of which "first-come-first-served" is a special case) are stable, Finally, we introduce a stable and efficient "stream modifier" that can be used to obtain network level stability results.