| | Standard Course Syllabus | Course Supervisor | Date of Approval |
| | Dept. of Electrical and Computer Engineering | Ekici | 3/05 |
| | 701 | Communication Networks |
| | 2. | CATALOG DESCRIPTION |
| | Introduction to modern communication networks; data traffic, queuing models, multiaccess channels, and selected |
| | applications. |
| | Quarters of Offering | Credits | | Level | Class Meeting |
| | Sp Qtr. | 3 | U G | 3 cl. |
| | Course Prerequisites |
| | Prereq: Math 530 or Stat 427 or equiv or grad standing. |
| | 3. | PREREQUISITES BY TOPIC |
| | Random variables, probability distributions and densities, joint and conditional probability. Expectations, moments, |
| | moment generating functions. Functions of random variables. Familiarity with some operating systems concepts, such as |
| | the notion of processes and interprocess communication and synchronization. |
| | Courses that require this as a direct prerequisite |
| | 867 |
| | 4. | Text(s) and Other Course Materials | Author(s) | Publisher |
| | Data Networks, 2nd Ed., 1992 | Bertsekas & Gallager | Prentice-Hall |
| | References (supplemental reading) |
| | [1] Jean Walrand and Pravin Varaiya, ``High-performance communication networks,'' 1996, Morgan Kaufmann, Inc. |
| | [2] William Stallings, ``Data and Computer Communications,'' fourth edition, 1994, MacMillan, Inc. |
| | 5. | COURSE OBJECTIVES |
| | 1. Students learn modern communication networks, and the mathematical models that characterize communication networks. |
| | (Criterion 3(a)) |
| | 2. Students learn the basic design of communication networks at a logical level including the layered network architecture as |
| | well as the functions for each layer. (Criterion 3(c)) |
| | 3. Students learn about the mathematical models for networks and their applications to real network examples. (Criterion |
| | 3(a)) |
| | 4. Students evaluate their proposals using network simulation tools. (Criteria 3(b),(e),(k)) |
| | 6. | TOPICS AND (# OF LECTURES) |
| | Introduction and Layered network architecture (2) |
| | Queuing models: Little's theorem, M/M/1 and M/G/1 queues, Jackson's network (9) |
| | Data link control: error detection, retransmission strategies, framing (3) |
| | Multiaccess communication: random access, carrier sense, and reservation based multiaccess (3) |
| | Network and transport layers: routing algorithms, flow control theory (6) |
| | Advances in modern networks: ATM, quality-of-service (QoS) control, Integrated/Differentiated services, mobile |
| | communication (4) |
| | 7. | CLASS MEETING PATTERN | (For example, "3cl." means 3 48-min classes per week.) |
| | 3 cl. |
| | Thursday, August 14, 2008 09:19 AM |
| | Page 1 of 2 |