Descriptions of Core Courses

ENM 503: Introduction to Probability and Statistics

Prerequisite: Math 240 or equivalent

Introduction to probability. Expectation. Variance. Covariance. Joint probability. Moment generating functions. Stochastic models and applications. Markov chains. Renewal processes. Queuing models. Statistical inference. Linear regression. Computational probability. Discrete-event simulation.

EE 530: Elements of Probability Theory and Random Processes

Prerequisite: A semester of undergraduate probability at the level of STAT 430 or SYS 301

This rapidly moving course provides a formal, non-measure theoretic development of fundamental ideas in probability theory and random processes. This course is a preprequisite for subsequent courses in communication theory and telecommunications such as EE 576 and TCOM 501. The course is also suitable for students seeking a broad graduate-level exposure to probabilistic ideas and principles with applications in diverse settings. Topics covered include: discrete and continuous probability spaces; combinatorial probabilities; conditional probability and independence; Bayes rule and the theorem of total probability density functions, and probability mass functions; independent random variables; Borel's normal law; measures of central tendency---mean, median, mode; mathematical expectation; moments; moment generating functions and characteristic functions; tail inequalities---Markov, Chebyshev, Chernoff; limit theorems; random processes; Gaussian and Poisson processes; stationarity and ergodicity; correlations functions; spectral densities; filtered random processes; bandlimited processes and the sampling theorem.

TCOM 500: Introduction to Networks and Protocols

Prerequisites: Undergraduate Probability, basic programming

This course introduces the principles of computer networs and associated protocols that form the basis ofmodern telecommunications networks. The course emphasizes basic analytical understanding of the ideas rather than software and specific implementations. Topics covered include store-and forward packet switching, link layer and error control, multiple access and local area networks (Ethernet, token rings, and FDDI), and ATM. Network and transport layer protocols of the Internet TCP/IP suite are studied, including IP routing and forwarding, ICMP, end-to-end reliabiltiy, and flow control. Congestion control and its implementation in TCP is discussed. Basic approaches for network security are examined. Specific applications and aspects such as data compression and streaming may also be covered.

TCOM 501: Networking -- Theory and Fundamentals

Prerequisites: TCOM 500 and ENM 503/EE 530 or equivalents

Whereas TCOM 500 focuses on contemporary networking technology, the course examines the underlying concepts and analytical models of networks. Network congestion is studied in-depth, including a variety of queueing models that aid engineers to design networks with high throughputs and low delays. Classical error-control schemes, which combine error detection and retransmissions, are discussed and analyzed. Basic concepts in routing theory are explored, including shortest-path and spanning-tree schemes, and asynchronous algorithms. The course also covers multiaccess communication, including the ALOHA and CSMA/CD protocols.

TCOM 502: Advanced Networking Protocols

Prerequisites: TCOM 500, TCOM 501 or equivalents

Naming and addressing: IP and ATM addresses, subnetting, DHCP and NATs. Routing Protocols: Interior Gateway Protocols, eg, Distance vector protocols (RIP2 and EIGRP), Link state protocols (OSPF); Exterior Gateway Protocols (BGP); ATM Routing (PNNI); Multicast routing protocols (DVMRP, CBT, PIM). Address Lookup Mechanisms: Exact match (hash and label based lookups), Longest prefix matches (balanced trees and Patricia tries). Signalling Protocols: ATM signalling, RSVP signalling. IP and ATM Interactions: IP over ATM, Next Hop Resolution Protocol (NHRP). Multi-Protocol Label Switching (MPLS). Traffic Management and ATM and IP Services: Leaky bucket based traffic contracts, Service guarantees and enforcement, Basic mechanisms (scheduling, buffer management, call admission).

This course assumes a basic knowledge of networking and related technologies, e.g., as covered in TCOM 500.

TCOM 512: . Application and Transport Protocols

Prerequisites: TCOM 500 (can be corequisite), and sufficient programming knowledge to edit, write, and debug programs in C, and basic undergraduate mathematical background including elementary probability.

This course covers the design, analysis, and implementation of application- and transport-level protocols. We teach basic techniques of framing, error recovery, reliable delivery, flow control, adaptation to congestion, presentation (and representation) of data, authentication and security, as applied to conversational, transactional, and dissemination-oriented transport and application level protocols. In addition to hands-on experience designing and implementing network protocols in C using the BSD socket interface, we also teach elementary modeling (through both simulation and analytic models) and measurement of network protocols.

TCOM 601:

Prerequisites: TCOM 501 or equivalent

Traffic Management and Call Admission: traffic characterization, traffic shaping, admission control, statistical multiplexing, effective bandwidth. Scheduling: fair queuing, rate-controlled service disciplines. Buffer Management: pushout, threshold, random early detection, sharing mechanisms (complete partitioning, complete sharing, hybrids), coupling buffer management and scheduling. Markov decision process and application in resource allocation (memory,bandwidth allocation). Switching: input queuing, output queuing, shared memory, combined input/output queuing. Maximum throughput in input queued switches, emulating output queuing with input queuing via speedup. Building larger switches: ClOS networks, banyan networks, etc. TCP modeling.