A 2n-2 step algorithm for routing in an nxn array with constant size queues
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth 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
Theoretical Computer Science - Special issue on parallel computing
Shortest-path routing in arbitrary networks
Journal of Algorithms
The Quickest Transshipment Problem
Mathematics of Operations Research
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
SIAM Journal on Computing
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Direct routing: Algorithms and complexity
Algorithmica
SIAM Journal on Computing
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Constraint satisfaction, packet routing, and the lovasz local lemma
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We prove bounds for the length of optimal schedules for store-and-forward packet routing in the setting of arbitrary bandwidths and transit times. The problem is commonly studied only in the setting of unit bandwidths and unit transit times. Our results generalize the existing work to a much broader class of instances and also improve the known bounds significantly. For the case of unit transit times and bandwidths we improve the best known bound of 39(C +D) to 23.4(C +D), where C and D denote the trivial lower bounds congestion and dilation. If every link in the network has a certain minimum transit time or capacity our bounds improve even further up to 4.32(C + D). Key to our results is a framework which employs tight bounds for instances where each packet travels along only a small number of edges. Further insights for such instances would reduce our constants even more. This is the first improvement of the bounds for this very fundamental problem in more than 10 years.