1. N.M. A. Ayad and F. A. Mohamed. Performance analysis of a cut-through vs. packet-switching techniques. InProceedings of the Second IEEE Symposium on Computers and Communications, pp. 230–234, 1997.
2. Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell. On update algorithms for quickest paths.Computer Communications, 23: 1064–1068.
3. Y. C. Bang, S. Radharkrishnan, N. S. V. Rao, and S. G. Batsell. On multicasting with minimum end-to-end delay. ICCCN 1999, 604–609, 1999.
4. Y. L. Chen and Y. H. Chin, The quickest path problem.Computers and Operations Research, 17 (2): 153–161.
5. T. H. Cormen, Charles E. Leiserson, and Ronald L. Rivest.Introduction to Algorithms. MIT Press, 1996.