Packet Forwarding Algorithms in a Line Network

Abstract. We initiate a competitive analysis of packet forwarding poli-cies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not con-stant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.

Competitive Management of Non-preemptive Queues with Multiple Values

We consider the online problem of active queue management. In our model, the input is a sequence of packets with values v ∈ [1, α] that arrive to a queue that can hold up to B packets. Specifically, we consider a FIFO non-preemptive queue, where any packet that is accepted into the queue must be sent, and packets are sent by the order of arrival. The benefit of a scheduling policy, on a given input, is the sum of values of the scheduled packets. Our aim is to find an online policy that maximizes its benefit compared to the optimal offline solution. Previous work proved that no constant competitive ratio exists for this problem, showing a lower bound of ln(α)+1 for any online policy. An upper bound of e⌈ln(α) ⌉ was proved for a few online policies. In this paper we suggest and analyze a RED-like online policy with a competitive ratio that matches the lower bound up to an additive constant proving an upper bound of ln(α) + 2 + O(ln 2 (α)/B). For large values of α, we prove that no policy whose decisions are based only on the number of packets in the queue and the value of the arriving packet, has a competitive ratio lower than ln(α) + 2 − ɛ, for any constant ɛ> 0. Submitted to the regular track. Nir Andelman is a full time student at Tel-Aviv University.