Catalog Descriptions of Networked Systems Courses:

NetSys 201 Internet (4) [cross-listed with EECS 248A & ICS 243A]. A broad overview of basic Internet concepts. Internet architecture and protocols, including addressing, routing, TCP/IP, quality of service, and streaming. Prerequisite: EECS 148, ICS 153, or consent of instructor.

NetSys 202 Networking Laboratory (4) [cross-listed with ICS 243B]. 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 ICS 243C]. Fundamental concepts of switching, advanced medium access control methods, virtual circuits, integrated services, quality of service, performance models, simulation, measurement. Prerequisite: NetSys 201.

NetSys 220 Internet Technology (4) [cross-listed with ICS 243D]. Application layer Internet protocols, potentially including client/server, WWW, file sharing, group communications, Internet programming. Prerequisite: NetSys 201.

NetSys 230 Wireless and Mobile Networking (4) [cross-listed with ICS 243E]. 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 Security (4) [cross-listed with ICS 243G]. 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 250 Performance Analysis of Computer Communication Networks (4) [cross-listed with EECS 248B]. Introduction to performance analysis of computer communication networks. Error correction codes and data link layer protocols. Queuing models for communication networks. Multi-access communication. Flow and congestion controls. Routing and admission control. Mathematical modeling and optimization of network performance and design. Prerequisite: NetSys 201.

NetSys 251 Queueing Networks (4) [cross-listed with ICS 248]. 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 252 Computer Network Characterization (4). Stochastic models of computer and telecommunication network traffic and capacity. Loss networks, traffic characterization, large deviations results, models of wireless networks. Prerequisite: NetSys 201, and EECS 240 or consent of instructor.

NetSys 253 Linear Optimization Methods (3) [cross-listed with EECS 261A]. Formulation, solution, and analysis of linear programming and linear network flow problems. Simplex methods, dual ascent methods, interior point algorithms and auction algorithms. Duality theory and sensitivity analysis. Shortest path, max-flow, assignment, and minimum cost flow problems. Prerequisite: Mathematics 2J or consent of instructor.

NetSys 254 Nonlinear Optimization Methods (3) [cross-listed with EECS 261B]. Formulation, solution, and analysis of nonlinear programming problems. Unconstrained optimization, optimization over a convex set, Lagrange multiplier theory, Lagrange multiplier algorithms, duality theory, convex programming, dual methods, and multi-objective optimization theory. Emphasizes mathematical analysis. Prerequisite: Mathematics 2J or consent of instructor.

NetSys 255 Network Congestion and Flow Control theory (3) [cross-listed with EECS 262]. Congestion and flow control theory for network traffic engineering. Path control, flow assignment, and network management. Fundamental laws of network congestion, controllability, observability, manageability, and maxmin theories, and time-optimal queue control theory. Prerequisite: Basic understanding of networking, linear algebra, and advanced calculus.

NetSys 260 Distributed Systems Middleware (4) [cross-listed with ICS 243F]. 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 (2). Current research in networked systems. Includes talks by UCI faculty, visiting researchers, and networked systems graduate students. May be repeated for credit.