Nonmonotonic phenomena in packet routing

Average case analysis of greedy routing algorithms on arrays

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

Bounds on the greedy routing algorithm for array networks

SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Bounding delays in packet-routing networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Constant time per edge is optimal on rooted tree networks

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures

Dynamic deflection routing on arrays (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Adversarial queueing theory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Adaptive packet routing for bursty adversarial traffic

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Greedy dynamic routing on arrays

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Stability of networks and protocols in the adversarial queueing model for packet routing

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Scheduled hot-potato routing

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2

Universal stability results for greedy contention-resolution protocols

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems