On Delivery Times in Packet Networks under Adversarial Traffic

We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually delivered to destination, and of having an upper bound on the delivery times of all packets. Whether this is possible against all rate-1 adversaries was previously posed as an open question 15, 10 . Among other, we give a queuing policy that guarantees bounded delivery time whenever the rate-1 adversary itself can deliver all packets in bounded time and adheres to certain additional conditions. On the negative side we show that even the adversary itself cannot deliver all packets in bounded time for all rate-1 sequences of packets. We thus answer the open question posed by Gamarnik 15 . We further show that delivering all packets while maintaining stability we coin the term reliability" for this property can be done by an o ine scheduler whenever the injection of

• Type: Journal
• Year: 2006
• Where: MST
• Authors: Adi Rosén, Michael S. Tsirkin
• Keywords: Adversarial Queuing Theory, Delivery Time, MST 2006, Open Question