Greedy Dynamic Routing on Arrays
- 30 November 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 29 (2) , 390-410
- https://doi.org/10.1006/jagm.1998.0958
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Bounding delays in packet-routing networksPublished by Association for Computing Machinery (ACM) ,1995
- Queues served by a rotating ringCommunications in Statistics. Stochastic Models, 1995
- Bounds on the greedy routing algorithm for array networksPublished by Association for Computing Machinery (ACM) ,1994
- The efficiency of greedy routing in hypercubes and butterfliesPublished by Association for Computing Machinery (ACM) ,1991
- Average case analysis of greedy routing algorithms on arraysPublished by Association for Computing Machinery (ACM) ,1990
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952