Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On-Line Routing in All-Optical Networks
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
Strong performance guarantees for asynchronous buffered crossbar scheduler
IEEE/ACM Transactions on Networking (TON)
An O(log n)-competitive online centralized randomized packet-routing algorithm for lines
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We present the first online algorithm with a polylogarithmic competitive ratio for the problem of online routing of packets in unidirectional grids. The goal is to maximize the throughput, i.e., the number of delivered packets. Our online algorithm is deterministic, centralized, handles packets with deadlines, allows bounded buffers, uses adaptive routing, and may drop packets before they reach their destination. All previous online algorithms for packet routing on a unidirectional line with polylogarithmic competitive ratios are randomized [AZ05, AKK09, EM10]. Our algorithm is the first deterministic online algorithm with a polylogarithmic competitive ratio.