Matthew Andrews - Publications

  1. Probabilistic end-to-end delay bounds for earliest-deadline-first scheduling, M. Andrews, submitted for publication.
  2. The effects of temporary sessions on network performance, M. Andrews and L. Zhang, submitted for publication.
  3. Instability of FIFO in session-oriented networks, M. Andrews, submitted for publication.
  4. Packet routing with arbitrary end-to-end delay requirements, M. Andrews and L. Zhang, Proceedings of the 31st ACM Symposium on Theory of Computing, 1999.
  5. Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule, M. Andrews and L. Zhang, Proceedings of IEEE INFOCOM, 1999.
  6. Integrated scheduling of unicast and multicast traffic in an input-queued switch, M. Andrews, S. Khanna and K. Kumaran, Proceedings of IEEE INFOCOM, 1999.
  7. Dynamic bandwidth allocation algorithms for high-speed data wireless networks, M. Andrews, S. C. Borst, F. Dominique, P. R. Jelenkovic, K. Kumaran, K. G. Ramakrishnan and P. Whiting, Bell Labs Technical Journal, 1998.
  8. The access network design problem, M. Andrews and L. Zhang, Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, 1998.
  9. Stability results for networks with input and output blocking, M. Andrews and L. Zhang, Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
  10. TED models for ATM internetworks, K. Perumalla, M. Andrews and S. Bhatt, ACM Sigmetrics Performance Evaluation Review, 1998.
  11. A virtual PNNI network testbed, K. Perumalla, M. Andrews and S. Bhatt, Proceedings of the Winter Simulation Conference, 1997.
  12. A performance comparison of competitive on-line routing and state-dependent routing, L. Zhang, M. Andrews, W. Aiello, S. Bhatt and K. R. Krishnan, Proceedings of GLOBECOM '97, 1997.
  13. General dynamic routing with per-packet delay guarantees of O(distance + 1/session rate), M. Andrews, A. Fernandez, M. Harchol-Balter, T. Leighton and L. Zhang, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, 1997.
  14. Scheduling techniques for packet routing, load balancing and disk scheduling, M. Andrews, MIT, 1997.
  15. Universal stability results for greedy contention-resolution protocols, M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton and Z. Liu, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
  16. New algorithms for the disk scheduling problem, M. Andrews, M. Bender and L. Zhang, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
  17. Open problems for latency hiding in networks of workstations, M. Andrews, T. Leighton, P. T. Metaxas and L. Zhang, Proceedings of the 7th Australia Workshop on Combinatorial Algorithms, 1996.
  18. Improved methods for hiding latency in high bandwidth networks, M. Andrews, T. Leighton, P. T. Metaxas and L. Zhang, Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures, 1996.
  19. Improved bounds for on-line load balancing, M. Andrews, M. X. Goemans and L. Zhang, Proceedings of the 2nd International Computing and Combinatorics Conference, 1996.
  20. Automatic methods for hiding latency in high bandwidth networks, M. Andrews, T. Leighton, P. T. Metaxas and L. Zhang, Proceedings of the 28th ACM Symposium on Theory of Computing, 1996.