Abstract:We consider the problem of forwarding packets arriving online with their destinations in a line network. In each time step, each router can forward one packet along the edge to its right, and the packet arrives at the next router one time step later. Packets are forwarded until they reach their destination. The flow time of a packet is the elapsed time between its release and its arrival at its destination. The goal is to minimize the maximum flow time.
This problem was introduced by Antoniadis et al. in 2014, with a focus on line networks. They proposed several natural algorithms. For one, they proved that it is not $O(1)$-competitive; for others, they claimed analogous lower bounds, seemingly leaving no natural candidate for an $O(1)$-competitive algorithm.
In this paper, we study a natural algorithm not considered in that work. Our algorithm, simply called Greedy, selects packets according to their projected flow time under the assumption that they are not delayed any further. We focus on the special case in which each packet needs to be forwarded by one or two routers; this case captures core difficulties. We show that Greedy achieves a competitive ratio of exactly $2-2^{1-k}$, where $k$ is the number of active routers in the network.
We also give the first nontrivial general lower bound, which applies even to randomized algorithms: using the same type of instances as in our lower bound for Greedy, we show that no algorithm can be $(4/3-\varepsilon)$-competitive for any $\varepsilon>0$.
From: Kevin Schewior [view email]
[v1]
Fri, 6 Mar 2026 08:49:57 UTC (19 KB)
[v2]
Wed, 29 Jul 2026 18:21:04 UTC (19 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。