ESE 546, Analysis & Synthesis of Communication Networks
This is course's goal is to enable students to competently solve common mathematical models used in networking (as well as computer systems). Algorithms are emphasized.
Algorithms for search, error codes, public key cryptography, digital signature, and data compression.
Continuous Time Queueing Models including one dimensional Markov chains, performance measures, applied 1-d models.
Discrete Time Queuing Models including discrete time Markov chains, arrival processes, Geom/Geom/1 and Geom/Geom/N queueing models and space division switch case studies.
OSI layered protocol model, data link modeling, routing algorithms, multiple access theory, protocl verification.
(1) [required] Thomas Robertazzi, Networks and Grids: Technology and Theory, Springer, 2007.
(2) [required] 9 Algorithms that Changed the Future, John MacCormick, Princeton University Press.
(3) [optional] Thomas Robertazzi, Computers Networks and Systems: Queueing Theory and Performance Evaluation, 3rd edition, 2000, Springer.
ESE 504, Performance Evaluation of Computer and Communication Systems
This course examines advanced queueing and scheduling models useful for the performance evluation of computer and communication systems.
Part I: Divisible Load Scheduling Models (January to February):
Using divisible (partitionable) loads, models of integrated computation and communication are created and evaluated for performance. Applications include parallel systems and grid computing.
Part II: Advanced Queueing Models (March to May):
Transient queue models, M/G/1 queues, networks of queues, computational algorithms, stochastic Petri nets and self-similar traffic and related models.
Texts: Part II: Thomas Robertazzi, Computers Networks and Systems: Queueing Theory and Performance Evaluation, 3rd edition, 2000, Springer. Part I: chapter 5, Thomas Robertazzi, Networks and Grids: Technology and Theory, Springer, 2007. An electronic copy of chapter 5 is available for about 25 dollars from springerlink.com The title of chapter 5 is "Divisible Load Modeling for Grids". Books will be at campus bookstore (back of Main Library).
ESE 346: Computer Communications
This course provides an introduction to the theory and practice of computer networks. "Computer networks" is a rapidly growing field involving the interconnection of machines and people, across the country and throughout the world. The basic problem is how one gets networks of dozens, hundreds or thousands of links and nodes to function smoothly and reliably together. The Internet is an example of a computer network.
We will discuss local area networks, packet networks and circuit switched networks. Local area network protocols to be discussed include ethernet, fast ethernet, gigabit ethernet, token ring and wireless local area networks including Bluetooth. Among "hot" topics to be covered are high speed communication via ATM, the fiber optic standard SONET, WDM, TCP/IP, grid computing, web server load balancing and network security. The course will consist of a mixture of a practical look at networks and their protocols and at the basic mathematical theory of evaluating and operating such networks using statistical models.
Some prior exposure to basic probability (i.e. means, variance, distributions) is helpful and is the reason behind the prerequisites. There will probably be 1 or 2 projects of moderate complexity in this course.
Prerequisite: For ESE/ECE Majors: ESE 306. For CSE majors: CSE 220 and AMS 310 or 311.
Textbook: The text is T.G. Robertazzi, Networks and Grids: Technology and Theory, Springer, 2007. The ISBN number is 978-0-387-36758-3. Note that Prof. Robertazzi authored another book from Springer with a somewhat similar sounding title. Be sure to get the Networks and Grids book. Will be available at campus bookstore behind the Main Library.
ESE 306: Random Signals and Systems
This course provides an introduction to the theory and practice of probability and stochastic (random) processes. These topics are widely used in fields such as telecommunications, networking, reliability and solid state manufacturing.
Topics to be covered include random experiments and events, random variables, probability distribution, density functions and basic distribution measures such as mean and variance.
Also covered are continuous and discrete probability models, common probability distributions and basic arrival processes.
Note: ESE 306 is a required course in both the electrical and computer engineering majors.
Prerequisites: ESE 305.
Textbook: Probability and Stochastic Processes, by R. Yates and D. Goodman from Wiley, 2nd edition (to be published May 2004). At campus book store.
ESE 540, Reliability Theoy
Mathematical and statistical means of evaluating the reliability of systems of components. Analytical models for system analysis, lifetime distributions, repairable systems, warranties, preventative maintenance and inspection. Software reliability and deadlocks in computer systems.
Texts: L. Leemis, Reliability: Probabilistic Models and Statistical Methods, Prentice-Hall, 1995 1st edition. There is a 2nd edition but we are using the 1st edition. Also the deadlock material will be from chapter 3 of Modern Operating Systems by A. Tanenbaum published by Prentice-Hall, 2001. Discussions on reliability in practice will be from Inviting Disaster by James Chiles (a paperback available at low cost over the Internet). Leemis will be at campus bookstore (back of Main Library).
ESE 305: Deterministic Signals and Systems
This course provides an introduction to the theory and practice of signals and systems. This is the course you need to take if you are going to understand communication and electronic systems. It is also a required course for both the electrical and computer engineering majors. Topics include analog and digital signals, sampling, convolution, FIR and IIR digital filters, differential and difference equations, z transforms, Fourier series, Fourier transforms, frequency response and filtering.
Prerequisites: ESE 271.
Textbook: Signals and Systems by Chi Chen, 3rd edition, Oxford University Press.
ESE 271: Electrical Circuit Analysis I
This course provides an introduction to the theory of electric circuits. Topics include:
Part I, Kirchoff's Laws, Ohm's Law, Nodal and Mesh Analysis of Circuits, Inductors and Capacitors.
Part II, Steady State AC, Transient Analysis using Laplace Transforms, AC Power.
Prerequisites: Check undergraduate guides for EE and CE.
Textbook: The text is Johnson and Johnson, Electric Circuit Analysis, 3rd edition, Wiley. If you want a book with worked out problems, I recommend the Schaum's outline series of college level worked out problem books.