[Freq.: "1" = Offered most years, "2" = Offered approximately every 2 years, "r" = Offered rarely, "q" = Offered every quarter]
Catalog Descriptions of Networked Systems Courses:
NetSys 201 Internet (4) [cross-listed with EECS 248A & CS 232]. A broad overview of basic Internet concepts. Internet architecture and protocols, including addressing, routing, TCP/IP, quality of service, and streaming. Prerequisite: EECS 148, CS 132, or consent of instructor.
NetSys 202 Networking Laboratory (4) [cross-listed with CS 233]. A laboratory-based introduction to basic networking concepts such as addressing, sub-netting, bridging, ARP, and routing. Network simulation and design. Structured around weekly readings and laboratory assignments. Prerequisite: NetSys 201.
NetSys 210 Advanced Networks (4) [cross-listed with CS 234]. Fundamental concepts of switching, advanced medium access control methods, virtual circuits, integrated services, quality of service, performance models, simulation, measurement. Prerequisite: NetSys 201.
NetSys 230 Wireless and Mobile Networking (4) [cross-listed with CS 236]. Introduction to wireless networking. The focus is on layers 2 and 3 of the OSI reference model, design, performance analysis, and protocols. Topics covered include: an introduction to wireless networking, digital cellular, next generation cellular, wireless LANs, and mobile IP. Prerequisite: NetSys 201, and an introductory course in probability or consent of instructor.
NetSys 240 Network and Distributed System Security (4) [cross-listed with CS 203]. Overview of modern computer and networks security: attacks and countermeasures. Authentication, identification, data secrecy, data integrity, authorization, access control, computer viruses, network security. Group communication and multicast security techniques. Also covers secure e-commerce and applications of public key methods, digital certificates, and credentials. Prerequisites: NetSys 201.
NetSys 251 Queueing Networks (4) [cross-listed with CS 231]. Probability, random processes and queueing theory applied to computer networks. Poisson processes, Markov chains, queues, queueing networks, simulation. Prerequisite: NetSys 201, and an introductory course in probability.
NetSys 256 Network Coding (4) [cross-listed with EECS 246]. Theoretical frameworks for network coding: linear, algebraic and random network coding; linear programming and combinatorical frameworks. Network code design. Benefits and costs. Practical network coding. Applications to wireless networks, content distribution, security, and other areas.
NetSys 260 Middleware for Networked and Distributed Systems (4) [cross-listed with CS 237]. Discusses concepts, techniques, and issues in developing distributed systems middleware that provides high performance and Quality of Service for emerging applications. Also covers existing standards (e.g., CORBA, DCOM, Jini, Espeak) and discuss their relative advantages and shortcomings. Prerequisite: an undergraduate-level course in operating systems and networks, or consent of instructor.
NetSys 261 Distributed Computer Systems (3) [cross-listed with EECS 218]. Design and analysis techniques for decentralized computer architectures, communication protocols, and hardware-software interface. Performance and reliability considerations. Design tools. Prerequisites: EECS 211 and EECS 213.
NetSys 270 Topics in Networked Systems (4). Study of Networked Systems concepts. Prerequisite: consent of instructor. May be repeated for credit as topics vary.
NetSys 295 Networked Systems Seminar (1). Current research in networked systems. Includes talks by UCI faculty, visiting researchers, and networked systems graduate students. May be repeated for credit.