Local-Area Subnetworks: A Performance Comparison

IEEE Transactions on Communications

Volumn 29, Issue 10, 1981, Pages 1465-1473

  Bux, Werner ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS;

EID: 0019621215     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1981.1094893     Document Type: Article

References (19)

1. B. K. Penney and A. A. Baghdadi, “Survey of computer communications loop networks: Parts 1 and 2,” Comput. Commun., vol. 2, pp. 165-180, 244-241. 1979.
2. D. D. Clark. K. T. Pogran, and D. P. Reed, “An introduction to local area networks,” Proc. IEEE, vol. 66, pp. 1497-1517, 1978.
3. P. J. Kuehn, “Multiqueue systems with nonexhaustive cyclic service,” Bell Syst. Tech. J., vol 58, pp. 671-698, 1979.
4. A. R. Kaye, “Analysis of a distributed control loop for data transmission,” in Proc. Comput. Commun. Networks and Teletraffic Symp. Brooklyn, NY: Polytechnic. 1972, pp. 47-58.
5. A.G. Konheim and B. Meister, “Waiting lines and times in a system with polling,” J. Ass. Comput. Mach., vol. 21, pp 470-490, 1974.
6. J. S. Sykes, “Simplified analysis of an alternating-priority queueing model with setup times,” Oper. Res., vol. 18, pp. 1182-1192, 1970.
7. A. Hopper, “Data ring at computer laboratory, University of Cambridge,” in Computer Science and Technology: Local Area Networking. Washington. DC: Nat. Bur. Stand., NBS Special Pub. 500-31. 1977, pp. 11-16.
8. L. Kleinrock, “Time-shared systems: A theoretical treatment,” J. Ass. Comput. Mach., vol. 14, pp. 242-261. 1967.
9. L. Kleinrock, Queueing Systems, Vols. 1 and 2. New York: Wiley, 1975, 1976.
10. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, “Open, closed, and mixed networks of queues with different classes of customer,” J. Ass. Comput. Mach., vol. 22, pp. 248-260, 1975.
11. L. Kleinrock and F. A. Tobagi, “Packet switching in radio channels: Part I—Carrier sense multiple-access modes and their throughput-delay characteristics,” IEEE Trans. Commun., vol. COM-23, pp. 1400-1416, 1975.
12. R. M. Metcalfe and D. R. Boggs, “Ethernet: Distributed packet switching for local computer networks,” Commun. Ass. Comput. Mach., vol. 19, pp. 395-404, 1976.
13. S. S. Lam, “A carrier sense multiple access protocol for local networks,” Comput. Networks, vol. 4, pp. 21-32, 1980.
14. F. A. Tobagi and V. B. Hunt, “Performance analysis of carrier sense multiple access with collision detection.” Comput. Networks, vol 4, pp. 245-259, 1980.
15. E. H. Rothauser and D. Wild, “MLMA: A collision-free multiaccess method,” in Proc. IFIP Congress 77. Amsterdam, The Netherlands: North-Holland, 1977, pp. 431-436.
16. J. W. Mark, “Global scheduling approach to conflict-free multiaccess via a data bus,” IEEE Trans. Commun., vol COM-26, pp. 1342-1352, 1978.
17. D. M. Taub, “Contention-resolving circuits for computer interrupt systems,” Proc. Inst. Elec. Eng., vol 123, pp. 845-850, 1976.
18. A. K. Agrawala, J. R. Agre, and K. D. Gordon, “The slotted vs. the token-controlled ring: A comparative evaluation,” in Proc. COMPSAC 1978. Chicago, 1L: IEEE, 1978, pp. 674-679.
19. M. A. Leibowitz, “An approximate method for treating a class of multiqueue problems,” IBM J. Res. Develop., vol. 5, pp. 204-209, 1961.