Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the benefit of supporting virtual channels in wormhole routers
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks
IEEE/ACM Transactions on Networking (TON)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Average-case analysis of greedy packet scheduling (extended astract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
Leighton, Maggs and Rao (1988) showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to their destinations in O(c+d) steps using constant-size queues, where c is the congestion of the paths in the network, and d is the length of the longest path (the dilation). The proof, however, used the Lova/spl acute/sz (1975) local lemma and was not constructive. In this paper, we show how to find such a schedule in O(NE+Elog/sup /spl epsiv//E) time, for any fixed /spl epsiv/