Greedy packet scheduling on shortest paths
Journal of Algorithms
Optimal algorithms for multipacket routing problems on rings
Journal of Parallel and Distributed Computing
SIAM Journal on Computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling Data Redistribution in Distributed Databases
Proceedings of the Sixth International Conference on Data Engineering
Deterministic Routing and Sorting on Rings
Proceedings of the 8th International Symposium on Parallel Processing
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract)
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this problem on linear array and ring networks. We generalize an earlier result for the offline problem by showing that FARTHEST FIRST (FF) scheduling is optimal with respect to makespan on linear arrays. We also show that two other algorithms (LONGEST IN SYSTEM (LIS) and MOVING PRIORITY (MP)) have competitive ratio 2 with respect to makespan on linear arrays. For bidirectional rings, we show that, the competitive ratio of shortest path routing combined with LIS or MP scheduling is in [2.5, 3) and the competitive ratio of shortest path routing combined with FF scheduling is 2. The latter algorithm is optimal among deterministic memoryless algorithms and all algorithms of which we are aware in the literature.