We prove that the buffer bound in [CFZF98] can be improved, by using a modification of the proofs in the original paper [CFZF98], together with so-called network calculus bounds. We also show that the delay bound in [CFZF98] is the sum of worst case queuing delays at all nodes along the path of a connection.