ELE/CS 520 MATHEMATICAL SEMINAR - Title: MULTI-USER COMMUNICATION SYSTEMS

Spring 1984-85

Professor Sergio Verdú

Objective:

This is a course in modelling and analysis of multi-user communication systems. The models considered are representative of a wide variety of data communication systems where there is more than one source and/or destination; e.g., computer networks, satellite broadcast channels and radio networks. Emphasis will be on the acquisition of mathematical tools and their application in the rigorous formulation and analysis of multi-user communication systems. The goal is to provide the student with a research-level understanding of the subject by focusing on some research topics of current interest.

Prerequisites:

A course in Probability and Random Processes (such as EECS 525) and previous exp osure to Data Communication Systems (on the level of EECS 486).

Material will be selected from journal articles and from the following books: J.F. Hayes, Modeling and Analysis of Computer Communication Networks, New York: Plenum, 1984. L. Kleinrock, Queueing Systems, Vol. I: Theory, New York: Wiley, 1975. F.P. Kelly, Reversibility and Stochastic Networks, New York: Wiley, 1979. V. Ahuja, Design and Analysis of Computer Communication Networks, New York: McGraw-Hill, 1982. W.Chou, Ed., Computer Communications, Vol. I: Principles, Englewood Cliffs, NJ: Prentice-Hall, 1983. J.K. Skwirzynski, Ed., New Concepts in Multi-User Communication, Alphen can den Rijn, Netherlands: Sijthoff and Noordhoff, 1982. G. Longo, Ed., Multi-User Communication Systems, Vienna and New York: Springer-Verlag, 1981. Course Outline

I. Introduction to Queueing Theory - I1. Discrete-State Markov Processes - I2. Birth-Death Processes and Birth-Death Queueing Systems - I3. Renewal Theory and the M/G/1 Queue - I4. G/M/1 and G/G/1 Queues

II. Networks of Queues - II1. Reversibility of Markov Processes - II2. Open and Closed Networks; Jackson's Theorem

III. Network Routing - III1. Deterministic Routing: Shortest-paths and Minimum-delay Algorithms - III2. Centralized and Decentralized Adaptive Routing - III3. Dynamic Routing Problems in Queueing Networks

IV. Multi-user Signal Detection - IV1. Optimum Detection in Gaussian Multiple-access Channels - IV2. Error Probability Analysis - IV3. Multi-user Asymptotic Efficiencies

V. Multiple-access Packet-broadcasting Techniques - V1. Access by Reservation: TDMA, FDMA - V2. Random Access: Throughput Analysis - V2a. ALOHA - V2b. Contention Resolution Algorithms


This page maintained by Michelle Young - Last Modified 11/20/96