From static to dynamic routing
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 215-224
- https://doi.org/10.1145/301250.301307
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Shortest-Path Routing in Arbitrary NetworksJournal of Algorithms, 1999
- Universal Continuous Routing StrategiesTheory of Computing Systems, 1998
- Universal O(congestion + dilation + log1+εN) local control packet switching algorithmsPublished by Association for Computing Machinery (ACM) ,1997
- Adversarial queueing theoryPublished by Association for Computing Machinery (ACM) ,1996
- Distributed packet switching in arbitrary networksPublished by Association for Computing Machinery (ACM) ,1996
- Universal algorithms for store-and-forward and wormhole routingPublished by Association for Computing Machinery (ACM) ,1996
- Universal continuous routing strategiesPublished by Association for Computing Machinery (ACM) ,1996
- Randomized Routing and Sorting on Fixed-Connection NetworksJournal of Algorithms, 1994
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- How to emulate shared memoryJournal of Computer and System Sciences, 1991