Online computation and competitive analysis
Online computation and competitive analysis
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Approximation algorithms for time-constrained scheduling on line networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online packet-routing in grids with bounded buffers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We study the problem of online packet routing in dynamic store-and-forward directed line networks. We present a centralized randomized online algorithm that achieves a throughput that is O(log n)-competitive, where n denotes the number of nodes. Our algorithm is applicable to all values of buffer sizes and communication link capacities. In particular, it holds also for unit buffers. This algorithm improves the best previous O(log2 n)-competitive ratio of [6] and considers links with unit capacities.