Cited By
View all- Quirk J(1988)Teaching computer networks as a writing intensive courseACM SIGCSE Bulletin10.1145/45202.4521020:2(30-35)Online publication date: 1-Jun-1988
Computer Networks
Author: 
L. W. BrinnAuthors Info & Claims
L. W. BrinnAuthors Info & Claims
References
[1]
Abramson, N. and Kuo, F. ~ Communication Networks. Prentice-Hal}, Englewood Cliffs, ~., 1973.
[2]
Becher, W. and Aupperle, E. "The Communications Computer Hardware of the Merit Network,~' IEEE Transactions on Communications, vol. corn-20, no. 3, June 1977, pp. 516-526.
[3]
Dijkstra, E. "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. l, October 1959, pp. 269-271.
[4]
Doll, D. Data Communications. John Wiley, New York, |978.
[5]
Hamming, R. "Error Detecting and Error Correcting Codes," Bel____}l S_~ystem Technical Journal, vol. 29, April 1950, pp. 147-160.
[6]
Helmholtz, H. On the Sensations of. Tone. Dover, New York.
[7]
Jeans, J. Science and Music. Dover, New York.
[8]
Kleinrock, L. ~ S_y_stems. John Wiley, New York, 1976.
[9]
Kleinrock, L., Naylor, W., and Operbeck, H. "A Study of Line Overhead in the ARPANET," Communications of the ACt.l, vol. 19, no. l, January 1976, pp. 3-13.
[10]
Kleitman, D. "Methods for Investigating the Connectivity of Large Graphs," IEEE Transactions on Circuit ~, vol. ct-}6, May 1969, pp__232-233.
[11]
Kruskal, J. "On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem," Proceedinqs of the AMS, vol. 7, 1956, pp. 48-50.
[12]
Martin, J. Communications Satellite S xstems. Prentice Hall, Englewood Cliffs, N. J., 1978.
[13]
Martin, J. Teleprocessing Network Organization. Prentice Hall, Englewood Cliffs, N. J., 1970.
[14]
McQuillan, J., Falk, G., and Richer, I. "A Review of the Development and Performance of the ARPAI~ET Routing Algorithm," IEEE Transactions on Communications, vol. com-26, no. 12, December 1978, pp. 1802-1811.
[15]
McQuil!an, J., Richer, I., and Rosen, E. "The New Routing Algorithm for the ARPANET," IIZEE Transactions on Communications, vol. com-28, no. 5, May 1980, pp. 711-719.
[16]
Metcalfe, R. and Boggs, D. "Ethernet- Distributed Packet Switching for Local Computer Networks," Communications of the ACM, vol. 19, July 1976, pp. 395-404.
[17]
National Bureau of Standards. "The Data Encryption Standard," Federal Information Processing Standards Publication 46, January 1977.
[18]
Peterson, V. amd Brown, D, "Cyclic Codes for Error Detection," Proceedings of the IRE, vol. 49, January 1961, pp. 228-235.
[19]
Pritchard, W. "Satellite Communication - An Overview of the Problems and Programs," Proceedings of the IEEE, vol. 65, no. 3, ~larch i977,~ p-p.-~-94-3--30"~.
[20]
Tanenbaum, A. Computer Networks. Prentice Hal I, Engl ewood-~Cli ffs, N. J., T981.
[21]
Zimmerman, 11. "OSI Reference t.lodel - The ISO Model of Architecture for Open System Interconnection," IEEE Transactions on Communications, vol. com-28, no. 4, April 1980, pp. 42-~32.
Recommendations
Economic Perspectives on the History of the Computer Time-Sharing Industry, 1965-1985
The history of the computer time-sharing industry is one of the unwritten chapters in the overall history of computing. In this article, we show that the time-sharing industry constituted a major sector of the computer services industry until the early ...
A computer network monitoring system
In order to help satisfy'an apparent need for tools for monitoring the activities of a computer network (see Mamrak [1]), a system of special hardware and software, called a Computer Network Monitoring System (CNMS), is being implemented in the' ...
The progress of the national first-rate course "computer networks" in NUDT
SCE '08: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in ChinaComputer network has been in active development for several decades. It has been dramatically influenced by progress both in computer and communication technologies. In modern times, nearly everyone needs to use computer networks every day, and many ...
Comments
Information & Contributors
Information
Published In
Copyright © 1985 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1985
Published in SIGCSE Volume 17, Issue 1
Check for updates
Author Tag
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 886Total Downloads
- Downloads (Last 12 months)58
- Downloads (Last 6 weeks)18
Reflects downloads up to 10 Oct 2024
Other Metrics
Citations
Cited By
View all- Quirk J(1988)Teaching computer networks as a writing intensive courseACM SIGCSE Bulletin10.1145/45202.4521020:2(30-35)Online publication date: 1-Jun-1988
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in