|[Abr63]||N. Abramson, Information Theory and Coding, New York: McGraw-Hill, 1963.|
|[ABF01]||M. Allman, H. Balakrishnan, and S. Floyd, “Enhancing TCPs Loss Recovery Using Limited Transmit,” RFC 3042, 2001.|
|[ADL95]||J. S. Ahn, P. B. Danzig, Z. Liu, and L. Yan, “Evaluation with TCP Vegas: Emulation and Experiment,” ACM SIGCOMM Comput. Commun. Rev., Vol. 25, No. 4, 1995, pp. 185–195.|
|[AhD89]||H. Ahmadi and W. Denzel, “A Survey of Modern High-Performance Switch Fabric for Integrated Circuit and Packet Switching,” IEEE J. Select. Areas Commun., Vol. 7, No. 7, 1989.|
|[AKS83]||M. Ajtai, J. Komlos, and E. Szemeredi, “An O(n log n) Sorting Network,” Proceedings of the 15th ACM Symposium on Theory of Computation, 1983, pp. 1–9.
A significant theoretical breakthrough: the first O(n log n) sorting network. The constant in front of the n log n, however, is rather large, rendering this network impractical.
|[AMS81]||D. Anick, D. Mitra, and M. M. Sondhi, “Stochastic Theory of a Data-Handling System with Multiple Sources,” Bell Syst. Tech. J., Vol. 61, No. 8, 1982, pp. 1871–1894.
The original work on the application of the fluid-flow model that led to much subsequent work by others. This book attempts to simplify the presentation in the paper to make the theory more accessible to undergraduate students. Some details have been omitted.
|[Bar64]||P. Baran, “On Distributed Communications Networks,” IEEE Trans. Commun., Vol. 12, 1964, pp. 1–9.
The first paper on deflection routing ...